Representing directed trees as straight skeletons LNCS Aichholzer, Oswin Biedl, Therese Hackl, Thomas Held, Martin Huber, Stefan ; https://orcid.org/0000-0002-8871-5814 Palfrader, Peter Vogtenhuber, Birgit 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. Springer Nature 2015 info:eu-repo/semantics/bookPart doc-type:bookPart text http://purl.org/coar/resource_type/c_3248 https://research-explorer.ista.ac.at/record/1590 Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight skeletons. In: <i>Graph Drawing and Network Visualization</i>. Vol 9411. Springer Nature; 2015:335-347. doi:<a href="https://doi.org/10.1007/978-3-319-27261-0_28">10.1007/978-3-319-27261-0_28</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-27261-0_28 info:eu-repo/semantics/altIdentifier/isbn/978-3-319-27260-3 info:eu-repo/semantics/altIdentifier/e-isbn/978-3-319-27261-0 info:eu-repo/semantics/altIdentifier/wos/000373628600028 info:eu-repo/semantics/altIdentifier/arxiv/1508.01076 info:eu-repo/semantics/openAccess