Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 23, 1994

An optimal algorithm for approximate nearest neighbor searching

View Full Paper
Ask AI
Bookmark
Share

Authors

SASunil AryaHong Kong University of Science and TechnologyDMDavid M. MountUniversity of Maryland, College ParkNNNathan S. NetanyahuBar-Ilan University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Arya et al. (1994) studied this question.

synapsesocial.com/papers/6a0ec2bcaa1655e5fb22c2cfhttps://doi.org/10.5555/314464.314652
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Approximate nearest neighbor queries in fixed dimensions1993 · 308 citations
  2. 2A general approach to d-dimensional geometric queries1985 · 144 citations
  3. 3A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields1995 · 550 citations
  4. 4An optimal algorithm for the on-line closest-pair problem1992 · 17 citations