{"department":[{"_id":"HeEd"}],"day":"01","publisher":"TU Braunschweig","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","date_published":"2013-03-01T00:00:00Z","citation":{"chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In <i>29th European Workshop on Computational Geometry</i>, 95–98. TU Braunschweig, 2013.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In <i>29th European Workshop on Computational Geometry</i> (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” <i>29th European Workshop on Computational Geometry</i>, TU Braunschweig, 2013, pp. 95–98.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in <i>29th European Workshop on Computational Geometry</i>, Braunschweig, Germany, 2013, pp. 95–98.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: <i>29th European Workshop on Computational Geometry</i>. TU Braunschweig; 2013:95-98."},"main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}],"title":"Reconstructing polygons from embedded straight skeletons","language":[{"iso":"eng"}],"publication":"29th European Workshop on Computational Geometry","publication_status":"published","type":"conference","page":"95 - 98","_id":"2210","oa":1,"abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.","lang":"eng"}],"publist_id":"4762","date_updated":"2021-01-12T06:56:00Z","oa_version":"Submitted Version","conference":{"start_date":"2013-03-17","location":"Braunschweig, Germany","end_date":"2013-03-20","name":"EuroCG: European Workshop on Computational Geometry"},"author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"last_name":"Held","first_name":"Martin","full_name":"Held, Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","full_name":"Huber, Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814","first_name":"Stefan"}],"status":"public","date_created":"2018-12-11T11:56:21Z"}