Abstract
The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed.
Cite
CITATION STYLE
Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P., & Vogtenhuber, B. (2015). Representing directed trees as straight skeletons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 335–347). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
