Sciweavers

CCCG
2007

Pointed Drawings of Planar Graphs

14 years 28 days ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic B´ezier curves (parabolic arcs), even if the positions of the vertices are predefined by a given plane straight-line embedding of the graph. Moreover, the graph can be embedded with circular arcs if the vertices can be placed arbitrarily. The topic is related to non-crossing drawings of multigraphs and vertex labeling.
Oswin Aichholzer, Günter Rote, André S
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where CCCG
Authors Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
Comments (0)