Pointed encompassing trees
Hoffmann, Michael, Bettina Speckmann, Csaba D. Tóth · idUS (Universidad de Sevilla) · 2004
It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-triangulation.