arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.09974cs.CG
收藏

以最小代价分离几何数据:两个不相交凸包

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls

Bahram Sadeghi Bigham

AI总结:

本文将NP难的Almost 2-SAT问题几何化为“两个不相交凸包”问题,并利用分离轴定理与点线对偶性提出O(n^2)多项式时间算法。

摘要:

本研究引入了一个NP难问题(“Almost 2-SAT”问题)的几何版本,该问题在聚类、分离轴、二值传感器网络、形状分离、图像处理等领域具有潜在应用。此外,研究表明,由于一些组合性质和几何特性,这个被称为“两个不相交凸包”的新问题可以在多项式时间内求解。为此,本文还提出了一种O(n^2)算法,该算法利用了分离轴定理(SAT)以及点/线对偶性。

英文摘要:

In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore, it has been illustrated that the new problem known as "Two Disjoint Convex Hulls" can be solved in polynomial time due to some combinatorial aspects and geometric properties. For this purpose, an $O(n^2)$ algorithm has also been presented which employs the Separating Axis Theorem (SAT) and the duality of points/lines.

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

↑