Home | Trees | Indices | Help |
|
---|
|
Ellipsoidal, Karney-based geodesy.
Ellipsoidal geodetic (lat-/longitude) LatLon and geocentric (ECEF) Cartesian classes and functions areaOf, intersections2, isclockwise, nearestOn and perimeterOf, all requiring Charles Karney's geographiclib Python package to be installed.
Here's an example usage of ellipsoidalKarney
:
>>> from pygeodesy.ellipsoidalKarney 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 pygeodesy import Datums >>> from pygeodesy.ellipsoidalKarney import LatLon >>> p = LatLon(0, 0, datum=Datums.OSGB36)
or by converting to anothor datum:
>>> p = p.toDatum(Datums.OSGB36)
Version: 21.12.30
Classes | |
Cartesian Extended to convert Karney -based Cartesian to Karney -based LatLon points.
|
|
LatLon An ellipsoidal LatLon similar to ellipsoidalVincenty.LatLon but using Charles F. F. Karney's Python geographiclib to compute the geodesic distance, initial and final bearing (azimuths) between two given points or the destination point given a start point and an (initial) bearing. |
Functions | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Variables | |
__all__ = _ALL_LAZY.ellipsoidalKarney
|
Function Details |
Check whether a polygon encloses a pole.
|
Compute the area of an (ellipsoidal) polygon.
Note: This function requires the geographiclib package. See Also: Functions pygeodesy.areaOf, ellipsoidalExact.areaOf, ellipsoidalGeodSolve.areaOf, sphericalNvector.areaOf and sphericalTrigonometry.areaOf. |
Interatively compute the intersection point of two paths, each defined by two (ellipsoidal) points or by an (ellipsoidal) start point and a bearing from North.
Note:
For each path 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: pygeodesy.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.
Note: This function requires the geographiclib package. See Also: Functions pygeodesy.perimeterOf, ellipsoidalExact.perimeterOf, ellipsoidalGeodSolve.perimeterOf, sphericalNvector.perimeterOf and sphericalTrigonometry.perimeterOf. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Wed May 4 16:33:49 2022 | http://epydoc.sourceforge.net |