Connectivity of geometric triangulations by bistellar flips

Determine whether any two triangulations of a fixed n-vertex point set in three-dimensional Euclidean space can be connected by a sequence of geometric 2–3 and 3–2 bistellar flips.

Background

The paper relates the topological flip graph of triangulated 3-spheres to a longstanding computational-geometry problem concerning triangulations of a fixed point set in d space. Unlike the unrestricted Pachner graph, the geometric problem permits only vertex-preserving bistellar flips.

The question asks whether the geometric flip graph on triangulations of every fixed point configuration is connected. The paper cites this as an outstanding problem and uses partial results related to it as motivation for studying connectivity in the topological setting.

References

Our study of \mathcal{F}(n) ’s connectivity is inspired by a related outstanding open question in Computational Geometry posed in 1990 by Edelsbrunner, Preparata, and West : given two triangulations of a fixed n -vertex point set in \mathbb{R}3 , can they be linked by a sequence of 2--3 and 3--2 geometric bistellar flips?

Components of Flip Graph of Triangulated S^3  (2505.06472 - Faber et al., 10 May 2025) in Section 2, Polytopal Triangulations and Connectivity