### Abstract

We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G=(V,E), the algorithm produces an embedding for G 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. Such projections typically result in drawings that are "smoother" and more symmetric than direct drawings in 2D and 3D. In order to obtain fast placement of the vertices of the graph our algorithm employs a multi-scale technique based on a maximal independent set filtration of vertices of the graph. While most existing force-directed algorithms begin with an initial random placement of all the vertices, our algorithm attempts to place vertices "intelligently", close to their final positions. Other notable features of our approach include a fast energy function minimization strategy and efficient memory management. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a 550 MHz Pentium PC.

Original language | English (US) |
---|---|

Pages (from-to) | 3-18 |

Number of pages | 16 |

Journal | Computational Geometry: Theory and Applications |

Volume | 29 |

Issue number | 1 |

DOIs | |

State | Published - Sep 2004 |

### Fingerprint

### Keywords

- Force-directed method
- High-dimensional embedding
- Large graph drawing
- Multi-scale method

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Computer Science Applications
- Computational Mathematics
- Control and Optimization
- Geometry and Topology

### Cite this

*Computational Geometry: Theory and Applications*,

*29*(1), 3-18. https://doi.org/10.1016/j.comgeo.2004.03.014

**A multi-dimensional approach to force-directed layouts of large graphs.** / Gajer, Pawel; Goodrich, Michael T.; Kobourov, Stephen G.

Research output: Contribution to journal › Article

*Computational Geometry: Theory and Applications*, vol. 29, no. 1, pp. 3-18. https://doi.org/10.1016/j.comgeo.2004.03.014

}

TY - JOUR

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

AU - Gajer, Pawel

AU - Goodrich, Michael T.

AU - Kobourov, Stephen G

PY - 2004/9

Y1 - 2004/9

N2 - We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G=(V,E), the algorithm produces an embedding for G 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. Such projections typically result in drawings that are "smoother" and more symmetric than direct drawings in 2D and 3D. In order to obtain fast placement of the vertices of the graph our algorithm employs a multi-scale technique based on a maximal independent set filtration of vertices of the graph. While most existing force-directed algorithms begin with an initial random placement of all the vertices, our algorithm attempts to place vertices "intelligently", close to their final positions. Other notable features of our approach include a fast energy function minimization strategy and efficient memory management. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a 550 MHz Pentium PC.

AB - We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G=(V,E), the algorithm produces an embedding for G 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. Such projections typically result in drawings that are "smoother" and more symmetric than direct drawings in 2D and 3D. In order to obtain fast placement of the vertices of the graph our algorithm employs a multi-scale technique based on a maximal independent set filtration of vertices of the graph. While most existing force-directed algorithms begin with an initial random placement of all the vertices, our algorithm attempts to place vertices "intelligently", close to their final positions. Other notable features of our approach include a fast energy function minimization strategy and efficient memory management. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a 550 MHz Pentium PC.

KW - Force-directed method

KW - High-dimensional embedding

KW - Large graph drawing

KW - Multi-scale method

UR - http://www.scopus.com/inward/record.url?scp=3242722008&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3242722008&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2004.03.014

DO - 10.1016/j.comgeo.2004.03.014

M3 - Article

AN - SCOPUS:3242722008

VL - 29

SP - 3

EP - 18

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 1

ER -