Flip-graph non-convexity for once-punctured polygons

Source abstract

The set of the triangulations with vertex set $X$ of a simple polygon $\mathrm{P}$ can be structured into a flip-graph $\mathcal{F}(\mathrm{P},X)$ whose edges connect two triangulations that differ by a single arc. The geometry of flip-graphs has been thoroughly studied and it is known that the subgraph $\mathcal{F}_\varepsilon(\mathrm{P},X)$ induced by the triangulations that contain a given arc $\varepsilon$ is strongly convex in $\mathcal{F}(\mathrm{P},X)$ when $\mathrm{P}$ is convex and $X$ contains no puncture (points in the interior of $\mathrm{P}$) and at most one flat vertex (points in the interior of an edge). When $X$ contains at least two punctures or flat vertices, it is also known that this strong convexity property fails. Here, we close the last open case by showing that, for any convex polygon with sufficiently many vertices, one can always place a single puncture in $X$ in such a way that $\mathcal{F}_\varepsilon(\mathrm{P},X)$ is not strongly convex in $\mathcal{F}(\mathrm{P},X)$. We prove a similar result for simple polygons with a single reflex vertex. The main ingredients in our proofs are a decomposition lemma for a class of $3$-dimensional triangulations and a hyperbolic volume argument regarding their embedding into $\mathbb{H}^3$.