try searching "Manhattan Distance"
On Wednesday, April 25, 2012 11:10:38 AM UTC+5:30, tech coder wrote: > > Given N points(in 2D) with x and y coordinates. You have to find a > point P (in N given points) such that the sum of distances from > other(N-1) points to P is minimum. > > -- > > Regards > "The Coder" > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/c6A-nORKUFwJ. To post to this group, send email to algogeeks@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=en.
