Flips in higher order Delaunay triangulations
Preprint (436,0Kb) (Restricted access) Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typeConference report
Rights accessRestricted access - publisher's policy
European Commission's projectCONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
We study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph of S has one vertex for each possible triangulation of S, and an edge connecting two vertices when the two corresponding triangulations can be transformed into each other by a flip (i.e., exchanging the diagonal of a convex quadrilateral by the other one). The flip graph is an essential structure in the study of triangulations, but until now it had been barely studied for order-k Delaunay triangulations. In this work we show that, even though the order-k flip graph might be disconnected for k = 3, any order-k triangulation can be transformed into some other order-k triangulation by at most k - 1 flips, such that the intermediate triangulations are of order at most 2k - 2, in the following settings: (1) for any k = 0 when S is in convex position, and (2) for any k = 5 and any point set S. Our results imply that the flip distance between two order-k triangulations is O(kn), as well as an efficient enumeration algorithm.
The final authenticated version is available online at https://doi.org/10.1007/978-3-030-61792-9_18
CitationArseneva, E. [et al.]. Flips in higher order Delaunay triangulations. A: Latin American Theoretical Informatics Symposium. "LATIN 2020: Theoretical Informatics: 14th Latin American Symposium: São Paulo, Brazil: 5-8 january, 2021: proceedings". 2021, p. 223-234. DOI 10.1007/978-3-030-61792-9_18.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder