pyinterp.geometry.geographic.algorithms.convex_hull#
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.Point, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon#
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.Segment, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.Box, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.LineString, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.Ring, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.Polygon, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.MultiPoint, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.MultiLineString, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
- pyinterp.geometry.geographic.algorithms.convex_hull(geometry: pyinterp.core.geometry.geographic.MultiPolygon, spheroid: pyinterp.core.geometry.geographic.Spheroid | None = None, strategy: pyinterp.core.geometry.geographic.algorithms.Strategy = Strategy.ANDOYER) pyinterp.core.geometry.geographic.Polygon
Calculates the convex hull of a geometry.
The convex hull is the smallest convex geometry that contains all points of the input geometry. It is always returned as a Polygon.
- Parameters:
geometry – Geometric object.
spheroid – Optional spheroid for geodetic calculations. If not provided, uses WGS84 ellipsoid.
strategy – Calculation strategy.
- Returns:
A Polygon representing the convex hull.