Practical Distribution-Sensitive Point Location in Triangulations - Archive ouverte HAL Access content directly
Journal Articles Computer Aided Geometric Design Year : 2013

Practical Distribution-Sensitive Point Location in Triangulations

(1) , (2)


We design, analyze, implement, and evaluate a distribution-sensitive point location algorithm based on the classical Jump & Walk, called Keep, Jump, & Walk. For a batch of query points, the main idea is to use previous queries to improve the current one. In practice, Keep, Jump, & Walk is ac- tually a very competitive method to locate points in a triangulation. We also study some constant- memory distribution-sensitive point location algorithms, which work well in practice with the classical space-filling heuristic for fast point location. Regarding point location in a Delaunay triangulation, we show how the Delaunay hierarchy can be used to answer, under some hypotheses, a query q with a O(log #(pq)) randomized expected complexity, where p is a previously located query and #(s) indicates the number of simplices crossed by the line segment s. The Delaunay hierarchy has O(nlogn) time complexity and O(n) memory complexity in the plane, and under certain realistic hypotheses these com- plexities generalize to any finite dimension. Finally, we combine the good distribution-sensitive behavior of Keep, Jump, & Walk, and the good complexity of the Delaunay hierarchy, into a novel point location algorithm called Keep, Jump, & Climb. To the best of our knowledge, Keep, Jump, & Climb is the first practical distribution-sensitive algorithm that works both in theory and in practice for Delaunay triangulations.
Fichier principal
Vignette du fichier
hal.pdf (5.67 Mo) Télécharger le fichier
Vignette du fichier
vignette.jpg (92.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-00803093 , version 1 (21-03-2013)



Pedro Machado Manhães de Castro, Olivier Devillers. Practical Distribution-Sensitive Point Location in Triangulations. Computer Aided Geometric Design, 2013, 30, pp.431-450. ⟨10.1016/j.cagd.2013.02.004⟩. ⟨hal-00803093⟩


367 View
358 Download



Gmail Facebook Twitter LinkedIn More