A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration)

Frick, Arne and Ludwig, Andreas and Mehldau, Heiko (1995) A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 388-403(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_393).

Full text not available from this repository.

Abstract

We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the spring-embedding paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscillations. The proposed algorithm achieves drawings of high quality on a wide range of graphs with standard settings. Moreover, the algorithm is fast, being thus applicable on general undirected graphs of substantially larger size and complexity than before [9,6,3]. Aesthetically pleasing solutions are found in most cases. We give empirical data for the running time of the algorithm and the quality of the computed layouts.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_393
Classifications: G Algorithms and Complexity > G.999 Others
M Methods > M.400 Force-directed / Energy-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/239

Actions (login required)

View Item View Item