Extensible point location algorithm

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

Volumn , Issue , 2003, Pages 84-89

  Sundareswara, R ^a   Schrater, P ^a  

^a University of Minnesota   (United States)

Author keywords

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

Indexed keywords

COMPUTER SCIENCE; CRYSTAL LATTICES; DATA MINING; DATA STRUCTURES; GEOMETRY; LOCATION; SOFTWARE PACKAGES;

CITIES AND TOWNS; COMPUTER DISPLAY; DATA ENGINEERING; SHAPE; SOLID MODEL;

ALGORITHMS;

EID: 24944547275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GMAG.2003.1219670     Document Type: Conference Paper

References (15)

1. P. Alliez, and M. Desbrun, "Progressive Compression for Lossless Transmission of Triangle Meshes". Proceedings from SIGGRAPH 2001, pages 195-202.
2. J.L. Bentley, B.W. Weide, and A.C Yao, "Optimal Expected Algorithms for Closest point problems", ACM Transactions on Mathematical Software,6(4):563-580, 1980.
3. H. S. M. Coxeter "Barycentric Coordinates". Introduction to Geometry, 2nd ed. New York: Wiley, pp. 216-221, 1969.
4. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry. Algorithms and Applications, Springer-Verlag Berlin Heidelberg, 1997
5. L. Devroye, E. Mucke, B. Zhu, "A note on Point Location of Delaunay Triangulation of Random Points". Algorithmica, 22(4): 477-482, Dec 1998.
6. L. Devroye, P. Bose, "Intersections with Random Geometric Objects". Manuscript, School Of Computer Science, McGill University, 1995
7. R.A Dwyer, "A fast divide and conquer algorithm for constructing Delauany Triangulations". Algorithmica 2:137-151, 1987
8. L. Guibas, J. Stolfi, "Randomized incremental construction of Delaunay and Voronoi Diagrams". Algorithmica 7:381-413, 1992.
9. L. Guibas, J. Stolfi, "Primitives for manipulation of general subdivisions and computation of Voronoi diagrams". ACM Transaction on Graphics, 4(2):75-123, 1985.
10. M. Hausner, A Vector Space Approach to Geometry, 1965
11. H. Hoppe, "Progressive Meshes", Proceedings ACM SIGGRAPH 1996, pp. 99-108, August 1996.
12. H. Hoppe, T. DeRose, T. Duchamp, J. MacDonald, W. Stuetzle, "Surface Reconstruction from Unorganized Points", Computer Graphics (SIGGRAPH 1992 Proceedings) 26(2):71-78,July 1992.
13. E. Mucke, I. Saias and B. Zhu (1996), "Fast Randomized Point Location Without Preprocessing in Two and Three-dimensional Delaunay Triangulations". Proceedings of the 12th Annual Symposium on Computational Geometry, pages 274-283, 1996
14. P. Su, R.L.S Drysdale, "A Comparision of Sequential Delaunay Triangulation Algorithms". Symposium of Computatinal Geometry, pages 61-70, 1995
15. P. Yiu "The Uses of Homogeneous Barycentric Coordinates in Plane Euclidean Geometry". International Journal Math. Ed. Sci. Tech. 31, 569-578, 2000