2003 International Conference on Geometric Modeling and Graphics (GMAG'03)
Extensible Point Location Algorithm
London, England
July 16-July 18
ISBN: 0-7695-1985-7
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked list as a data structure to store the polyhedra. The generality of the approach stems from using barycentric coordinates to extract local information about the location of the query point that allows a ?gradient descent?-like walk toward the goal.