Results 1  10
of
138
Graph Drawing by Forcedirected Placement
, 1991
"... this paper, we introduce an algorithm that attempts to produce aestheticallypleasing, twodimensional pictures of graphs by doing simplified simulations of physical systems. We are concerned with drawing undirected graphs according to some generally accepted aesthetic criteria: 1. Distribute the v ..."
Abstract

Cited by 429 (0 self)
 Add to MetaCart
this paper, we introduce an algorithm that attempts to produce aestheticallypleasing, twodimensional pictures of graphs by doing simplified simulations of physical systems. We are concerned with drawing undirected graphs according to some generally accepted aesthetic criteria: 1. Distribute the vertices evenly in the frame. 2. Minimize edge crossings. 3. Make edge lengths uniform. 4. Reflect inherent symmetry. 5. Conform to the frame. Our algorithm does not explicitly strive for these goals, but does well at distributing vertices evenly, making edge lengths uniform, and reflecting symmetry. Our goals for the implementation are speed and simplicity. PREVIOUS WORK Our algorithm for drawing undirected graphs is based on the work of Eades which, in turn, evolved from a VLSI technique called forcedirected placement
BigBang Simulation for Embedding Network Distances in Euclidean Space
, 2004
"... Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selection, and application level routing. We propose a new graph embedding scheme called BigBang Simulation (BBS), which simulates a ..."
Abstract

Cited by 133 (4 self)
 Add to MetaCart
Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selection, and application level routing. We propose a new graph embedding scheme called BigBang Simulation (BBS), which simulates an explosion of particles under force field derived from embedding error. BBS is shown to be significantly more accurate, compared to all other embedding methods including GNP. We report an extensive simulation study of BBS compared with several known embedding schemes and show its advantage for distance estimation (as in the IDMaps project), mirror selection and topology aggregation.
A fast adaptive layout algorithm for undirected graphs
, 1995
"... Abstract. We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the springembedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscilla ..."
Abstract

Cited by 101 (1 self)
 Add to MetaCart
Abstract. We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the springembedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations. The proposed algorithm achieves drawings of high quality on a wide range of graphs with standard settings. Moreover, the algorithm is fast, being thus applicable on general undirected graphs of substantially larger size and complexity than before [9, 6, 3]. Aesthetically pleasing solutions are found in most cases. We give empirical data for the running time of the algorithm and the quality of the computed layouts. 1
A Multilevel Algorithm for ForceDirected GraphDrawing
, 2003
"... We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a forcedirected placement algorithm. ..."
Abstract

Cited by 88 (3 self)
 Add to MetaCart
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a forcedirected placement algorithm.
A Fast MultiScale Method for Drawing Large Graphs
 JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2002
"... We present a multiscale layout algorithm for the aesthetic drawing of undirected graphs with straightline edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawi ..."
Abstract

Cited by 79 (10 self)
 Add to MetaCart
We present a multiscale layout algorithm for the aesthetic drawing of undirected graphs with straightline edges. The algorithm is extremely fast, and is capable of drawing graphs that are substantially larger than those we have encountered in prior work. For example, the paper contains a drawing of a graph with over 15,000 vertices. Also we achieve "nice" drawings of 1000 vertex graphs in about 1 second. The proposed algorithm embodies a new multiscale scheme for drawing graphs, which was motivated by the earlier multiscale algorithm of Hadany and Harel [HH99]. In principle, it could significantly improve the speed of essentially any forcedirected method (regardless of that method's ability of drawing weighted graphs or the continuity of its costfunction).
ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
, 2002
"... We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE finds an optimal drawing by minimizing a quadratic energy function due to Hall, using a novel algebraic multigrid technique. The algorithm exhibits ..."
Abstract

Cited by 62 (13 self)
 Add to MetaCart
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE finds an optimal drawing by minimizing a quadratic energy function due to Hall, using a novel algebraic multigrid technique. The algorithm exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of a million nodes in less than a minute. Moreover, the algorithm can deal with more general entities, such as graphs with masses and negative weights (to be defined in the text), and it appears to be applicable outside of graph drawing too.
Network Visualization by Semantic Substrates
 IEEE Transactions on Visualization and Computer Graphics
"... Abstract—Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on userdefined semantic substr ..."
Abstract

Cited by 62 (8 self)
 Add to MetaCart
Abstract—Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on userdefined semantic substrates, which are nonoverlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations. Index Terms — Network visualization, semantic substrate, information visualization, graphical user interfaces. 1
Graph Drawing by HighDimensional Embedding
 In GD02, LNCS
, 2002
"... We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2D plane using PCA. Experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seco ..."
Abstract

Cited by 59 (10 self)
 Add to MetaCart
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2D plane using PCA. Experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.
An Experimental Comparison of Four Graph Drawing Algorithms
, 1995
"... In this paper we present an extensive experimental study comparing four generalpurpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in so ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
In this paper we present an extensive experimental study comparing four generalpurpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database visualization applications. The test data (available by anonymous ftp) are 11,582 graphs, ranging from 10 to 100 vertices, which have been generated from a core set of 112 graphs used in "reallife" software engineering and database applications. The experiments
A Bayesian Paradigm for Dynamic Graph Layout
, 1997
"... Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. ..."
Abstract

Cited by 52 (13 self)
 Add to MetaCart
Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e.