[Closed] Google Maps, how can I get (there)? $40

[Beja]

This is small project. lat1, lon1 moves towards lat2, lon2. straight line.. but lat2, lon2 is moving around and point lat1, lon1 must recalculate contentiously until lat1, lon1 = lat2, lon2 (or very close to it. Remaining distance in meters to be logged every 1 second.

 

[jamesnz]

This is small project. lat1, lon1 moves towards lat2, lon2. straight line.. but lat2, lon2 is moving around and point lat1, lon1 must recalculate contentiously until lat1, lon1 = lat2, lon2 (or very close to it. Remaining distance in meters to be logged every 1 second.

From memory,In the location sensor library there is a function called distanceto and another called degreesto.
Or you could do it manually using the "haversine" formula which is OK for short distances

 

[Declan]

You could also use the Greater Circle algorithm, I have used this extensively in GPS based fleet management products.