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

Authors

42

  1. JI
    John Iacono

    Université Libre de Bruxelles, Belgium

    3 publications · 41 citations

    3

    h-index

  2. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    3 publications · 146 citations

    3

    h-index

  3. DE
    David Eppstein

    University of California, Irvine, United States

    2 publications · 114 citations

    2

    h-index

  4. LA
    Lars Arge

    Aarhus University, Denmark

    2 publications · 64 citations

    2

    h-index

  5. JZ
    J. Z. Sun

    IBM (United States), United States

    2 publications · 114 citations

    2

    h-index

1–5 of 42

Venues

  1. 3

    h-index

  2. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 72 citations

    2

    h-index

  3. The Computer Journal

    1 publications · 15 citations

    1

    h-index

  4. Journal of Algorithms

    1 publications · 46 citations

    1

    h-index

  5. 1

    h-index

1–5