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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074942
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:01:30 PM
Last modification on : Saturday, January 27, 2018 - 1:30:58 AM
Long-term archiving on : Sunday, April 4, 2010 - 10:25:22 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

254

Files downloads

334