Classroom examples of robustness problems in geometric computations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computational Geometry Année : 2008

Classroom examples of robustness problems in geometric computations

Résumé

The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause implementations to fail. Although this is well known, there are no concrete examples with a comprehensive documentation of what can go wrong and why. In this paper, we provide a case study of what can go wrong and why. For our study, we have chosen two simple algorithms which are often taught, an algorithm for computing convex hulls in the plane and an algorithm for computing Delaunay triangulations in space. We give examples that make the algorithms fail in many different ways. We also show how to construct such examples systematically and discuss the geometry of the floating-point implementation of the orientation predicate. We hope that our work will be useful for teaching computational geometry.
Fichier principal
Vignette du fichier
RevisedClassroomExamples.pdf (182.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00344310 , version 1 (15-12-2008)

Identifiants

Citer

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee Yap. Classroom examples of robustness problems in geometric computations. Computational Geometry, 2008, 40 (1), pp.61-78. ⟨10.1016/j.comgeo.2007.06.003⟩. ⟨inria-00344310⟩

Collections

INRIA INRIA2
682 Consultations
1256 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More