Abstract
Computing with geometric objects (points, curves, and surfaces) is central for many engineering disciplines and lies at the heart of computer aided design systems. Implementing geometric algorithms is notoriously difficult and most actual implementations are incomplete: they are known to crash or deliver the wrong result on some instances.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Berberich, E., Kerber, M., Sagraloff, M.: Exact geometric-topological analysis of algebraic surfaces. In: SoCG, pp. 164–173 (2008)
CGAL (Computational Geometry Algorithms Library), http://www.cgal.org
Emeliyanenko, P., Berberich, E., Sagraloff, M.: Visualizing arcs of implicit algebraic curves, exactly and fast. In: ISVC 2009: Proceedings of the 5th International Symposium on Advances in Visual Computing, pp. 608–619. Springer, Heidelberg (2009)
Emeliyanenko, P.: A complete modular resultant algorithm targeted for realization on graphics hardware. In: PASCO 2010. ACM, New York (to appear 2010)
Emeliyanenko, P.: Modular Resultant Algorithm for Graphics Processors. In: ICA3PP 2010, pp. 427–440. Springer, Heidelberg (2010)
EXACUS (EXAct computation with CUrves and Surfaces), http://www.mpi-sb.mpg.de/projects/EXACUS
Fortune, S., van Wyk, C.: Efficient exact integer arithmetic for computational geometry. In: 7th ACM Conference on Computational Geometry, pp. 163–172 (1993)
Halperin, D., Shelton, C.: A perturbation scheme for spherical arrangements with application to molecular modeling. CGTA: Computational Geometry: Theory and Applications 10 (1998)
Kerber, M.: Geometric Algorithms for Algebraic Curves and Surfaces. PhD thesis, Saarland University (2009)
Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.: Classroom Examples of Robustness Problems in Geometric Computations. Computational Geometry: Theory and Applications (CGTA) 40, 61–78 (2008); A preliminary version appeared in ESA 2004. LNCS, vol. 3221, pp. 702–713. Springer, Heidelberg (2004)
Mehlhorn, K., Näher, S.: The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Mehlhorn, K., Osbild, R., Sagraloff, M.: A General Approach to the Analysis of Controlled Perturbation Algorithms. Submitted for publication a preliminary version appeared in ICALP 2006 (February 2010)
Mehlhorn, K., Sagraloff, M.: A Deterministic Descartes Algorithm for Real Polynomials. In: ISSAC 2009 (2009)
Yap, C.-K.: Towards exact geometric computation. CGTA: Computational Geometry: Theory and Applications 7 (1997)
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
Mehlhorn, K. (2010). Reliable and Efficient Geometric Computing. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_3
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)
