Bilkent University Department of Computer Engineering CS 478/564 Computational Geometry Project Proposal

Devillers mentions a method to query and update points using a hierarchical structure of Delaunay triangulations. Each level of hierarchy contains a subset of the level below. Algorithm uses a "walk" algorithm to find the edge closest to the query point then starts another traversal in the level below from the found edge until the base triangulation is reached [1]. Computational Geometry Algorithms Library(CGAL) has an implementation of this method built in [2].