A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
What makes a Tree a Straight Skeleton?
2012
Canadian Conference on Computational Geometry
Let G be a cycle-free connected straight-line graph with predefined edge lengths and fixed order of incident edges around each vertex. We address the problem of deciding whether there exists a simple polygon P such that G is the straight skeleton of P . We show that for given G such a polygon P might not exist, and if it exists it might not be unique. For the later case we give an example with exponentially many suitable polygons. For small star graphs and caterpillars we show necessary and
dblp:conf/cccg/AichholzerCDHHLR12
fatcat:rk6cwoczc5dwlcey2qkfu6xbfe