Hi,
Have a look at kd-trees.
Regards
Aditya Shankar
2009/11/17 Tiago Reul <[email protected]>
> Suppose that you have the position of each person in the world.
> Position is the pair (latitude, longitude).
>
> How to represent the data so that I can find the nearest person
> from a point (φ,λ) without comparing to every pair in the collection?
>
> --
>
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected]<algogeeks%[email protected]>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=.
>
>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=.
