On Nov 17, 7:09 am, Tiago Reul <[email protected]> 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?
The standard solution to this problem is to use a Voronoi diagram. I am only familiar with the Euclidean version but I see no problem constructing a Voronoi diagram on the surface of a sphere. Ralph Boland -- 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=.
