Sciweavers

TVCG
2008

Rapid Graph Layout Using Space Filling Curves

14 years 14 days ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link diagram to be effective, the nodes must be arranged well on the screen. While many graph layout algorithms exist for this purpose, they often have limitations such as high computational complexity or node colocation. This paper proposes a new approach to graph layout through the use of space filling curves which is very fast and guarantees that there will be no nodes that are colocated. The resulting layout is also aesthetic and satisfies several criteria for graph layout effectiveness.
Chris Muelder, Kwan-Liu Ma
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2008
Where TVCG
Authors Chris Muelder, Kwan-Liu Ma
Comments (0)