Planar Point Location is a computational geometry problem that involves determining the region or cell in a planar subdivision containing a given query point, distinguished from other point location problems by its restriction to two-dimensional Euclidean space and polygonal partitioning structures.
69
Publications
3.1K
Citations
93
Authors
61
Institutions
Publications per year
2017–2026
1
Parents
Publications
69
A New Approach to Planar Point Location
Franco P. Preparata · SIAM Journal on Computing · 1981 · 124 citations · Full text
Geometric separator theorems and applications
Warren D. Smith, N. C. Wormald · 2002 · 104 citations
1–5 of 69
Authors
93
- RT
7
h-index
- MS
5
h-index
- DM
5
h-index
- MT
5
h-index
- TMTheocharis Malamatos
University of Maryland, College Park, United States
5 publications · 142 citations
5
h-index
1–5 of 93
Institutions
61
New York University
New York, United States
8 h-index
9 publications
434 citations
Tel Aviv University
Tel Aviv, Israel
7 h-index
12 publications
434 citations
Brown University
Providence, United States
7 h-index
8 publications
275 citations
University of Maryland, College Park
College Park, United States
5 h-index
5 publications
142 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
6 publications
218 citations
Duke University
Durham, United States
5 h-index
5 publications
207 citations
Courant Institute of Mathematical Sciences
New York, United States
5 h-index
6 publications
185 citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
5 h-index
10 publications
439 citations
1–8 of 61
Venues
- SIAM Journal on Computing
12 publications · 906 citations
12
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 3 publications · 56 citations
4
h-index
- ACM Journal of Experimental Algorithmics
JEA · 2 publications · 51 citations
2
h-index
- Computational Geometry
2 publications · 74 citations
2
h-index
- Journal of Algorithms
1 publications · 36 citations
1
h-index
1–5