Results 11  20
of
58
A Numerical Optimization Approach to General Graph Drawing
, 1999
"... Graphs are ubiquitous, finding applications in domains ranging from software engineering to computational biology. While graph theory and graph algorithms are some of the oldest, most studied fields in computer science, the problem of visualizing graphs is comparatively young. This problem, known as ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
Graphs are ubiquitous, finding applications in domains ranging from software engineering to computational biology. While graph theory and graph algorithms are some of the oldest, most studied fields in computer science, the problem of visualizing graphs is comparatively young. This problem, known as graph drawing, is that of transforming combinatorial graphs into geometric drawings for the purpose of visualization. Most published algorithms for drawing general graphs model the drawing problem with a physical analogy, representing a graph as a system of springs and other physical elements and then simulating the relaxation of this physical system. Solving the graph drawing problem involves both choosing a physical model and then using numerical optimization to simulate the physical system. In this
A ForceDirected MacroCell Placer
, 2000
"... In this paper we present a novel forcedirected placement algorithm, which is used to solve macrocell placement problems. A new wire model replaces the traditional clique model and makes possible early awareness of routing congestion. Issues such as cell orientation, overlap elimination, and pad po ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
(Show Context)
In this paper we present a novel forcedirected placement algorithm, which is used to solve macrocell placement problems. A new wire model replaces the traditional clique model and makes possible early awareness of routing congestion. Issues such as cell orientation, overlap elimination, and pad positioning are also considered. Experiments show satisfactory performance and fast run time. 1. Introduction The forcedirected placement algorithm [2,3,7] simulates the mechanics problem in which particles are attached to springs and their movement obeys Hooke's law. In the conventional forcedirected methods cells are regarded as points no matter what real shapes and sizes they have. In addition, all the terminals of a cell are concentrated onto a single point. One of the benefits of the single point model is that it clusters wires that connect terminals of the same pair of cells. This approximation is acceptable in standard cell design, because standard cells are small as compared to the...
Using Singular Value Decomposition to Visualise Relations within MultiAgent Systems
 In Proceedings of the third Conference on Autonomous Agents
, 1999
"... In this paper, we develop methodologies and algorithms for multiagent visualisation. For different systems such as mobile, personal, or communicating agents, we identify metrics to define a distance between individual agents. Given a distance table, we develop an algorithm based on spring embe ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
In this paper, we develop methodologies and algorithms for multiagent visualisation. For different systems such as mobile, personal, or communicating agents, we identify metrics to define a distance between individual agents. Given a distance table, we develop an algorithm based on spring embedding and one on matrix theory to visualise the agents. We evaluate the algorithm in several scenarios.
Routing Architecture and Layout Synthesis for MultiFPGA Systems
 UNIVERSITY OF TORONTO
, 1999
"... MultiFPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing architecture, which is the manner in which wires, FPGAs and FieldProgrammable Interconnect Devices (FPIDs) are connected. Thi ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
MultiFPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing architecture, which is the manner in which wires, FPGAs and FieldProgrammable Interconnect Devices (FPIDs) are connected. This
Elastic Flow in an Application Specific NetworkonChip
 in: Third International Workshop on Formal Methods in Globally Asynchronous Locally Synchronous Design (FMGALS 07), Elsevier Electronic Notes in Theoretical Computer Scinece
, 2007
"... A NetworkonChip (NoC) is increasingly needed to interconnect the large number and variety of Intellectual Property (IP) cells that make up a SystemonChip (SoC). The network must be able to communicate between cells in different clock domains, and do so with minimal space, power, and latency over ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
A NetworkonChip (NoC) is increasingly needed to interconnect the large number and variety of Intellectual Property (IP) cells that make up a SystemonChip (SoC). The network must be able to communicate between cells in different clock domains, and do so with minimal space, power, and latency overhead. In this paper, we describe an asynchronous NoC using an elasticflow protocol, and methods of automatically generating a topology and router placement. We use the communication profile of the SoC design to drive the binarytree topology creation and the physical placement of routers, and a forcedirected approach to determine router locations. The nature of elasticflow removes the need for large router buffers, and thus we gain a significant power and space advantage compared to traditional NoCs. Additionally, our network is deadlockfree, and paths have bounded worstcase communication latencies. Keywords: VLSI, GALS, Networkonchip, Asynchronous 1
Approaches to visualisation in bioinformatics: from dendrograms to Space Explorer
, 2001
"... With the data explosion in biology visualisation techniques are of paramount importance for further progress. In this paper, we review traditional visualisation by clustering and dendrogram, which are prevailent in biology. We discuss its shortcomings and develop an alternative approach: Space Explo ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
With the data explosion in biology visualisation techniques are of paramount importance for further progress. In this paper, we review traditional visualisation by clustering and dendrogram, which are prevailent in biology. We discuss its shortcomings and develop an alternative approach: Space Explorer .
MultiAgent Visualisation Based on Multivariate Data
 In Working Notes of the Fourth UK Workshop on MultiAgent Systems UKMAS01
, 2001
"... Interesting features of complex agent systems can be captured as multivariate data. There are a number of different approaches to visualizing such data. In this paper, we focus on methods which reduce the dimensions of the data through matrix transformations and then visualise the entities in the lo ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Interesting features of complex agent systems can be captured as multivariate data. There are a number of different approaches to visualizing such data. In this paper, we focus on methods which reduce the dimensions of the data through matrix transformations and then visualise the entities in the lowerdimensional space.
New theoretical results on quadratic placement
 in Integration – a VLSI Journal Jens Vygen ICCAD 2002 Placement Tutorial 120
"... Current tools for VLSI placement are based either on quadratic placement, or on mincut heuristics, or on simulated annealing. For the most complex chips with millions of movable objects, algorithms based on quadratic placement seem to yield the best results within reasonable time. In this paper we ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Current tools for VLSI placement are based either on quadratic placement, or on mincut heuristics, or on simulated annealing. For the most complex chips with millions of movable objects, algorithms based on quadratic placement seem to yield the best results within reasonable time. In this paper we prove several new theoretical results on quadratic placement. We point out connections to random walks and electrical networks. Moreover, we argue that quadratic placement has, in contrast to the other approaches, some welldefined stability properties. Finally, we consider the question how to choose the weights of the clique edges representing a multiterminal net optimally.
On Nearly Symmetric Drawings of Graphs
"... We propose a forcedirected approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowing the sequence of edge contractions sufficient for turning an asymmetric graph into a symmetric subgraph, our approach i ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We propose a forcedirected approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowing the sequence of edge contractions sufficient for turning an asymmetric graph into a symmetric subgraph, our approach in symmetric drawing begins by drawing a graph's maximum symmetric subgraph using a forcedirected method first; then the contracted edges are reinserted back into the drawing. Considering symmetry as the underlying aesthetic criterion, our algorithm provides better drawings than the conventional spring algorithms, as our experimental results indicate.