Abstract
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.
This work has been supported in part by the Israel Science Foundation (grant no. 236/06), by the German-Israeli Foundation (grant no. 969/07), and by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 597–632 (1999)
Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 927–952. CRC Press LLC, Boca Raton (2004)
Yap, C.K., Dubé, T.: The exact computation paradigm. In: Du, D.Z., Hwang, F.K. (eds.) Computing in Euclidean Geometry, 2nd edn., pp. 452–492 (1995)
Mehlhorn, K., Osbild, R., Sagraloff, M.: Reliable and efficient computational geometry via controlled perturbation. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 299–310. Springer, Heidelberg (2006)
Halperin, D., Shelton, C.R.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Theory Appl. 10, 273–287 (1998); A preliminary version appeared in Proc. 15th ACM Symposium on Computational Geometry (1997)
Raab, S., Halperin, D.: Controlled perturbation for arrangements of polyhedral surfaces. Manuscript, full version, School of Computer Science, Tel Aviv University, http://acg.cs.tau.ac.il/danhalperin/publications ; A preliminary version appeared in Proc. 15th ACM Symposium on Computational Geometry (1999/2002)
Packer, E.: Finite-precision approximation techniques for planar arrangements of line segments. M.Sc. thesis, School of Computer Science, Tel Aviv University, Tel Aviv (2002)
Packer, E.: Controlled perturbation of arrangements of line segments in 2D with smart processing order. Comput. Geom. Theory Appl (to appear 2010)
Eyal, E., Halperin, D.: Dynamic maintenance of molecular surfaces under conformational changes. In: Symposium on Computational Geometry, pp. 45–54 (2005)
Halperin, D., Leiserowitz, E.: Controlled perturbation for arrangements of circles. Int. J. Comput. Geometry Appl. 14, 277–310 (2004); A preliminary version appeared in Proc. 21st ACM Symposium on Computational Geometry (2003)
Funke, S., Klein, C., Mehlhorn, K., Schmitt, S.: Controlled perturbation for Delaunay triangulations. In: SODA, pp. 1047–1056 (2005)
Caroli, M.: Evaluation of a generic method for analyzing controlled-perturbation algorithms. M.Sc. thesis, Saarland University, Saarbrücken (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halperin, D. (2010). Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15581-9
Online ISBN: 978-3-642-15582-6
eBook Packages: Computer ScienceComputer Science (R0)