A Framework for Drawing Planar Graphs with Curves and Polylines

We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties of such drawings, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature, as well...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of algorithms Ročník 37; číslo 2; s. 399 - 421
Hlavní autoři: Goodrich, Michael T., Wagner, Christopher G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: San Diego, CA Elsevier Inc 01.11.2000
Elsevier
Témata:
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Graph construction
Planar graph
Worst case method
Asymptotic behavior
Curve
Asymptotic optimality
Graph theory
Aspect ratio
Algorithm
Complexity
Bézier curve
Optimal solution
Aesthetics
ISSN:0196-6774, 1090-2678
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties of such drawings, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature, as well as complexity measures such as vertex and edge representational complexity and the area of the drawing. In addition to this general framework, we present algorithms that operate within this framework. Specifically, we describe an algorithm for drawing any n-vertex planar graph in an O(n)×O(n) grid using polylines that have at most two bends per edge and asymptotically-optimal worst-case angular resolution. More significantly, we show how to adapt this algorithm to draw any n-vertex planar graph using cubic Bézier curves, with all vertices and control points placed within an O(n)×O(n) integer grid so that the curved edges achieve a curvilinear analogue of good angular resolution. All of our algorithms run in O(n) time.
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.2000.1115