Classroom examples of robustness problems in geometric computations

Computational Geometry: Theory and Applications

Volumn 40, Issue 1, 2008, Pages 61-78

  Kettner, Lutz ^a   Mehlhorn, Kurt ^a   Pion, Sylvain ^b   Schirra, Stefan ^c   Yap, Chee ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INRIA   (France)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

Floating point geometry; Implementation; Numerical robustness problems

Indexed keywords

EID: 84867924186     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.06.003     Document Type: Article

References (32)

1. A.M. Andrew Another efficient algorithm for convex hulls in two dimensions Inform. Process. Lett. 9 1979 216 219
2. C. Bradford Barber, D.P. Dobkin, and H. Huhdanpaa The quickhull algorithm for convex hulls ACM Trans. Math. Softw. 22 4 1996 469 483
3. K.L. Clarkson, and P.W. Shor Applications of random sampling in computational geometry, II J. Discrete Comput. Geom. 4 1989 387 421
4. P. Deuflhard, and A. Hohmann Numerische Mathematik: Eine algorithmisch orientierte Einführung 1991 Walter de Gruyter
5. O. Devillers, S. Pion, and M. Teillaud Walking in a triangulation Internat. J. Found. Comput. Sci. 13 2002 181 199
6. T.K. Dey, K. Sugihara, and C.L. Bajaj Delaunay triangulations in three dimensions with finite precision arithmetic Comput. Aided Geom. Design 9 1992 457 470
7. H. Edelsbrunner An acyclicity theorem for cell complexes in d dimensions Combinatorica 10 3 1990 251 260
8. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr On the design of CGAL a computational geometry algorithms library Softw. - Pract. Exp. 30 11 2000 1167 1202
9. G.E. Forsythe Pitfalls in computation, or why a math book is not enough Technical Report CS-TR-70-147, Stanford University, Computer Science Department, 1970. Available at http://www.historical.ncstrl.org/litesite-data/stan/CS-TR- 70-147.pdf
10. A.R. Forrest Computational geometry in practice R.A. Earnshaw, Fundamental Algorithms for Computer Graphics NATO ASI vol. F17 1985 Springer-Verlag 707 724
11. S. Fortune Stable maintenance of point-set triangulations in two dimensions Proc. Foundations of Computer Science (FOCS) 30 1989 494 499
12. S. Fortune, Stable maintenance of point-set triangulation in two dimensions, manuscript, 1990
13. S. Fortune Numerical stability of algorithms for 2-d Delaunay triangulations Internat. J. Comput. Geom. Appl. 5 1-2 1995 193 213
14. S. Fortune, and C. van Wyk Static analysis yields efficient exact integer arithmetic for computational geometry ACM Transactions on Graphics 15 1996 223 248 Preliminary version in ACM Conference on Computational Geometry, 1993
15. S. Funke, Ch. Klein, K. Mehlhorn, S. Schmitt, Controlled perturbation for Delaunay triangulations, in: Proc. of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, Canada, 2005, pp. 1047-1056
16. D. Goldberg What every computer scientist should know about floating-point arithmetic ACM Comput. Surv. 23 1 1991 5 48
17. R.L. Graham An efficient algorithm for determining the convex hulls of a finite point set Inform. Process. Lett. 1 1972 132 133
18. L. Guibas, D. Salesin, and J. Stolfi Constructing strongly convex approximate hulls with inaccurate primitives Proc. 1st Annu. SIGAL Internat. Symp. Algorithms Lecture Notes Comput. Sci. vol. 450 1990 Springer-Verlag 261 270
19. D. Halperin, and C.R. Shelton A perturbation scheme for spherical arrangements with application to molecular modeling Comput. Geom. Theory Appl. 10 1998
20. IEEE standard for binary floating-point arithmetic SIGPLAN Notices 22 2 February 1987 9 25 Reprint of ANSI/IEEE Std 754-1985, The Institute of Electrical and Electronics Engineers, Inc, 345 East 47th Street, New York, NY 10017, USA
21. J.W. Jaromczyk, and G.W. Wasilkowski Computing convex hull in a floating point arithmetic Comput. Geom. Theory Appl. 4 1994
22. D. Jiang, N.F. Stewart, Backward error analysis in computational geometry, in: ICCSA (1), 2006, pp. 50-59
23. V. Karamcheti, C. Li, I. Pechtchanski, C. Yap, A Core library for robust numerical and geometric computation, in: 15th ACM Symp. Computational Geometry, 1999, pp. 351-359
24. L. Kettner, and S. Näher Two computational geometry libraries: LEDA and CGAL J.E. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry second ed. 2004 CRC Press LLC Boca Raton, FL 1435 1463 Chapter 65
25. L. Kettner, and E. Welzl One sided error predicates in geometric computing IFIP World Computer Congress on Fundamentals - Foundations of Computer Science 1998 Österreichische Computer Gesellschaft 13 26
26. Z. Li, and V.J. Milenkovic Constructing strongly convex hulls using exact or rounded arithmetic SoCG'90 1990 ACM Press 235 243
27. K. Mehlhorn, and S. Näher The LEDA Platform for Combinatorial and Geometric Computing 1999 Cambridge University Press 1018 pages
28. S. Schirra Robustness and precision issues in geometric computation R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science Publishers B.V., North-Holland Amsterdam 597 632 Chapter 14
29. S. Schirra, J. Tusch, Experimental comparison of the cost of approximate and exact convex hull computation in the plane, in: Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG'06), 2006, pp. 19-22
30. J.R. Shewchuk Adaptive precision floating-point arithmetic and fast robust geometric predicates Discrete Comput. Geom. 18 1997 305 363
31. P.H. Sterbenz Floating Point Computation 1974 Prentice Hall
32. C.K. Yap Robust geometric computation J.E. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry second ed. 2004 CRC Press LLC Boca Raton, FL Chapter 41