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

平面中线段交叉的消除

Untangling Segments in the Plane

Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier

AI总结:

本文提出统一框架,研究平面线段集中消除交叉的翻转操作次数,证明对凸位置端点敏感的新界,适用于TSP环游、树、匹配等图结构。

摘要:

平面中的一组n条线段可能构成欧几里得旅行商问题(TSP)的环游、一棵树或一个匹配等。最优TSP环游以及最小生成树和完美匹配没有交叉线段,但若干启发式算法和近似算法可能产生带交叉的解。如果两条线段交叉,则可以通过以下翻转操作减少总长度:我们移除一对交叉线段,并插入一对非交叉线段,同时保持相同的顶点度数。在本文中,我们考虑在不同假设下执行的翻转次数,使用一个新的统一框架,该框架适用于环游、树、匹配以及其他类型的(多重)图。在该框架内,我们证明了几个新的界,这些界对某些端点是否处于凸位置敏感。

英文摘要:

A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and approximation algorithms may produce solutions with crossings. 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. In this paper, we consider the number of flips performed under different assumptions, using a new unifying framework that applies to tours, trees, matchings, and other types of (multi)graphs. Within this framework, we prove several new bounds that are sensitive to whether some endpoints are in convex position or not.

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

↑