Home | Trees | Indices | Help |
|
---|
|
Ellipsoidal, Karney-based geodesy.
Ellipsoidal geodetic (lat-/longitude) LatLon and geocentric (ECEF) Cartesian classes and ellipsoidal functions areaOf, intersections2, isclockwise, nearestOn and perimeterOf, all requiring Charles Karney's geographiclib Python package to be installed.
Here's an example usage of ellipsoidal.karney
:
>>> from pygeodesy3.ellipsoidal.karney import LatLon >>> Newport_RI = LatLon(41.49008, -71.312796) >>> Cleveland_OH = LatLon(41.499498, -81.695391) >>> Newport_RI.distanceTo(Cleveland_OH) 866,455.4329098687 # meter
You can change the ellipsoid model used by the Karney formulae as follows:
>>> from pygeodesy3 import Datums >>> from pygeodesy3.ellipsoidal.karney import LatLon >>> p = LatLon(0, 0, datum=Datums.OSGB36)
or by converting to anothor datum:
>>> p = p.toDatum(Datums.OSGB36)
Version: 24.02.21
Classes | |
Cartesian Extended to convert Karney -based Cartesian to Karney -based LatLon points.
|
|
LatLon An ellipsoidal LatLon similar to ellipsoidal.vincenty.LatLon but using Charles F. F. Karney's Python geographiclib to compute geodesic distances, bearings (azimuths), etc. |
Functions | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Variables | |
__all__ = _ALL_LAZY.ellipsoidal_karney
|
Function Details |
Compute the intersections of a circle and a geodesic given as two points or as a point and (forward) bearing.
See Also:
Method |
Check whether a polygon encloses a pole.
|
Compute the area of an (ellipsoidal) polygon or composite.
Notes:
See Also: Functions pygeodesy3.areaOf, ellipsoidal.exact.areaOf, ellipsoidal.solve.areaOf, spherical.nvector.areaOf and spherical.trigonometry.areaOf. |
Iteratively compute the intersection point of two lines, each defined by two (ellipsoidal) points or by an (ellipsoidal) start point and an (initial) bearing from North.
Note:
For each line specified with an initial bearing, a pseudo-end point
is computed as the See Also: The ellipsoidal case and Karney's paper, pp 20-21, section 14. MARITIME BOUNDARIES for more details about the iteration algorithm. |
Iteratively compute the intersection points of two circles, each defined by an (ellipsoidal) center point and a radius.
See Also: The ellipsoidal case, Karney's paper, pp 20-21, section 14. MARITIME BOUNDARIES, circle-circle and sphere-sphere intersections. |
Determine the direction of a path or polygon.
Note: This function requires the geographiclib package. See Also: pygeodesy3.isclockwise. |
Iteratively locate the closest point on the geodesic between two other (ellipsoidal) points.
See Also: The ellipsoidal case and Karney's paper, pp 20-21, section 14. MARITIME BOUNDARIES for more details about the iteration algorithm. |
Compute the perimeter of an (ellipsoidal) polygon or composite.
Note: This function requires the geographiclib package. See Also: Functions perimeterOf, ellipsoidal.exact.perimeterOf, ellipsoidal.solve.perimeterOf, spherical.nvector.perimeterOf and spherical.trigonometry.perimeterOf. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Mon Mar 4 16:45:44 2024 | http://epydoc.sourceforge.net |