Loading...
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.
Loading...
Name
PouLie Constrained paths in the flip-graph.pdf
Access type
openaccess
Size
136.02 KB
Format
Adobe PDF
Checksum (MD5)
cf62997f3954b45489199f205cdfe187