Ponencia
Pointed encompassing trees
Autor/es | Hoffmann, Michael
Speckmann, Bettina Tóth, Csaba D. |
Fecha de publicación | 2004 |
Fecha de depósito | 2017-03-02 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | Hoffmann, M., Speckmann, B. y Tóth, C.D. (2004). Pointed encompassing trees. En 20th European Workshop on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Pointed encompassing trees.pdf | 98.32Kb | [PDF] | Ver/ | |