research article
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.
Type
research article
Web of Science ID
WOS:000245758900005
Author(s)
Date Issued
2007
Published in
Volume
37
Issue
2
Start page
134
End page
140
Note
PRO 060706
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
December 15, 2006
Use this identifier to reference this record