A Multidimensional Approach to ForceDirected Layouts of Large GraphsGajer, Pawel and Goodrich, Michael T. and Kobourov, Stephen G. (2001) A Multidimensional Approach to ForceDirected Layouts of Large Graphs. In: Graph Drawing, 2000 , pp. 211221(Official URL: http://dx.doi.org/10.1007/3540445412_20). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540445412_20
AbstractWe present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space \mathbb{E} of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensional subspace of \mathbb{E}. Projecting highdimensional 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 midrange PC. Actions (login required)
