Robust and efficient implementation of the Delaunay tree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Robust and efficient implementation of the Delaunay tree

Olivier Devillers

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00074942 , version 1

Cite

Olivier Devillers. Robust and efficient implementation of the Delaunay tree. [Research Report] RR-1619, INRIA. 1992, pp.11. ⟨inria-00074942⟩
148 View
13424 Download

Share

Gmail Facebook Twitter LinkedIn More