Interior Point

Computes an interior point of a geometry (up to 2D). An interior point is guaranteed to lie in the interior of the geometry, if it is possible to calculate such a point exactly. Otherwise, the point may lie on the boundary of the geometry (e.g. if the geometry is a line).

Category: Geometric



Function ID: eu.esdihumboldt.cst.functions.geometric.interiorPoint

General explanation

The interior point algorithm finds an interior vertex which is closest to the centroid of the line string.

The interior point algorithm computes sections along a horizontal scan line in the interior of the polygon. The final interior point is the midpoint of the widest computed section in the interior of the polygon. For properties with multiple geometries, the interior point function selects the first geometry.
Source:JTS Technical Documentation