Robust and efficient implementation of the Delaunay tree

Olivier Devillers (1)

1 PRISME - Geometry, Algorithms and Robotics

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.

Keywords: Delaynay triangulation; Voronoi diagram; robust algorithms; randomized algorithms; numerical precision; degenerated cases

Domains: Other [cs.OH]

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