## Area Requirement for Drawing Hierarchically Planar Graphs (1997)

Citations: | 3 - 1 self |

### BibTeX

@TECHREPORT{Lin97arearequirement,

author = {Xuemin Lin and Peter Eades},

title = {Area Requirement for Drawing Hierarchically Planar Graphs},

institution = {},

year = {1997}

}

### OpenURL

### Abstract

Abstract. In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex is represented by a point and 2) grid visibifity representation (that is, a line segment is allowed to represent a vertex). For the first drawing standard, we show an exponential area lower bound needed for drawing hierarchically planar graphs. The lower bound holds even for hierarchical graphs without transitive arcs, in contrast to the results for upward planar drawing. Applications of some existing algorithms from upward drawing can guarantee the quadratic drawing area for grid visibility representation but do not necessarily guarantee the minimum drawing area. Motivated by this, we will present another grid visibifity drawing algoiithm which is efficient and guarantees the minimum drawing area.

### Citations

11561 |
Computers and Intractability - A Guide to the Theory of NP-Completness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ... MAGVD (DPMAGVD) INSTANCE: An s-t hierarchically planar graph H, and an integer K. QUESTION: Is there a grid visibility representation of H such that its width is not greater than K? It is well known =-=[10]-=- that the 3-PARTITION problem is NP-complete. In our proof, we will transform 3-PARTITION to a special case of DPMAGVD. 3-PARTITION INSTANCE: Asnite set S of 3n elements, an integer B, and an integer ... |

364 |
Methods for Visual Understanding of Hierarchical Systems Structures
- Sugiyama, Tagawa, et al.
- 1989
(Show Context)
Citation Context ...ly NP-hard, even restricted to s-t graphs. Keywords: Graph Drawing, Hierarchically Planar Graph, Straight Line Drawing, Visibility Representation, Drawing Area. 1 Introduction Automatic graph drawing =-=[2, 5, 13, 14, 15, 16, 17, 18]-=- plays an important role in many computerbased applications such as CASE tools, software and information visualization, VLSI design, visual data mining, and internet navigation. Directed acyclic graph... |

138 |
On embedding a graph in the grid with the minimum number of bends
- Tamassia
- 1987
(Show Context)
Citation Context ...ly NP-hard, even restricted to s-t graphs. Keywords: Graph Drawing, Hierarchically Planar Graph, Straight Line Drawing, Visibility Representation, Drawing Area. 1 Introduction Automatic graph drawing =-=[2, 5, 13, 14, 15, 16, 17, 18]-=- plays an important role in many computerbased applications such as CASE tools, software and information visualization, VLSI design, visual data mining, and internet navigation. Directed acyclic graph... |

81 | Incremental Planarity Testing - Battista, Tamassia - 1989 |

61 | Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Eades, Feng, et al.
(Show Context)
Citation Context ...on for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published [2, 4, 6, 11]. 1 Consider =-=[7, 8, 9, 19] that-=- directed graphs are not powerful enough to model every real-life application. \Hierarchical" graphs are then introduced, where layering information is added to a directed acyclic graph. Conseque... |

60 |
Algorithms for plane representations of acyclic digraphs
- DiBattista, Tamassia
- 1988
(Show Context)
Citation Context ...he upward drawing convention for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published =-=[2, 4, 6, 11]. 1 C-=-onsider [7, 8, 9, 19] that directed graphs are not powerful enough to model every real-life application. \Hierarchical" graphs are then introduced, where layering information is added to a direct... |

45 |
Area requirement and symmetry display of planar upward drawings
- Battista, Tamassia, et al.
- 1992
(Show Context)
Citation Context ...ools, software and information visualization, and VLSI design. The upward drawing convention for drawing acyclic directed graphs has received a great deal of attention since last decade. Many results =-=[2, 4, 6, 9, 11]-=- for drawing upward planar graphs have been published. However, acyclic directed graphs are not powerful enough to model all applications. Hierarchical graphs are then introduced, where layering infor... |

31 |
Algorithms for automatic graph drawing: An annotated bibliography
- Eades, Tamassia
- 1989
(Show Context)
Citation Context ...ly NP-hard, even restricted to s-t graphs. Keywords: Graph Drawing, Hierarchically Planar Graph, Straight Line Drawing, Visibility Representation, Drawing Area. 1 Introduction Automatic graph drawing =-=[2, 5, 13, 14, 15, 16, 17, 18]-=- plays an important role in many computerbased applications such as CASE tools, software and information visualization, VLSI design, visual data mining, and internet navigation. Directed acyclic graph... |

25 |
Hierarchies and planarity theory
- Battista, Nardelli
- 1988
(Show Context)
Citation Context ...ierarchical drawing are inherently dierent to those in upward drawing. For example, testing for \upward planarity" of directed acyclic graphs is NP-Complete [11], while it can be done in linear t=-=ime [3, 12] for \hierarchical planar-=-ity". Therefore, issues, such as, \planar", \straight-line", \convex", and \symmetric" representations have been independently investigated [7, 8, 12] with respect to \hierarc... |

25 | Algorithms for drawing clustered graphs
- Feng
- 1997
(Show Context)
Citation Context ...on for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published [2, 4, 6, 11]. 1 Consider =-=[7, 8, 9, 19] that-=- directed graphs are not powerful enough to model every real-life application. \Hierarchical" graphs are then introduced, where layering information is added to a directed acyclic graph. Conseque... |

20 |
Graph drawing by the magnetic spring model
- Sugiyama, Misue
- 1995
(Show Context)
Citation Context |

19 |
An approximation algorithm for the twolayered graph drawing problem
- Yamaguchi, Sugimoto
- 1999
(Show Context)
Citation Context ...on for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published [2, 4, 6, 11]. 1 Consider =-=[7, 8, 9, 19] that-=- directed graphs are not powerful enough to model every real-life application. \Hierarchical" graphs are then introduced, where layering information is added to a directed acyclic graph. Conseque... |

18 | An Algorithm for Drawing a Hierarchical Graph
- Eades, Lin, et al.
- 1994
(Show Context)
Citation Context |

17 |
Analysis of Algorithms for Drawing Graphs
- Lin
- 1992
(Show Context)
Citation Context |

5 |
U.S.R.Murty, Graph Theory with Applications, The Macmilan
- Bondy
- 1976
(Show Context)
Citation Context ...hesrst contribution. Section 4 presents the second and the third contributions. This is followed by the conclusions and remarks. 2 2 Preliminaries The basic graph theoretic denitions can be found in [=-=-=-1]. A hierarchical graph H = (V; A; ; k) consists of a simple and directed acyclic graph (V; A), a positive integer k, and for each vertex u, an integer (u) 2 f1; 2; :::; kg with the property that if ... |

2 |
On the Computational Complexity of Upward and
- Garg, Tamassia
- 1995
(Show Context)
Citation Context ...he upward drawing convention for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published =-=[2, 4, 6, 11]. 1 C-=-onsider [7, 8, 9, 19] that directed graphs are not powerful enough to model every real-life application. \Hierarchical" graphs are then introduced, where layering information is added to a direct... |

1 |
Pitfalls of using PQ-trees
- Juenger, Leipert, et al.
- 1998
(Show Context)
Citation Context |