Opened Access Pointed encompassing trees
Show item statistics
Export to
Author: Hoffmann, Michael
Speckmann, Bettina
Tóth, Csaba D.
Date: 2004
Document type: Presentation
Abstract: 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.
Size: 98.32Kb
Format: PDF


This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)