Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic

Transforming geometric algorithms into effective computer programs is a difficult task. This transformation is particularly made hard by the basic assumptions of most theoretical geometric algorithms concerning the handling of robustness issues, namely issues related to arithmetic precision and degenerate input. Controlled perturbation, an approach to robust implementation of geometric algorithms we introduced in the late 1990's, aims at removing degeneracies and certifying correct predicate-evaluation, while using fixed-precision arithmetic. After exposing the key ideas underlying the scheme, we review the development of the approach over the past decade including variations and extensions, software implementation and applications. We conclude by pointing out directions for further development and major challenges.

[1]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[2]  Chee Yap,et al.  The exact computation paradigm , 1995 .

[3]  D. Du,et al.  Computing in Euclidean Geometry: (2nd Edition) , 1995 .

[4]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[5]  Dan Halperin,et al.  A perturbation scheme for spherical arrangements with application to molecular modeling , 1997, SCG '97.

[6]  Sigal Raab,et al.  Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes , 1999, SCG '99.

[7]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[8]  Stefan Schirra,et al.  Robustness and Precision Issues in Geometric Computation , 2000, Handbook of Computational Geometry.

[9]  Dan Halperin,et al.  Controlled perturbation for arrangements of circles , 2003, SCG '03.

[10]  Chee-Keng Yap,et al.  Robust Geometric Computation , 2016, Encyclopedia of Algorithms.

[11]  Dan Halperin,et al.  Dynamic maintenance of molecular surfaces under conformational changes , 2005, SCG.

[12]  Kurt Mehlhorn,et al.  Algorithms for Complex Shapes with Certified Numerics and Topology Controlled Perturbation for Delaunay Triangulations , 2022 .

[13]  Kurt Mehlhorn,et al.  Reliable and Efficient Computational Geometry Via Controlled Perturbation , 2006, ICALP.

[14]  Eli Packer.  Controlled Perturbation of sets of line segments in ℝ2 with smart processing order , 2011, Comput. Geom..