Optimal Point Location
Optimal Point Location is a computational geometry method that, as a specialization of point location algorithms, minimizes the worst-case or average query time to logarithmic or constant bounds while ensuring space complexity remains linear or near-linear in the number of subdivisions.
320
Publications
16.7K
Citations
914
Authors
430
Institutions
Publications per year
2017–2026
68
Parents
320
914
9
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 914
430

California State University, Fullerton
Fullerton, United States
6 h-index
7 publications
357 citations

McMaster University
Hamilton, Canada
5 h-index
5 publications
245 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
145 citations
Yonsei University
Seoul, South Korea
4 h-index
18 publications
513 citations

Johns Hopkins University
Baltimore, United States
4 h-index
9 publications
672 citations
Northwestern University
Evanston, United States
4 h-index
6 publications
338 citations
Virginia Tech
Blacksburg, United States
4 h-index
7 publications
172 citations

Universidad de Jaén
Jaén, Spain
4 h-index
11 publications
523 citations
1–8 of 430
11 publications · 922 citations
11
h-index
8 publications · 724 citations
8
h-index
7 publications · 686 citations
7
h-index
6 publications · 162 citations
6
h-index
4 publications · 177 citations
4
h-index
1–5