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.


Published in:
Computational geometry, 37, 2, 134-140
Year:
2007
Keywords:
Note:
PRO 060706
Laboratories:




 Record created 2006-12-15, last modified 2018-01-27

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)