Publication

Constrained paths in the flip-graph of regular triangulations

Thomas Liebling, Lionel Pournin
2007
Journal Articles

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.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Constrained paths in the flip-graph of regular triangulations

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Collapse-invariant properties of spaces equipped with signals or directions

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes