Extensible Point Location Algorithm

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.

• Type: Conference
• Year: 2003
• Where: GMP
• Authors: Rashmi Sundareswara, Paul R. Schrater
• Keywords: General Polyhedron Lattices, GMP 2003, Simple Linked List, Walk-through Point Location