Filters

7,067 Hits in 9.6 sec

### A multi-dimensional approach to force-directed layouts of large graphs*1

P GAJER
2004 International Journal of Production Economics
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension.  ...  A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E.  ...  Force-directed methods are the methods of choice for drawing general graphs.  ...

### A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs [chapter]

Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
2001 Lecture Notes in Computer Science
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension.  ...  A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E.  ...  Force-directed methods are the methods of choice for drawing general graphs.  ...

### A multi-dimensional approach to force-directed layouts of large graphs

Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
2004 Computational geometry
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension.  ...  A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E.  ...  Force-directed methods are the methods of choice for drawing general graphs.  ...

### Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes [chapter]

Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi
2004 Lecture Notes in Computer Science
The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining  ...  In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set.  ...  We then apply the modified force-directed layout algorithm to obtain a drawing for G A . From this drawing we extract the drawings of each individual graph in the series.  ...

### Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes

Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi
2005 Journal of Graph Algorithms and Applications
The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining  ...  In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set.  ...  We then apply the modified force-directed layout algorithm to obtain a drawing for G A . From this drawing we extract the drawings of each individual graph in the series.  ...

### GRIP: Graph Drawing with Intelligent Placement

Pawel Gajer, Stephen G. Kobourov
2002 Journal of Graph Algorithms and Applications
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization.  ...  This paper describes a system for Graph dRawing with Intelligent Placement, GRIP.  ...  A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique.  ...

### GRIP: Graph dRawing with Intelligent Placement [chapter]

Pawel Gajer, Stephen G. Kobourov
2001 Lecture Notes in Computer Science
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization.  ...  This paper describes a system for Graph dRawing with Intelligent Placement, GRIP.  ...  A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique.  ...

### GRIP: Graph Drawing with Intelligent Placement [chapter]

Pawel Gajer, Stephen G. Kobourov
2004 Graph Algorithms and Applications 3
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization.  ...  This paper describes a system for Graph dRawing with Intelligent Placement, GRIP.  ...  A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique.  ...

### Page 768 of Mathematical Reviews Vol. , Issue 2004b [page]

2004 Mathematical Reviews
Moreover, it is shown how force- directed methods can be applied to visualize clusters. “Dynamic graph drawing is a very recent and relevant topic.  ...  “Handling large graphs is an important problem where some new methods are needed.  ...

### Spring Embedders and Force Directed Graph Drawing Algorithms [article]

Stephen G. Kobourov
2012 arXiv   pre-print
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs.  ...  In this survey we consider several classical algorithms, starting from Tutte's 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs.  ...  Conclusion Force directed algorithms for drawing graphs have a long history and new variants are still introduced every year.  ...

### A Multilevel Algorithm for Force-Directed Graph-Drawing

Chris Walshaw
2003 Journal of Graph Algorithms and Applications
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm.  ...  At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement.  ...  Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments.  ...

### A Multilevel Algorithm for Force-Directed Graph-Drawing [chapter]

Chris Walshaw
2006 Graph Algorithms and Applications 4
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm.  ...  At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement.  ...  Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments.  ...

### A Multilevel Algorithm for Force-Directed Graph Drawing [chapter]

C. Walshaw
2001 Lecture Notes in Computer Science
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm.  ...  At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement.  ...  Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments.  ...

### Graphael: A System for Generalized Force-Directed Layouts [chapter]

David Forrester, Stephen G. Kobourov, Armand Navabi, Kevin Wampler, Gary V. Yee
2005 Lecture Notes in Computer Science
The system can handle large graphs, using multi-scale variations of the force-directed methods.  ...  The graphael system implements several classic force-directed layout methods, as well as several novel layout methods for non-Euclidean geometries, including hyperbolic and spherical.  ...  also generalize the multi-scale method for drawing large graphs to non-Euclidean spaces.  ...

### A generic algorithm for layout of biological networks

Falk Schreiber, Tim Dwyer, Kim Marriott, Michael Wybrow
2009 BMC Bioinformatics
Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks.  ...  Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration.  ...  The basic approach in constrained graph layout (like force-directed layout) for finding aesthetically pleasing drawings of graphs is to define a cost function F(P) over the positions of the nodes P and  ...
« Previous Showing results 1 — 15 out of 7,067 results