On Nov 17, 9:09 am, Tiago Reul <tiagor...@gmail.com> wrote: > 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?
This is called ... wait for it ... the "nearest neighbor search" problem. Plug that into your favorite search engine. You'll get some of the solutions already presented here and quite a few more. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=.
