Delaunay triangulations, theory vs practice.

Olivier Devillers 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : Thirty years ago, at the early ages of computational geometry, the game of computational geometers was to design fancy algorithms with optimal theoretical complexities. The result was usually an algorithmic journal article, but not an implementation. In the same period, some people were actually cod- ing geometric algorithms, but without regard for the asymptotic complexities, and without proof of cor- rectness of the result. They were not using the algo- rithms designed by theoreticians for two reasons [14]: - these algorithms were too intricate and - they rely on the arithmetic of real numbers, which differs from the floating-point arithmetic of comput- ers. These drawbacks of old computational geometry al- gorithms have been addressed in various ways to ob- tain algorithms that reconcile robustness, practical ef- ficiency, and theoretical guarantees. The aim of this talk is to illustrate some steps of this transition from theoretical stuff to efficient algo- rithms actually used in industrial applications. I will do this using my favorite problem: the construction of the Delaunay triangulation of a set of points and the dynamic maintenance of such a triangulation under point insertions and deletions.
Type de document :
Communication dans un congrès
EuroCG, 28th European Workshop on Computational Geometry, 2012, Assisi, Italy. 2012
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger


https://hal.inria.fr/hal-00850561
Contributeur : Olivier Devillers <>
Soumis le : mardi 28 avril 2015 - 16:29:51
Dernière modification le : jeudi 11 janvier 2018 - 16:43:58
Document(s) archivé(s) le : lundi 14 septembre 2015 - 14:51:34

Identifiants

  • HAL Id : hal-00850561, version 1

Collections

Citation

Olivier Devillers. Delaunay triangulations, theory vs practice.. EuroCG, 28th European Workshop on Computational Geometry, 2012, Assisi, Italy. 2012. 〈hal-00850561〉

Partager

Métriques

Consultations de la notice

272

Téléchargements de fichiers

383