11 citations · 119 across the 41 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CG2012
Trees in simple Polygons
Tillmann Miltzow
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 thi…
cs.CC2012★ 1 cited
Augmenting a Geometric Matching is -complete
Tillmann Miltzow
Given points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is -complete to decide if a partial mat…