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

具有概率噪声原语操作的计算几何

Computational Geometry with Probabilistically Noisy Primitive Operations

David Eppstein, Michael T. Goodrich, Vinesh Sridhar

AI总结:

本文研究布尔几何原语以固定概率出错时的计算几何,提出路径引导下推随机游走,并以高概率最优时间解决点定位、凸包与 Delaunay 三角剖分等问题。

摘要:

此前已有大量工作致力于设计可处理输入退化、数据不精确和算术舍入误差的计算几何算法。我们受噪声排序文献启发,采用一种新方法,研究受噪声布尔原语操作约束的计算几何算法;在这类操作中,例如“点 q 是否位于直线 L 上方?”的比较会以某个固定概率返回错误答案。我们提出一种称为路径引导下推随机游走的新技术,它推广了噪声排序的结果。我们应用该技术,在高概率下以最优时间解决噪声原语下的点定位、平面扫描、二维和三维凸包、动态二维凸包以及 Delaunay 三角剖分问题。

英文摘要:

Much prior work has been done on designing computational geometry algorithms that handle input degeneracies, data imprecision, and arithmetic round-off errors. We take a new approach, inspired by the noisy sorting literature, and study computational geometry algorithms subject to noisy Boolean primitive operations in which, e.g., the comparison "is point q above line L?" returns the wrong answer with some fixed probability. We propose a novel technique called path-guided pushdown random walks that generalizes the results of noisy sorting. We apply this technique to solve point-location, plane-sweep, convex hulls in 2D and 3D, dynamic 2D convex hulls, and Delaunay triangulations for noisy primitives in optimal time with high probability.

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

↑