Classroom examples of robustness problems in geometric computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 702-713

  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

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DIGITAL ARITHMETIC; GEOMETRY; TEACHING;

COMPREHENSIVE DOCUMENTATION; EXACT REAL ARITHMETIC; EXTENDED ABSTRACTS; FLOATING POINT IMPLEMENTATION; GEOMETRIC COMPUTATIONS; INCREMENTAL ALGORITHM; MACHINE MODELING; REAL ARITHMETIC;

ALGORITHMS;

EID: 35048841152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_62     Document Type: Article

References (16)

1. [And79] A.M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9:216-219,1979.
2. [CS89] K.L. Clarkson and P.W. Shor. Applications of random sampling in computational geometry, II. Journal of Discrete and Computational Geometry, 4:387-421, 1989.
3. [DSB92] T. K. Dey, K. Sugihara, and C. L. Bajaj. Delaunay triangulations in three dimensions with finite precision arithmetic. Comput. Aided Geom. Design, 9:457-470, 1992.
4. [FM91] S. Fortune and V.J. Milenkovic. Numerical stability of algorithms for line arrangements. In SoCG'91, pages 334-341. ACM Press, 1991.
5. [For85] A. R. Forrest. Computational geometry in practice. In R. A. Earnshaw, editor, Fundamental Algorithms for Computer Graphics, volume F17 of NATOASI, pages 707-724. Springer-Verlag, 1985.
6. [Gol90] D. Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23(1):5-48, 1990.
7. [Gra72] R.L. Graham. An efficient algorithm for determining the convex hulls of a finite point set. Information Processing Letters, 1:132-133, 1972.
8. [HS98] D. Halperin and C. R. Shelton. A perturbation scheme for spherical arrangements with application to molecular modeling. Comp. Geom.: Theory and Applications, 10, 1998.
9. [JRZ91] M. Jünger, G. Reinelt, and D. Zepf. Computing correct Delaunay triangulations. Computing, 47:43-49, 1991.
10. [KLN91] M. Karasick, D. Lieber, and L.R. Nackman. Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, 10(1):71-91, January 1991.
11. [LM90] Z. Li and V.J. Milenkovic. Constructing strongly convex hulls using exact or rounded arithmetic. In SoCG'90, pages 235-243. ACM Press, 1990.
12. [Mil89] V.J. Milenkovic. Calculating approximate curve arrangements using rounded arithmetic. In SoCG'89, pages 197-207. ACM Press, 1989.
13. [MN99] K. Mehlhorn and S. Näher. The LEDA Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. 1018 pages.
14. [She97] J.R. Shewchuk. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry, 18:305-363, 1997.
15. [SIII00] K. Sugihara, M. Iri, H. Inagaki, and T. Imai. Topology-oriented implementation - an approach to robust geometric algorithms. Algorithmica, 27(1):5-20, 2000.
16. [Yap04] C. K. Yap. Robust geometric computation. In J.E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 41. CRC Press LLC, Boca Raton, FL, 2nd edition, 2004.