论文库

原文摘要

Consider a crossing-free polygonal path with $n$ vertices and a flip operation that removes an edge and adds another one, without changing the vertex set and keeping the path crossing free. It is conjectured that any two such paths can be transformed into each other by a sequence of flips. Recently, Kleist et al. (2024) proved the conjecture for the special cases of vertices arranged in two convex layers. However, the number of flips in their proof may be exponential. In this paper, we show that $O(n^2)$ flips suffice. More precisely, for a two-layer point set $S=L_0\cup L_1$, where $L_0$ and $L_1$ denote the outer and inner layers, respectively, our method uses $O(|L_0|+|L_1|^2)$ flips.