title: Pointed drawings of planar graphs.
abstract: We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater thanπ. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given plane straight-line drawing of the graph. Moreover, the graph can be drawn with circular arcs if the vertices can be placed arbitrarily. The topic is related to non-crossing drawings of multigraphs and vertex labeling.
authors.affiliation: Institute for Software Technology, Graz University of Technology, Austria.
authors.forename: Oswin
authors.initials: O
authors.lastname: Aichholzer
authors.forename: Günter
authors.initials: G
authors.lastname: Rote
authors.forename: André
authors.initials: A
authors.lastname: Schulz
authors.forename: Birgit
authors.initials: B
authors.lastname: Vogtenhuber
keywords: Angular resolution; Planar drawings; Pointed pseudotriangulations