Abstract
Reliable implementation of geometric algorithms is a notoriously difficult task. Algorithms are usually designed for the Real-RAM, capable of computing with real numbers in the sense of mathematics, and for non-degenerate inputs. But, real computers are not Real-RAMs and inputs are frequently degenerate.
In the first part of the talk we illustrate the pitfalls of geometric computing by way of examples [KMP + 04]. The examples demonstrate in a lucid way that standard and frequently taught algorithms can go completely astray when naively implemented with floating point arithmetic.
Partially supported by the IST Programme of the EU under Contract No IST-2005-TODO, Algorithms for Complex Shapes (ACS).
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
References
Funke, S., Klein, Ch., Mehlhorn, K., Schmitt, S.: Controlled perturbation for Delaunay triangulations. In: SODA, pp. 1047–1056 (2005), www.mpi-sb.mpg.de/~mehlhorn/ftp/ControlledPerturbation.pdf
Halperin, D., Leiserowitz, E.: Controlled perturbation for arrangements of circles. In: SoCG, pp. 264–273 (2003)
Halperin, D., Raab, S.: Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes; A preliminary version appeared in SoCG 1999, pp. 163–172 (1999), Available from Halperin’s home page
Halperin, Shelton: A perturbation scheme for spherical arrangements with application to molecular modeling. CGTA: Computational Geometry: Theory and Applications 10 (1998)
Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom examples of robustness problems in geometric computations. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 702–713. Springer, Heidelberg (2004), www.mpi-sb.mpg.de/~mehlhorn/ftp/ClassRoomExample.ps
Mehlhorn, K., Osbild, R.: Reliable and efficient computational geometry via controlled perturbation (extended abstract), www.mpi-sb.mpg.de/~mehlhorn/ftp/ControlledPerturbationGeneralStrategy.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K. (2006). Reliable and Efficient Geometric Computing. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_1
Download citation
DOI: https://doi.org/10.1007/11758471_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)