DocumentCode
1843254
Title
Extensible point location algorithm
Author
Sundareswara, Rashmi ; Schrater, Paul
Author_Institution
Dept. of Comput. Sci. & Eng., Minnesota Univ., Minneapolis, MN, USA
fYear
2003
fDate
16-18 July 2003
Firstpage
84
Lastpage
89
Abstract
We present a general walkthrough 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.
Keywords
computational complexity; computational geometry; computer graphics; feature extraction; barycentric coordinate; barycentric polyhedra; general polyhedron lattice; gradient descent; local information extraction; nonhomogenous mesh; polygonal mesh; polyhedra storage; polyhedral lattice; query point location; walkthrough algorithm; Cities and towns; Computer displays; Computer science; Data engineering; Data mining; Data structures; Lattices; Shape; Software packages; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Geometric Modeling and Graphics, 2003. Proceedings. 2003 International Conference on
Print_ISBN
0-7695-1985-7
Type
conf
DOI
10.1109/GMAG.2003.1219670
Filename
1219670
Link To Document