Lower bounds for planar orthogonal drawings of graphs

Lower bounds for planar orthogonal drawings of graphs

We study planar orthogonal drawings of graphs and provide lower bounds on the number of bends along the edges. We exhibit graphs on n vertices that require Ω( n) bends in any layout, and show that there exist optimal drawings that require Ω( n) bends and have all of them on a single edge of length Ω...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1991-07, Vol.39 (1), p.35-40
Hauptverfasser: Tamassia, Roberto, Tollis, Ioannis G., Vitter, Jeffrey Scott
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Artificial intelligence
bends
Computational geometry
Computer programming
Computer science
Computer science
control theory
systems
Exact sciences and technology
Functions
Graphs
Mathematical models
orthogonal drawing
Pattern recognition. Digital image processing. Computational geometry
planar embedding
Studies
Theory
VLSI layout
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study planar orthogonal drawings of graphs and provide lower bounds on the number of bends along the edges. We exhibit graphs on n vertices that require Ω( n) bends in any layout, and show that there exist optimal drawings that require Ω( n) bends and have all of them on a single edge of length Ω( n 2). This work finds applications in VLSI layout, aesthetic graph drawing, and communication by light or microwave.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(91)90059-Q