Towards area requirements for drawing hierarchically planar graphs

  • Authors:

  • Xuemin Lin;Peter Eades

  • Affiliations:

  • School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW 2052, Australia;Basser Department of Computer Science, The University of Sydney, Sydney, NSW 2006, Australia

  • Venue:
  • Theoretical Computer Science - Algorithms,automata, complexity and games
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical graphs are an important class of graphs for modeling many real applications in software and information visualization. In this paper, we investigate area requirements for drawing hierarchically planar graphs regarding two different drawing standards. Firstly, we show an exponential lower bound for the area needed for straight-line drawing of hierarchically planar graphs. The lower bound holds even for s-t hierarchical graphs without transitive arcs, in contrast to the results for upward planar drawing. This motivates our investigation of another drawing standard grid visibility representation, as a relaxation of straight-line drawing. An application of the existing results from upward drawing can guarantee a quadric drawing area for grid visibility representation but does not necessarily guarantee the minimum drawing area. Motivated by this, we will present a new grid visibility drawing algorithm which is efficient and guarantees the minimum drawing area with respect to a given topological embedding. This implies that the area minimization problem is polynomial time solvable restricted to the class of graphs whose planar embeddings are unique. However, we can show that the problem of area minimization of grid visibility for hierarchically planar graphs is generally NP-hard, even restricted to s-t graphs.