Area Requirement of Visibility Representations of Trees (1996)
by
G. Kant
,
G. Liotta
,
R. Tamassia
,
I. G. Tollis
| Citations: | 10 - 7 self |
BibTeX
@MISC{Kant96arearequirement,
author = {G. Kant and G. Liotta and R. Tamassia and I. G. Tollis},
title = {Area Requirement of Visibility Representations of Trees},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the area requirement of bar-visibility and rectangle-visibility representations of trees in the plane. We prove asymptotically tight lower and upper bounds on the area of such representations, and give linear-time algorithms that construct representations with asymptotically optimal area.
Citations
| 340 | Gallery Theorems and Algorithms - O’Rourke - 1987 |
| 221 | Algorithms for drawing graphs: An annotated bibliography - Eades, Tamassia - 1988 |
| 83 | An output sensitive algorithm for computing visibility graphs - GHOSH, MOUNT - 1987 |
| 72 | A unified approach to visibility representations of planar graphs - Tamassia, Tollis - 1986 |
| 53 | Rectilinear planar layouts and bipolar orientations of planar graphs - Rosenstiehl, Tarjan - 1986 |
| 44 | Area requirement and symmetry display of planar upward drawings - Battista, Tamassia, et al. - 1992 |
| 32 | Characterizing bar line-of-sight graphs - Wismath - 1985 |
| 20 | Area-Efficient Upward Tree Drawings - Garg, Goodrich, et al. - 1992 |
| 19 | Can visibility graphs be represented compactly? Discrete Comput - Agarwal, Alon, et al. - 1994 |
| 18 | Rectangle-visibility representations of bipartite graphs - Dean, Hutchinson - 1995 |
| 6 | Some results on visibility graphs - Andreae - 1992 |
| 3 | Bar-Representable Visibility Graphs and Related Flow Problems - Wismath - 1989 |
