geoid_direct#

pycraf.pathprof.geoid_direct(lon1, lat1, bearing1, dist, eps=1e-12, maxiter=50)[source]#

Solve direct Geodesics problem using Vincenty’s formulae.

From starting point P1, given a start bearing, find point P2 located at a certain distance from P1 on the Geoid (Earth ellipsoid). As for the inverse problem, an iterative approach is used; see also Wikipedia.

Parameters:
lon1Quantity

Geographic longitude of P1 [rad]

lat1Quantity

Geographic latitude of P1 [rad]

bearing1Quantity

Start bearing [rad]

distanceQuantity

Distance between P1 and P2 [m]

epsfloat, optional

Accuracy of calculation (default: 1.e-12)

maxiterint, optional

Maximum number of iterations to perform (default: 50)

Returns:
lon2Quantity

Geographic longitude of P2 [rad]

lat2Quantity

Geographic latitude of P2 [rad]

bearing2Quantity

Back-bearing [rad]

Notes

The iteration will stop if either the desired accuracy (eps) is reached or the number of iterations exceeds maxiter.