International Symposium on Graph Drawing

GD 1996: Graph Drawing pp 113-128

Straight-line drawing algorithms for hierarchical graphs and clustered graphs

  • Peter Eades
  • Qing-Wen Feng
  • Xuemin Lin
Conference paper

DOI: 10.1007/3-540-62495-3_42

Volume 1190 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Eades P., Feng QW., Lin X. (1997) Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North S. (eds) Graph Drawing. GD 1996. Lecture Notes in Computer Science, vol 1190. Springer, Berlin, Heidelberg

Abstract

Hierarchical graphs and clustered graphs are useful nonclassical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization, VLSI design, etc. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of straight-line representation has not been addressed. In this paper, we answer the question: does every planar hierarchical graph admit a planar straight-line hierarchical drawing? We present an algorithm that constructs such drawings in O(n2) time. Also, we answer a basic question for clustered graphs, i.e. does every planar clustered graph admit a planar straight-line drawing with clusters drawn as convex polygons? A method for such drawings is provided in this paper.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Eades
    • 1
  • Qing-Wen Feng
    • 1
  • Xuemin Lin
    • 2
  1. 1.Department of Computer Science and Software EngineeringUniversity of NewcastleAustralia
  2. 2.Department of Computer ScienceUniversity of Western AustraliaNedlandsAustralia