Mostrar el registro sencillo del ítem
Ponencia
Pointed encompassing trees
dc.creator | Hoffmann, Michael | es |
dc.creator | Speckmann, Bettina | es |
dc.creator | Tóth, Csaba D. | es |
dc.date.accessioned | 2017-03-02T11:33:58Z | |
dc.date.available | 2017-03-02T11:33:58Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Hoffmann, M., Speckmann, B. y Tóth, C.D. (2004). Pointed encompassing trees. En 20th European Workshop on Computational Geometry, Sevilla. | |
dc.identifier.uri | http://hdl.handle.net/11441/55112 | |
dc.description.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. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | 20th European Workshop on Computational Geometry (2004). | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Pointed encompassing trees | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
idus.format.extent | 4 p. | es |
dc.eventtitle | 20th European Workshop on Computational Geometry | es |
dc.eventinstitution | Sevilla | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Pointed encompassing trees.pdf | 98.32Kb | [PDF] | Ver/ | |