Proximity Data Structures
Proximity Data Structures is a geometric data structure designed to organize spatial data in a way that enables efficient query and retrieval of geometric objects based on their relative closeness or distance relationships in metric space.
74
Publications
5.8K
Citations
131
Authors
78
Institutions
Publications per year
2017–2026
6
Variants
Spatial Proximity Data Structures
Parents
74
Shmuel Sattath, Amos Tversky · Psychometrika · 1977 · 601 citations
Near Neighbor Search in Large Metric Spaces
Sergey Brin · 1995 · 556 citations
Navigating nets: simple algorithms for proximity search
Robert Krauthgamer, James R. Lee · 2015 · 319 citations
Fast distance queries with rectangular swept sphere volumes
Eric Larsen, S. Gottschalk, Ming C. Lin et al. · 2002 · 277 citations
1–5 of 74
131
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 131
78
University of Maryland, College Park
College Park, United States
4 h-index
4 publications
98 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
177 citations
University of Chile
Santiago, Chile
3 h-index
3 publications
394 citations
Stanford University
Stanford, United States
3 h-index
3 publications
237 citations
University of Almería
Almería, Spain
3 h-index
3 publications
384 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
3 publications
124 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
5 publications
881 citations
IBM Research - Almaden
San Jose, United States
3 h-index
3 publications
374 citations
1–8 of 78
3 publications · 345 citations
3
h-index
Conference · 2 publications · 56 citations
2
h-index
2 publications · 180 citations
2
h-index
2 publications · 42 citations
2
h-index
2 publications · 147 citations
2
h-index
1–5