Extensible point location algorithm

R. Sundareswara, Paul R Schrater

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages84-89
Number of pages6
ISBN (Electronic)0769519857, 9780769519852
DOIs
StatePublished - Jan 1 2003
Event2003 International Conference on Geometric Modeling and Graphics, GMAG 2003 - London, United Kingdom
Duration: Jul 16 2003Jul 18 2003

Publication series

NameProceedings - 2003 International Conference on Geometric Modeling and Graphics, GMAG 2003

Other

Other2003 International Conference on Geometric Modeling and Graphics, GMAG 2003
CountryUnited Kingdom
CityLondon
Period7/16/037/18/03

Keywords

  • Cities and towns
  • Computer displays
  • Computer science
  • Data engineering
  • Data mining
  • Data structures
  • Lattices
  • Shape
  • Software packages
  • Solid modeling

Fingerprint Dive into the research topics of 'Extensible point location algorithm'. Together they form a unique fingerprint.

Cite this