## A Fast Multi-Dimensional Algorithm for Drawing Large Graphs (2000)

### Cached

### Download Links

Venue: | In Graph Drawing’00 Conference Proceedings |

Citations: | 28 - 4 self |

### BibTeX

@INPROCEEDINGS{Gajer00afast,

author = {Pawel Gajer and Michael T. Goodrich and Stephen G. Kobourov},

title = {A Fast Multi-Dimensional Algorithm for Drawing Large Graphs},

booktitle = {In Graph Drawing’00 Conference Proceedings},

year = {2000},

pages = {211--221}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. Projecting high-dimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, e#cient memory management, and an intelligent initial placement of vertices. 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 mid-range PC. 1 Introduction Graphs are common in many applications, from data structures to networks, from software engineering...