Parallel Geometric Searching

Parallel Geometric Searching is a computational framework within parallel geometric algorithms that specializes in the simultaneous querying of spatial data structures to efficiently determine the presence, location, or relationship of geometric objects across distributed or concurrent processing units.

30

Publications

1.7K

Citations

79

Authors

38

Institutions

Publications per year

2017–2026

4

Authors

79

  1. AA
    Alok Aggarwal

    IBM (United States), United States

    2 publications · 297 citations

    2

    h-index

  2. CY
    Chee Yap

    New York University, United States

    2 publications · 297 citations

    2

    h-index

  3. CÓ
    Colm Ó'Dúnlaing

    Courant Institute of Mathematical Sciences, United States

    2 publications · 297 citations

    2

    h-index

  4. BC
    Bernard Chazelle

    Princeton University, United States

    2 publications · 297 citations

    2

    h-index

  5. JW
    Jia Wang

    Umeå University, Sweden

    1 publications · 21 citations

    1

    h-index

1–5 of 79

Venues

  1. Algorithmica

    3 publications · 245 citations

    3

    h-index

  2. Proceedings of the International Conference on Parallel Processing

    Conference · 2 publications · 72 citations

    2

    h-index

  3. ACM Transactions on Mathematical Software

    TOMS · 1 publications · 26 citations

    1

    h-index

  4. GeoInformatica

    1 publications · 18 citations

    1

    h-index

  5. Computers & Geosciences

    CAGEO · 1 publications · 36 citations

    1

    h-index

1–5