A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs


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… (More)
DOI: 10.1007/3-540-44541-2_20


7 Figures and Tables


Citations per Year

151 Citations

Semantic Scholar estimates that this publication has 151 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics