On 03/10/2013 08:14 PM, Luke Pebody wrote:
To each given point?
To one given point, you just calculate each of the distances and sort
them.
On Sun, Mar 10, 2013 at 11:42 AM, Registered user
<[email protected] <mailto:[email protected]>> wrote:
Problem statement :
Given N points of 2d Plane . you are required to find the k nearest
point to a given point.
After some search i came to know that i need to implement KD tree ,
but cannot understand how ??
Note: Efficient algorithm required , not Brute force .
so if anyone can help me plz ..
Thanks in advance :D
--
You received this message because you are subscribed to the Google
Groups "Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it,
send an email to [email protected]
<mailto:google-code%[email protected]>.
To post to this group, send email to [email protected]
<mailto:[email protected]>.
For more options, visit https://groups.google.com/groups/opt_out.
--
You received this message because you are subscribed to the Google
Groups "Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send
an email to [email protected].
To post to this group, send email to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
DBScan is popular data mining(specifically: clustering) algorithm.
Requires distance query: no. of points around a point within k-distant.
RTree is good for multi-dimensional data indexing and distance query.
Look for implementations of r-tree, variations of it r*, hilbert r-tree,
etc.
--
Regards,
Amit Gangrade
--
You received this message because you are subscribed to the Google Groups "Google
Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
