Pointed drawings of planar graphs |
| |
Authors: | Oswin Aichholzer Günter Rote André Schulz Birgit Vogtenhuber |
| |
Affiliation: | 1. Institute for Software Technology, Graz University of Technology, Austria;2. Institut für Informatik, Freie Universität Berlin, Germany;3. Institut für Mathematsche Logik und Grundlagenforschung, Universität Münster, Germany |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|