Bibliographic Details
| Title: |
Sequences of spanning trees for L-infinity Delaunay triangulations |
| Authors: |
Bose, Prosenjit, Cano Vila, María del Pilar, Silveira, Rodrigo Ignacio |
| Contributors: |
Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. CGA - Computational Geometry and Applications |
| Publication Year: |
2018 |
| Collection: |
Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge |
| Subject Terms: |
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional, Computational geometry, Geometry -- Data processing, Trigonometry, Geometria computacional, Geometria -- Informàtica, Trigonometria, Triangulació |
| Description: |
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 ; Peer Reviewed ; Postprint (published version) |
| Document Type: |
conference object |
| File Description: |
application/pdf |
| Language: |
English |
| Relation: |
info:eu-repo/grantAgreement/MINECO//MTM2015-63791-R/ES/GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES/; info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT; https://hdl.handle.net/2117/127570 |
| Availability: |
https://hdl.handle.net/2117/127570 |
| Rights: |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ ; Open Access ; Attribution-NonCommercial-NoDerivs 3.0 Spain |
| Accession Number: |
edsbas.37836FB0 |
| Database: |
BASE |