Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/GMAG.2003.1219670 | 2003 INTERNATIONAL CONFERENCE ON GEOMETRIC MODELING AND GRAPHICS, PROCEEDINGS |
Keywords | Field | DocType |
computational complexity,data structures,data engineering,feature extraction,computational geometry,computer graphics,data mining,point location,shape,solid modeling,data structure,computer science,lattices,gradient descent | Data structure,Polygon,Gradient descent,Linked list,Point location,Computer science,Computational geometry,Polyhedron,Algorithm,Theoretical computer science,Software walkthrough | Conference |
Citations | PageRank | References |
2 | 0.37 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rashmi Sundareswara | 1 | 31 | 5.11 |
| Paul R. Schrater | 2 | 141 | 22.71 |