A treemap based method for rapid layout of large graphs

Chris Muelder, Kwan-Liu Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

Abstract graphs or networks are a commonly recurring data type in many fields. In order to visualize such graphs effectively, the graph must be laid out on the screen coherently. Many algorithms exist to do this, but many of these algorithms tend to be very slow when the input graph is large. This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying a treemap to this hierarchy, and finally placing the graph vertices in their associated regions in the treemap. It is ideal for interactive systems where operations such as semantic zooming are to be performed, since most of the work is done in the initial hierarchy calculation, and it takes very little work to recalculate the layout. This method is also valuable in that the resulting layout can be used as the input to an iterative algorithm (e.g., a force directed method), which greatly reduces the number of iterations required to converge to a near optimal layout.

Original languageEnglish (US)
Title of host publicationIEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings
Pages231-238
Number of pages8
DOIs
StatePublished - Aug 25 2008
Event2008 Pacific Visualization Symposium, PacificVis 2008 - Kyoto, Japan
Duration: Mar 4 2008Mar 7 2008

Other

Other2008 Pacific Visualization Symposium, PacificVis 2008
CountryJapan
CityKyoto
Period3/4/083/7/08

Fingerprint

Semantics

Keywords

  • I.3.6 [computing methodologies]: computer graphics - methodologies and techniques

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Muelder, C., & Ma, K-L. (2008). A treemap based method for rapid layout of large graphs. In IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings (pp. 231-238). [4475481] https://doi.org/10.1109/PACIFICVIS.2008.4475481

A treemap based method for rapid layout of large graphs. / Muelder, Chris; Ma, Kwan-Liu.

IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings. 2008. p. 231-238 4475481.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Muelder, C & Ma, K-L 2008, A treemap based method for rapid layout of large graphs. in IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings., 4475481, pp. 231-238, 2008 Pacific Visualization Symposium, PacificVis 2008, Kyoto, Japan, 3/4/08. https://doi.org/10.1109/PACIFICVIS.2008.4475481
Muelder C, Ma K-L. A treemap based method for rapid layout of large graphs. In IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings. 2008. p. 231-238. 4475481 https://doi.org/10.1109/PACIFICVIS.2008.4475481
Muelder, Chris ; Ma, Kwan-Liu. / A treemap based method for rapid layout of large graphs. IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings. 2008. pp. 231-238
@inproceedings{229be0f26e3b4d08803a794f89521325,
title = "A treemap based method for rapid layout of large graphs",
abstract = "Abstract graphs or networks are a commonly recurring data type in many fields. In order to visualize such graphs effectively, the graph must be laid out on the screen coherently. Many algorithms exist to do this, but many of these algorithms tend to be very slow when the input graph is large. This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying a treemap to this hierarchy, and finally placing the graph vertices in their associated regions in the treemap. It is ideal for interactive systems where operations such as semantic zooming are to be performed, since most of the work is done in the initial hierarchy calculation, and it takes very little work to recalculate the layout. This method is also valuable in that the resulting layout can be used as the input to an iterative algorithm (e.g., a force directed method), which greatly reduces the number of iterations required to converge to a near optimal layout.",
keywords = "I.3.6 [computing methodologies]: computer graphics - methodologies and techniques",
author = "Chris Muelder and Kwan-Liu Ma",
year = "2008",
month = "8",
day = "25",
doi = "10.1109/PACIFICVIS.2008.4475481",
language = "English (US)",
isbn = "9781424419661",
pages = "231--238",
booktitle = "IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings",

}

TY - GEN

T1 - A treemap based method for rapid layout of large graphs

AU - Muelder, Chris

AU - Ma, Kwan-Liu

PY - 2008/8/25

Y1 - 2008/8/25

N2 - Abstract graphs or networks are a commonly recurring data type in many fields. In order to visualize such graphs effectively, the graph must be laid out on the screen coherently. Many algorithms exist to do this, but many of these algorithms tend to be very slow when the input graph is large. This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying a treemap to this hierarchy, and finally placing the graph vertices in their associated regions in the treemap. It is ideal for interactive systems where operations such as semantic zooming are to be performed, since most of the work is done in the initial hierarchy calculation, and it takes very little work to recalculate the layout. This method is also valuable in that the resulting layout can be used as the input to an iterative algorithm (e.g., a force directed method), which greatly reduces the number of iterations required to converge to a near optimal layout.

AB - Abstract graphs or networks are a commonly recurring data type in many fields. In order to visualize such graphs effectively, the graph must be laid out on the screen coherently. Many algorithms exist to do this, but many of these algorithms tend to be very slow when the input graph is large. This paper presents a new approach to the large graph layout problem, which quickly generates an effective layout. This new method proceeds by generating a clustering hierarchy for the graph, applying a treemap to this hierarchy, and finally placing the graph vertices in their associated regions in the treemap. It is ideal for interactive systems where operations such as semantic zooming are to be performed, since most of the work is done in the initial hierarchy calculation, and it takes very little work to recalculate the layout. This method is also valuable in that the resulting layout can be used as the input to an iterative algorithm (e.g., a force directed method), which greatly reduces the number of iterations required to converge to a near optimal layout.

KW - I.3.6 [computing methodologies]: computer graphics - methodologies and techniques

UR - http://www.scopus.com/inward/record.url?scp=49749122197&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49749122197&partnerID=8YFLogxK

U2 - 10.1109/PACIFICVIS.2008.4475481

DO - 10.1109/PACIFICVIS.2008.4475481

M3 - Conference contribution

AN - SCOPUS:49749122197

SN - 9781424419661

SP - 231

EP - 238

BT - IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings

ER -