Spatial Hashing

Spatial Hashing is a spatial partitioning method that maps multidimensional spatial data into a one-dimensional hash table using discrete spatial bins, enabling efficient proximity queries and collision detection by uniquely encoding geographic or geometric coordinates into hash keys.

44

Publications

2.7K

Citations

132

Authors

62

Institutions

Publications per year

2017–2026

12

Authors

132

  1. CV
    Chinya V. Ravishankar

    University of California, Riverside, United States

    4 publications · 327 citations

    4

    h-index

  2. SL
    Sylvain Lefèbvre

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 277 citations

    4

    h-index

  3. SR
    Sylvia Ratnasamy

    University of California, Berkeley, United States

    2 publications · 186 citations

    2

    h-index

  4. MT
    Min Tang

    Zhejiang University, China

    2 publications · 117 citations

    2

    h-index

  5. AL
    Anthony LaMarca

    Intel (United States), United States

    2 publications · 186 citations

    2

    h-index

1–5 of 132

Venues

  1. ACM Transactions on Graphics

    TOG · 3 publications · 285 citations

    3

    h-index

  2. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 2 publications · 43 citations

    2

    h-index

  3. Computer Graphics Forum

    2 publications · 188 citations

    2

    h-index

  4. Pattern Recognition Letters

    1 publications · 11 citations

    1

    h-index

  5. ACM SIGMOD Record

    1 publications · 70 citations

    1

    h-index

1–5