Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

WEA
2010
Springer

favoriteEmaildiscussreport

280views Algorithms» more WEA 2010»

Practical Nearest Neighbor Search in the Plane

13 years 11 months ago

Practical Nearest Neighbor Search in the Plane

Download compgeom.com

This paper shows that using some very simple practical assumptions, one can design an algorithm that ﬁnds the nearest neighbor of a given query point in O(log n) time in theory and faster than the state of the art in practice. The algorithm and proof are both simple and the experimental results clearly show that we can beat the state of the art on most distributions in two dimensions.

Michael Connor, Piyush Kumar

Real-time Traffic

Algorithms | Nearest Neighbor | Query Point | Simple Practical Assumptions | WEA 2010 |

claim paper

Related Content

» An Investigation of Practical Approximate Nearest Neighbor Algorithms

» Analysis of approximate nearest neighbor searching with clustered point sets

» NNH Improving Performance of NearestNeighbor Searches Using Histograms

» Quality and efficiency in high dimensional nearest neighbor search

» A Cost Model For Nearest Neighbor Search in HighDimensional Data Space

» Nearest Neighbor Search with Strong Location Privacy

» Expectedcase complexity of approximate nearest neighbor searching

» Fast k Nearest Neighbor Search using GPU

» Finding nearest neighbors in growthrestricted metrics

Post Info
More Details (n/a)

Added	18 May 2010
Updated	18 May 2010
Type	Conference
Year	2010
Where	WEA
Authors	Michael Connor, Piyush Kumar

Comments (0)