Constrained paths in the flip-graph of regular triangulations

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.


Publié dans:
Computational geometry, 37, 2, 134-140
Année
2007
Mots-clefs:
Note:
PRO 060706
Laboratoires:




 Notice créée le 2006-12-15, modifiée le 2019-06-17

n/a:
Télécharger le documentPDF
Lien externe:
Télécharger le documentURL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)