Rapid graph layout using space filling curves

Chris Muelder, Kwan-Liu Ma

Research output: Contribution to journalArticlepeer-review

40 Scopus citations

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.

Original languageEnglish (US)
Article number4658143
Pages (from-to)1301-1308
Number of pages8
JournalIEEE Transactions on Visualization and Computer Graphics
Volume14
Issue number6
DOIs
StatePublished - Nov 1 2008

Keywords

  • Graph layout
  • Information visualization
  • Space filling curves

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Rapid graph layout using space filling curves'. Together they form a unique fingerprint.

Cite this