Sequences of spanning trees for L-infinity Delaunay triangulations
dc.contributor.author | Bose, Prosenjit |
dc.contributor.author | Cano Vila, María del Pilar |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2019-01-25T09:22:29Z |
dc.date.available | 2019-01-25T09:22:29Z |
dc.date.issued | 2018 |
dc.identifier.citation | Bose, P.; Cano, M.; Silveira, R.I. Sequences of spanning trees for L-infinity Delaunay triangulations. A: European Workshop on Computational Geometry. "EuroCG 2018: 34th European Workshop on Computational Geometry: Berlin, March 21–23, 2018: extended abstracts". 2018, p. 49:1-49:6. |
dc.identifier.uri | http://hdl.handle.net/2117/127570 |
dc.description.abstract | We extend a known result about L2-Delaunay triangulations to L∞-Delaunay. Let TS be the set of all non-crossing spanning trees of a planar n-point set S. We prove that for each element T of TS, there exists a length-decreasing sequence of trees T0, . . . , Tk in the L∞-metric such that T0 = T, Tk = MST(S) and Ti does not cross Ti−1 for all i = 1, . . . , k, where MST(S) denotes the minimum spanning tree of S in the L∞ metric. We also give an Ω(log n) lower bound for the length of the sequence |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Computational geometry |
dc.subject.lcsh | Geometry -- Data processing |
dc.subject.lcsh | Trigonometry |
dc.title | Sequences of spanning trees for L-infinity Delaunay triangulations |
dc.type | Conference report |
dc.subject.lemac | Geometria computacional |
dc.subject.lemac | Geometria -- Informàtica |
dc.subject.lemac | Trigonometria |
dc.subject.lemac | Triangulació |
dc.contributor.group | Universitat Politècnica de Catalunya. CGA - Computational Geometry and Applications |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Open Access |
local.identifier.drac | 23602066 |
dc.description.version | Postprint (published version) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2015-63791-R/ES/GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES/ |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT |
local.citation.author | Bose, P.; Cano, M.; Silveira, R.I. |
local.citation.contributor | European Workshop on Computational Geometry |
local.citation.publicationName | EuroCG 2018: 34th European Workshop on Computational Geometry: Berlin, March 21–23, 2018: extended abstracts |
local.citation.startingPage | 49:1 |
local.citation.endingPage | 49:6 |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain