Planarity-preserving clustering and embedding for large planar graphs

Christian A. Duncan, Michael T. Goodrich, Stephen G Kobourov

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(nlogn), where n is the number of vertices of graph G.

Original languageEnglish (US)
Pages (from-to)95-114
Number of pages20
JournalComputational Geometry: Theory and Applications
Volume24
Issue number2
DOIs
StatePublished - Feb 2003

Fingerprint

Drawing (graphics)
Planarity
Planar graph
Clustering
Graph in graph theory
Arbitrary

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Computational Mathematics
  • Control and Optimization
  • Geometry and Topology

Cite this

Planarity-preserving clustering and embedding for large planar graphs. / Duncan, Christian A.; Goodrich, Michael T.; Kobourov, Stephen G.

In: Computational Geometry: Theory and Applications, Vol. 24, No. 2, 02.2003, p. 95-114.

Research output: Contribution to journalArticle

@article{d28c2090836b4d0d9717646ebaac7fe0,
title = "Planarity-preserving clustering and embedding for large planar graphs",
abstract = "In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(nlogn), where n is the number of vertices of graph G.",
author = "Duncan, {Christian A.} and Goodrich, {Michael T.} and Kobourov, {Stephen G}",
year = "2003",
month = "2",
doi = "10.1016/S0925-7721(02)00094-9",
language = "English (US)",
volume = "24",
pages = "95--114",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Planarity-preserving clustering and embedding for large planar graphs

AU - Duncan, Christian A.

AU - Goodrich, Michael T.

AU - Kobourov, Stephen G

PY - 2003/2

Y1 - 2003/2

N2 - In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(nlogn), where n is the number of vertices of graph G.

AB - In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(nlogn), where n is the number of vertices of graph G.

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

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

U2 - 10.1016/S0925-7721(02)00094-9

DO - 10.1016/S0925-7721(02)00094-9

M3 - Article

AN - SCOPUS:84867962052

VL - 24

SP - 95

EP - 114

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 2

ER -