Randomized Point Location
Randomized Point Location is a randomized geometric algorithm that solves the point location problem by using probabilistic hierarchies, typically through a history graph or conflict history structure, to efficiently determine the containing cell of a query point within a decomposition of space, distinguished from deterministic counterparts by its expected logarithmic query time under random sampling of insertions or refinements.
6
Publications
291
Citations
9
Authors
9
Institutions
Publications per year
2017–2026
0
6
1–5 of 6
9
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 9
9
Los Alamos National Laboratory
Los Alamos, United States
2 h-index
6 publications
579 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
47 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
1 publications
19 citations

Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
19 citations

Urbana University
Urbana, United States
1 h-index
1 publications
19 citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
19 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
22 citations
University of Chicago
Chicago, United States
1 h-index
1 publications
22 citations
1–8 of 9
1 publications · 19 citations
1
h-index
1 publications · 47 citations
1
h-index
1 publications · 42 citations
1
h-index
1 publications · 10 citations
1
h-index
1–4