http://www.perlmonks.org?node_id=884125


in reply to Re^3: Lookup closest hash key
in thread Lookup closest hash key

> Distances between cities is intrinsically a 2-dimensional problem.

My understanding was that the distances are calculated starting from a 0km origin, hence it's one dimensional.

And I'm not sure if Corion's suggestions can be easily applied to spherical distances...

Cheers Rolf