Skip to Main content Skip to Navigation

Improved Incremental Randomized Delaunay Triangulation.

Olivier Devillers 1 
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the levels below. Point location is done by marching in a triangulation to determine the nearest neighbor of the query at that level, then the march restarts from that neighbor at the level below. Using a small sample (3 %) allows a small memory occupation; the march and the use of the nearest neighbor to change levels quickly locate the query.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 12:41:13 PM
Last modification on : Friday, February 4, 2022 - 3:18:29 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:44:58 PM


  • HAL Id : inria-00073390, version 1



Olivier Devillers. Improved Incremental Randomized Delaunay Triangulation.. RR-3298, INRIA. 1997. ⟨inria-00073390⟩



Record views


Files downloads