Tests if two geometries spatially intersect in 3D - only for points, linestrings, polygons, polyhedral surface (area).
Computes a geometry covering all points within a given distance from a geometry.
Tests if no points of B lie in the exterior of A, and A and B have at least one interior point in common.
Tests if B intersects the interior of A but not the boundary or exterior.
Tests if no point in A is outside B
Tests if no point in B is outside A
Tests if two geometries have some, but not all, interior points in common.
Tests if A and B are within a given distance.
Tests if two geometries are disjoint (they have no point in common).
Tests if two geometries include the same set of points.
Tests if two geometries intersect (they have at least one point in common).
Returns a number indicating the crossing behavior of two LineStrings.
Tests if two geometries represent the same geometry and have points in the same directional order.
Tests if two geometries intersect and have the same dimension, but are not completely contained by each other.
Computes Intersection Matrix of two geometries.
Computes Intersection Matrix of two geometries. The boundary node rule code is: 1: OGC/MOD2, 2: Endpoint, 3: MultivalentEndpoint, 4: MonovalentEndpoint.
Tests if two geometries have a topological relationship matching an Intersection Matrix pattern.
Tests if a DE-9IM Intersection Matrix matches an Intersection Matrix pattern
Returns a modified geometry having no segment longer than the given max_segment_length. Distance computation is
performed in 2d only. For geometry, length units are in units of spatial reference. For geography, units are in
meters.
Divides geometry into parts until a part can be represented using no more than max_vertices.
Tests if two geometries have at least one point in common, but their interiors do not intersect.
Tests if no points of A lie in the exterior of B, and A and B have at least one interior point in common.