Skeletal configurations of ribbon trees.
Lists
Only you see this
Abstract
The straight skeleton construction creates a straight-line tree from a polygon. Motivated by moduli spaces from algebraic geometry, we consider the inverse problem of constructing a polygon whose straight skeleton is a given tree. We prove there exists only a finite set of planar embeddings of a tree appearing as straight skeletons of convex polygons. The heavy lifting of this result is performed by using an analogous version of Cauchy’s arm lemma. Computational issues are also considered, uncovering ties to a much older angle bisector problem. Previous article in issue Next article in issue
BibTeX
@inproceedings{cheng2014skeletal,
author = {Howard Cheng and Satyan L. Devadoss and Brian Li and Andrej Risteski},
title = {{Skeletal configurations of ribbon trees.}},
booktitle = {Discret. Appl. Math},
year = {2014},
url = {https://openreview.net/forum?id=MiGUGnON-8B},
}Loading related content...