A Spherical Point Location Algorithm Based on Barycentric Coordinates

An algorithm based on barycentric coordinates is presented to solve the point location problem in spherical triangulation meshes. During the preprocessing stage, a subdivision connectivity mesh is constructed to partition the spherical domain into some subdivision regions. Then we find a representation triangle from the triangle set of original spherical mesh for each subdivision region. During the locating stage, we firstly find the subdivision region containing the query point p and select the corresponding representation triangle as the start one to walk. Then the barycentric coordinates are used to extract local heuristic information about the location of p, so as to find the shortest path from the start triangle to the target one. In comparison with traditional algorithms, our approach has better time-space performance.

[1]  Hans-Peter Seidel,et al.  A Shrink Wrapping Approach to Remeshing Polygonal Surfaces , 1999, Comput. Graph. Forum.

[2]  Hugues Hoppe,et al.  Spherical parametrization and remeshing , 2003, ACM Trans. Graph..

[3]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[4]  Hans-Peter Seidel,et al.  Progressive transmission of subdivision surfaces , 2000, Comput. Geom..

[5]  Günther Greiner,et al.  Remeshing triangulated surfaces with optimal parameterizations , 2001, Comput. Aided Des..

[6]  David Salesin,et al.  Interactive multiresolution surface viewing , 1996, SIGGRAPH.

[7]  Paul R. Schrater,et al.  Extensible point location algorithm , 2003, 2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings.

[8]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..