Robust and efficient implementation of the Delaunay tree - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1992

Robust and efficient implementation of the Delaunay tree

Olivier Devillers

Résumé

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.
Fichier principal
Vignette du fichier
RR-1619.pdf (607.64 Ko) Télécharger le fichier

Dates et versions

inria-00074942 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00074942 , version 1

Citer

Olivier Devillers. Robust and efficient implementation of the Delaunay tree. [Research Report] RR-1619, INRIA. 1992, pp.11. ⟨inria-00074942⟩
142 Consultations
194 Téléchargements

Partager

Gmail Facebook X LinkedIn More