Robust and efficient implementation of the Delaunay tree

Olivier Devillers 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this paper, we present some practical results concerning the implementation of the algorithm described in (DMT) which computes dynamically the Delaunay triangulation of a set of sites in the plane in logarithmic expected update time. More precisely, we show that the hypotheses of non degenerate positions can be dropped and the problem of precision can be treated correctly.
Type de document :
Rapport
[Research Report] RR-1619, INRIA. 1992, pp.11
Liste complète des métadonnées

https://hal.inria.fr/inria-00074942
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:01:30
Dernière modification le : samedi 27 janvier 2018 - 01:30:58
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:25:22

Fichiers

Identifiants

  • HAL Id : inria-00074942, version 1

Collections

Citation

Olivier Devillers. Robust and efficient implementation of the Delaunay tree. [Research Report] RR-1619, INRIA. 1992, pp.11. 〈inria-00074942〉

Partager

Métriques

Consultations de la notice

238

Téléchargements de fichiers

302