Area requirement of visibility representations of trees

Area requirement of visibility representations of trees

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1997-04, Vol.62 (2), p.81-88
Hauptverfasser: Kant, Goos, Liotta, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Area requirement
Artificial intelligence
Computational geometry
Computer science
control theory
systems
Exact sciences and technology
Geometry
Graph drawing
Graphs
Information processing
Information retrieval. Graph
Mathematics
Pattern recognition. Digital image processing. Computational geometry
Studies
Theoretical computing
Trees
Visibility representation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(97)00048-3