Pii: S0925-7721(98)00035-2


This paper studies the point location problem in Delaunay triangulations without preprocessing and additional storage. The proposed procedure finds the query point by simply “walking through” the triangulation, after selecting a “good starting point” by random sampling. The analysis generalizes and extends a recent result for d = 2 dimensions by proving… (More)


9 Figures and Tables