Optimal Area Algorithm for Planar Polyline Drawings

Authors:
Nicolas Bonichon;Bertrand Le Saëc;Mohamed Mosbah
Affiliations:
-;-;-
Venue:
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2002

Citing 5
Cited 3

Automatic graph drawing and readability of diagrams

IEEE Transactions on Systems, Man and Cybernetics
Algorithms for plane representations of acyclic digraphs

Theoretical Computer Science
Constrained visibility representations of graphs

Information Processing Letters
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Wagner's Theorem on Realizers

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Watermelon uniform random generation with applications

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
On planar polyline drawings

GD'07 Proceedings of the 15th international conference on Graph drawing
Planar graphs, via well-orderly maps and trees

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a linear time algorithm based on Schnyder trees that produces planar polyline drawings. These drawings have the optimal area (4(n-1)2/9) and width ([2(n-1/3]), and have at most n-2 bends, where n is the number of vertices of the graph. Moreover, at most one bend per edge is needed.