@inproceedings{984fdd0e76144869a2dc5d5daecc1685,
title = "Extensible point location algorithm",
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 = "Cities and towns, Computer displays, Computer science, Data engineering, Data mining, Data structures, Lattices, Shape, Software packages, Solid modeling",
author = "R. Sundareswara and Schrater, {Paul R}",
year = "2003",
month = jan,
day = "1",
doi = "10.1109/GMAG.2003.1219670",
language = "English (US)",
series = "Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "84--89",
booktitle = "Proceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003",
note = "2003 International Conference on Geometric Modeling and Graphics, GMAG 2003 ; Conference date: 16-07-2003 Through 18-07-2003",
}