Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

GMP
2003
IEEE

favoriteEmaildiscussreport

96views Solid Modeling» more GMP 2003»

Extensible Point Location Algorithm

13 years 9 months ago

Extensible Point Location Algorithm

Download gandalf.psych.umn.edu

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.

Rashmi Sundareswara, Paul R. Schrater

Real-time Traffic

General Polyhedron Lattices | GMP 2003 | Simple Linked List | Walk-through Point Location |

claim paper

Related Content

» The Power of Priority Algorithms for Facility Location and Set Cover

» New Algorithms for kCenter and Extensions

» LOC8 A Location Model and Extensible Framework for Programming with Location

» Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms

» Index for fast retrieval of uncertain spatial point data

» Feedlinks for network extensions

» A hybrid multistart heuristic for the uncapacitated facility location problem

» Locating internet bottlenecks algorithms measurements and implications

» A Note on Point Location in Delaunay Triangulations of Random Points

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	GMP
Authors	Rashmi Sundareswara, Paul R. Schrater

Comments (0)