Paper Info
Title
Representing Directed Trees as Straight Skeletons
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.
Year
DOI
Venue
2015
10.1007/978-3-319-27261-0_28
Graph Drawing
DocType
Volume
ISSN
Journal
abs/1508.01076
0302-9743
Citations 
PageRank 
References 
0
0.34
5
Authors
7
Name
Order
Citations
PageRank
Oswin Aichholzer185296.04
Therese Biedl2902106.36
Thomas Hackl313822.95
Martin Held41359.40
Stefan Huber5243.38
Peter Palfrader6175.57
Birgit Vogtenhuber712727.19