On the total correctness of lawson's oriented walk algorithm

@inproceedings{Weller1998OnTT,
title={On the total correctness of lawson's oriented walk algorithm},
author={Frank Weller},
booktitle={CCCG},
year={1998}
}

Lawson's oriented walk is a simple algorithm for point location without preprocessing. Originally formulated for planar Delaunay triangulations 2], it generalizes immediately to tesselations of a convex, polyhedral domain into convex, polyhedral cells in d-space. Given a query point q, the algorithm works as follows. 1. Pick some cell C of the tesselation. 2. For each facet F of C, determine the position of q relative to the hyperplane that contains F. 3. If q and C lie on opposite sides of the… CONTINUE READING