TY - GEN
T1 - A multi-dimensional approach to force-directed layouts of large graphs
AU - Gajer, Pawel
AU - Goodrich, Michael T.
AU - Kobourov, Stephen G.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - 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, efficient 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.
AB - 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, efficient 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.
UR - http://www.scopus.com/inward/record.url?scp=84958536778&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958536778&partnerID=8YFLogxK
U2 - 10.1007/3-540-44541-2_20
DO - 10.1007/3-540-44541-2_20
M3 - Conference contribution
AN - SCOPUS:84958536778
SN - 3540415548
SN - 9783540415541
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 211
EP - 221
BT - Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings
A2 - Marks, Joe
PB - Springer-Verlag
T2 - 8th International Symposium on Graph Drawing, GD 2000
Y2 - 20 September 2000 through 23 September 2000
ER -