func.ST_SetEffectiveArea
Sets the effective area for each vertex, using the Visvalingam-Whyatt algorithm
Sets the effective area for each vertex, using the Visvalingam-Whyatt algorithm
Returns a "simplified" version of the given geometry using the Visvalingam-Whyatt algorithm
Simplifies a geometry by removing points that would fall within a specified distance tolerance.
Returns a "simplified" version of the given geometry using the Douglas-Peucker algorithm
Returns a collection containing paths shared by the two input geometries
Creates a GeometryCollection containing the polygons formed by the constituent linework of a set of geometries
Returns a POINT guaranteed to intersect a surface
Return an offset line at a given distance and side from an input line
Returns the smallest circle polygon that contains a geometry
Return the Delaunay triangulation of the vertices of the input geometry
Computes the convex hull of a geometry. The convex hull is the smallest convex geometry that encloses all geometries in the input
The concave hull of a geometry represents a possibly concave geometry that encloses the input geometry
Computes a point which is the geometric center of mass of a geometry
Creates an areal geometry formed by the constituent linework of the input geometry
Returns a geometry/geography that represents all points whose distance from this Geometry/geography is less than or equal to distance
Aggregate. Constructs an array of geometries