comp.lang.idl-pvwave archive: archive » Fastest Nearest Neighbor Calculation

Home » Public Forums » archive » Fastest Nearest Neighbor Calculation

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Fastest Nearest Neighbor Calculation [message #47237]

Sat, 28 January 2006 13:57

lefsky
Messages: 8
Registered: April 2002

Junior Member

I need to find (within a dataset of points with x,y coordinates) pairs
of points that are closer than a given threshold to each other. Simple
problem- unless you have hundreds of thousands to millions of points to
evaluate. My plan is to first seperate all the points into slightly
overlapping grid cells, and evaluate the set of points within each grid
cell seperately, thus decreasing the total number of comparisons. Other
than that, I don't have a strategy to improve the actual comparison of
points. Has anyone looked at this problem? Is there a clever vector
method I could use?

M

Report message to a moderator

[Message index]

Fastest Nearest Neighbor Calculation

By: lefsky on Sat, 28 January 2006 13:57

Previous Topic:	Linux Help Needed
Next Topic:	calling another directory within program

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 19:19:31 PDT 2025

Total time taken to generate the page: 0.00421 seconds