Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^4: Lookup closest hash key

by LanX (Cardinal)
on Jan 25, 2011 at 14:41 UTC ( #884125=note: print w/replies, xml ) Need Help??


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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://884125]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (7)
As of 2021-01-17 10:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?