Constrained paths in the flip-graph of regular triangulations
Pournin, Lionel; Liebling, Thomas M.
2007

Files

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.

Details

Title Constrained paths in the flip-graph of regular triangulations
Author(s) Pournin, Lionel ; Liebling, Thomas M.
Published in Computational geometry
Volume 37
Issue 2
Pages 134-140
Date 2007
Keywords
Note PRO 060706
DOI https://doi.org/10.1016/j.comgeo.2006.07.001
Other identifier(s) View record in Web of Science
Laboratories ROSO
Record Appears in Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2006-12-15

Actions

Preview