Point Location Structures
Point Location Structures is a geometric data structure designed to efficiently determine the region or cell containing a given query point within a spatially partitioned space, distinguished from other spatial partitioning methods by its focus on optimizing point-in-region queries in planar or higher-dimensional subdivisions.
21
Publications
645
Citations
42
Authors
28
Institutions
Publications per year
2017–2026
1
21
David Eppstein, Michael T. Goodrich, J. Z. Sun · 2005 · 90 citations
Point location in fat subdivisions
Mark H. Overmars · Information Processing Letters · 1992 · 78 citations · Full text
The design and implementation of panar maps in CGAL
Eyal Flato, Dan Halperin, Iddo Hanniel et al. · ACM Journal of Experimental Algorithmics · 2000 · 40 citations
1–5 of 21
42
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 42
28
New York University
New York, United States
2 h-index
2 publications
28 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
4 publications
51 citations
University of California, Irvine
Irvine, United States
2 h-index
5 publications
318 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
3 publications
170 citations
Brown University
Providence, United States
2 h-index
4 publications
138 citations
University of Maryland, College Park
College Park, United States
2 h-index
2 publications
55 citations
IBM Research - Almaden
San Jose, United States
1 h-index
1 publications
33 citations

University of Applied Sciences and Arts of Southern Switzerland
Manno, Switzerland
1 h-index
1 publications
10 citations
1–8 of 28
IJCGA · 3 publications · 61 citations
3
h-index
JEA · 2 publications · 72 citations
2
h-index
1 publications · 15 citations
1
h-index
1 publications · 46 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5