On the total correctness of lawson's oriented walk algorithm

  title={On the total correctness of lawson's oriented walk algorithm},
  author={Frank Weller},
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


Publications citing this paper.


Publications referenced by this paper.
Showing 1-4 of 4 references

Fast ran- domized point location without preprocessing in two- and three-dimensional Delaunay triangulations

  • Ernst P. M ucke, Isaac Saias, Binhai Zhu
  • In Twelfth An- nual Symposium on Computational…
  • 1996

Software for C1 surface interpolation

  • C. L. Lawson
  • Mathematical Software III,
  • 1977

Similar Papers

Loading similar papers…