Constrained paths in the flip-graph of regular triangulations

Authors:
L. Pournin;Th. M. Liebling
Affiliations:
Swiss Federal Institute of Technology -- EPFL, Lausanne, Switzerland;Swiss Federal Institute of Technology -- EPFL, Lausanne, Switzerland
Venue:
Computational Geometry: Theory and Applications
Year:
2007

Citing 3
Cited 0

Tetrahedrizing point sets in three dimensions

Journal of Symbolic Computation
Construction of three-dimensional Delaunay triangulations using local transformations

Computer Aided Geometric Design
Enumeration of regular triangulations

Proceedings of the twelfth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the connectivity of the flip-graph of regular triangulations that share the same vertex set.