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

Authors

9

  1. EP
    Ernst P. Mücke

    University of Illinois Urbana-Champaign, United States

    2 publications · 193 citations

    2

    h-index

  2. BZ
    Binhai Zhu

    Montana State University, United States

    2 publications · 193 citations

    2

    h-index

  3. IS
    Isaac Saias

    Los Alamos National Laboratory, United States

    2 publications · 193 citations

    2

    h-index

  4. MP
    Mihai Ptraşcu

    Massachusetts Institute of Technology, United States

    1 publications · 47 citations

    1

    h-index

  5. KM
    Ketan Mulmuley

    University of Chicago, United States

    1 publications · 22 citations

    1

    h-index

1–5 of 9

Venues

  1. Discrete & Computational Geometry

    1 publications · 19 citations

    1

    h-index

  2. SIAM Journal on Computing

    1 publications · 47 citations

    1

    h-index

  3. Computational Geometry

    1 publications · 42 citations

    1

    h-index

  4. Discrete Applied Mathematics

    1 publications · 10 citations

    1

    h-index

1–4