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 bary centric coordinates to extract local information about the location of the query point that allows a 'gradient descent'-like walk toward the goal.
展开▼
