| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414904 | Computational Geometry | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
