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

平面中用于解开线段的短翻转序列

Short Flip Sequences to Untangle Segments in the Plane

Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier

AI总结:

针对平面线段交叉问题,本文设计高效翻转策略以少量翻转得到无交叉线段,将凸位置端点的线性/近线性翻转次数界推广至非凸位置,在通用多重图框架下证明结果。

摘要:

平面中的一个(多重)线段集合可构成TSP回路、匹配、树或任意多重图。若两条线段相交,我们可通过如下翻转操作减少总长度:移除一对相交线段,插入一对不相交线段,同时保持顶点度数不变。本文的目标是设计高效的线段翻转策略,以在少量翻转后得到无交叉的线段。此前仅对端点处于凸位置的线段有翻转次数的线性和近线性界的结论。我们推广了这些结果,证明了端点不处于凸位置的情形下的线性和近线性界。我们的结果在适用于多个问题的通用框架下得到证明,采用多重图并区分了执行翻转时的移除和插入选择。

英文摘要:

A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and insert a pair of non-crossing segments, while keeping the same vertex degrees. The goal of this paper is to devise efficient strategies to flip the segments in order to obtain crossing-free segments after a small number of flips. Linear and near-linear bounds on the number of flips were only known for segments with endpoints in convex position. We generalize these results, proving linear and near-linear bounds for cases with endpoints that are not in convex position. Our results are proved in a general setting that applies to multiple problems, using multigraphs and the distinction between removal and insertion choices when performing a flip.

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

↑