Module geo::algorithm

source ·
Expand description

This module includes all the functions of geometric calculations

Re-exports

Modules

  • Composable affine operations such as rotate, scale, skew, and translate
  • Calculate the area of the surface of a Geometry.
  • Calculate the bearing to another Point, in degrees.
  • Boolean Ops such as union, xor, difference;
  • Calculate the bounding rectangle of a Geometry.
  • Calculate the centroid of a Geometry.
  • Smoothen LineString, Polygon, MultiLineString and MultiPolygon using Chaikins algorithm.
  • Calculate the signed approximate geodesic area of a Geometry.
  • Calculate the closest Point between a Geometry and an input Point.
  • Calculate the concave hull of a Geometry.
  • Determine whether Geometry A completely encloses Geometry B.
  • Convert the type of a geometry’s coordinate value.
  • Calculate the convex hull of a Geometry.
  • Determine whether a Coord lies inside, outside, or on the boundary of a geometry.
  • Iterate over geometry coordinates.
  • Densify linear geometry components
  • Dimensionality of a geometry and its boundary, based on OGC-SFA.
  • Calculate the minimum Euclidean distance between two Geometries.
  • Calculate the length of a planar line between two Geometries.
  • Calculate the extreme coordinates and indices of a geometry.
  • Calculate the Frechet distance between two LineStrings.
  • Calculate the Geodesic area and perimeter of polygons.
  • Calculate the bearing to another Point on a geodesic.
  • Returns a new Point using a distance and bearing on a geodesic.
  • Calculate the Geodesic distance between two Points.
  • Calculate a new Point lying on a Geodesic arc between two Points.
  • Calculate the Geodesic length of a line.
  • Calculate a destination Point, given a distance and a bearing.
  • Calculate the Haversine distance between two Geometries.
  • Calculate a new Point lying on a Great Circle arc between two Points.
  • Calculate the Haversine length of a Line.
  • Calculate a representative Point inside a Geometry
  • Determine whether Geometry A intersects Geometry B.
  • Determines whether a LineString is convex.
  • Calculate concave hull using k-nearest algorithm
  • Kernels to compute various predicates
  • Interpolate a point along a Line or LineString.
  • Computes the intersection of two Lines.
  • Locate a point along a Line or LineString.
  • Iterate over the lines in a geometry.
  • Apply a function to all Coords of a Geometry.
  • Calculate the minimum rotated rectangle of a Geometry.
  • Orient a Polygon’s exterior and interior rings.
  • Detect outliers in a group of points using LOF
  • Relate two geometries based on DE-9IM
  • Remove (consecutive) repeated points
  • Rotate a Geometry by an angle given in degrees.
  • Scale a Geometry up or down by a factor
  • Simplify Geometries using the Ramer-Douglas-Peucker algorithm.
  • Simplify Geometries using the Visvalingam-Whyatt algorithm. Includes a topology-preserving variant.
  • Skew a Geometry by shearing it at angles along the x and y dimensions
  • Planar sweep algorithm and related utils
  • Translate a Geometry along the given offsets.
  • Calculate the Vincenty distance between two Points.
  • Calculate the Vincenty length of a LineString.
  • Calculate and work with the winding order of Linestrings.
  • Determine whether Geometry A is completely within by Geometry B.

Traits