A paradigm for robust geometric algorithms
A paradigm for robust geometric algorithms
复制标题
稳健几何算法的范例
作者：
J. Hopcroft;P. J. Kahn
本文探讨了一种生成几何算法的范式，其中依赖于有限精度数值计算的逻辑决策不会导致失败。它将此范例应用于相交两个凸多面体对象的任务。在这项工作中的一个关键工具是一种方法，扰动嵌入多面体的方式与他们的拓扑一致。
This paper explores a paradigm for producing geometrical algorithms in which logical decisions that depend on finite-precision numerical calculation cannot lead to failure. It applies this paradigm to the task of intersecting two convex polyhedral objects. A key tool in this work is a method of perturbing embedding polyhedra in ways consistent with their topology.