arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.10831cs.CG
收藏

翻转平面生成路径

Flipping Plane Spanning Paths

Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber

摘要:

设$S$是平面上一般位置的点集,$\mathcal{P}(S)$是所有顶点集为$S$的平面直线路的集合.路径上的翻转$P \in \mathcal{P}(S)$是将$P$的边缘$e$替换为$S$上的另一边缘$f$以从$\mathcal{P}(S)$获得新的有效路径的操作。对于每一个给定的点集$S$,是否每一条从$\mathcal{P}(S)$出发的路径都可以通过一系列翻转变换成从$\mathcal{P}(S)$出发的任何其他路径,这是一个长期存在的开放问题。为了更好地理解这个问题,我们证明了它是足够的证明平面生成路径的第一边是固定的声明。此外,我们提供了点集的特殊类,即轮集和广义双圆(其中包括,例如,双链和双圈)。

英文摘要:

Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$ be the set of all plane straight-line paths with vertex set $S$. A flip on a path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$ with another edge $f$ on $S$ to obtain a new valid path from $\mathcal{P}(S)$. It is a long-standing open question whether for every given point set $S$, every path from $\mathcal{P}(S)$ can be transformed into any other path from $\mathcal{P}(S)$ by a sequence of flips. To achieve a better understanding of this question, we show that it is sufficient to prove the statement for plane spanning paths whose first edge is fixed. Furthermore, we provide positive answers for special classes of point sets, namely, for wheel sets and generalized double circles (which include, e.g., double chains and double circles).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑