{"month":"11","publication_status":"published","oa_version":"Preprint","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-27260-3"],"eisbn":["978-3-319-27261-0"]},"volume":9411,"year":"2015","date_updated":"2022-01-28T09:10:37Z","date_created":"2018-12-11T11:52:54Z","conference":{"end_date":"2015-09-26","location":"Los Angeles, CA, United States","start_date":"2015-09-24","name":"GD: International Symposium on Graph Drawing"},"department":[{"_id":"HeEd"}],"publication":"Graph Drawing and Network Visualization","author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"first_name":"Thomas","last_name":"Hackl","full_name":"Hackl, Thomas"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"first_name":"Stefan","full_name":"Huber, Stefan","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"page":"335 - 347","_id":"1590","status":"public","alternative_title":["LNCS"],"article_processing_charge":"No","citation":{"apa":"Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P., &#38; Vogtenhuber, B. (2015). Representing directed trees as straight skeletons. In <i>Graph Drawing and Network Visualization</i> (Vol. 9411, pp. 335–347). Los Angeles, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>","ieee":"O. Aichholzer <i>et al.</i>, “Representing directed trees as straight skeletons,” in <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–347.","ama":"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>","chicago":"Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight Skeletons.” In <i>Graph Drawing and Network Visualization</i>, 9411:335–47. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>.","short":"O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.","mla":"Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.” <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">10.1007/978-3-319-27261-0_28</a>.","ista":"Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 335–347."},"doi":"10.1007/978-3-319-27261-0_28","date_published":"2015-11-27T00:00:00Z","quality_controlled":"1","publist_id":"5581","title":"Representing directed trees as straight skeletons","oa":1,"intvolume":"      9411","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"book_chapter","publisher":"Springer Nature","main_file_link":[{"url":"http://arxiv.org/abs/1508.01076","open_access":"1"}],"day":"27","abstract":[{"lang":"eng","text":"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."}]}