Trees in simple Polygons
Computational Geometry
2012-11-12 v1
Abstract
We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set of disjoint line segments in the plane admits a binary tree.
Keywords
Cite
@article{arxiv.1211.2118,
title = {Trees in simple Polygons},
author = {Tillmann Miltzow},
journal= {arXiv preprint arXiv:1211.2118},
year = {2012}
}