---
res:
bibo_abstract:
- '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.@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: Therese
foaf_name: Biedl, Therese
foaf_surname: Biedl
- foaf_Person:
foaf_givenName: Martin
foaf_name: Held, Martin
foaf_surname: Held
- foaf_Person:
foaf_givenName: Stefan
foaf_name: Huber, Stefan
foaf_surname: Huber
foaf_workInfoHomepage: http://www.librecat.org/personId=4700A070-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-8871-5814
dct_date: 2013^xs_gYear
dct_language: eng
dct_publisher: TU Braunschweig@
dct_title: Reconstructing polygons from embedded straight skeletons@
...