[Purdue-pm] Mark's Travelling Capital Problem

[Bradley Andersen]

I haven't even seen this problem, but I will tell you this: I recently
needed to find distances between zip codes, and the great circle
formula was *helpful*, but not *super* helpful.  It seems to break
down at short distances.  I ended up using those values along with
another algo (forget, but could look it up) and weighting them to get
good short distances.



On Fri, Feb 18, 2011 at 9:31 AM, Joe Kline <gizmo at purdue.edu> wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> It took me longer than I thought to find the lat/long for the state
> capitals.
>
> There is a thread on perlmongers that points to Math::Trig for
> calculating great circle distance.
>
> I just haven't made the time to calculate the longest route (the easier
> of the two I think).
>
> Shortest is the tougher one by far.
>
> joe
> -----BEGIN PGP SIGNATURE-----
> Version: GnuPG v1.4.5 (GNU/Linux)
> Comment: Using GnuPG with Red Hat - http://enigmail.mozdev.org/
>
> iD8DBQFNXoKxb0mzA2gRTpkRAi94AJ9chsRcC5HyLBXn61UphBrudjQnWwCfYzs7
> H+NNdVrNEL0BVY4BN15DzEc=
> =l59C
> -----END PGP SIGNATURE-----
> _______________________________________________
> Purdue-pm mailing list
> Purdue-pm at pm.org
> http://mail.pm.org/mailman/listinfo/purdue-pm
>