Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^3: Algorithm: point with N distance of a line between two other points

by Limbic~Region (Chancellor)
on Nov 04, 2010 at 02:05 UTC ( #869385=note: print w/replies, xml ) Need Help??


in reply to Re^2: Algorithm: point with N distance of a line between two other points
in thread Algorithm: point with N distance of a line between two other points

japhy,
The shortest distance between two points on a sphere (forget that Earth is squished a bit) is the arc of the great circle passing between those two points so you may have reason for concern. You should read this and this (Cross-track distance). You may find that treating the surface of the sphere as a flat plane acceptable if your talking about a small enough area - otherwise, you need non-planar math.

Regarding your statement about MySQL query - I assume have no idea what built-in trig functions are available and I don't envy re-implementing them from scratch. If this were Pg, you could just use plperl and use the module that did what you wanted :-)

Cheers - L~R

  • Comment on Re^3: Algorithm: point with N distance of a line between two other points

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (5)
As of 2020-07-03 19:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?