public class InteriorPointArea extends Object
This algorithm is a tradeoff between performance and point quality (where points further from the geometry boundary are considered to be higher quality) Priority is given to performance. This means that the computed interior point may not be suitable for some uses (such as label positioning).
The algorithm handles some kinds of invalid/degenerate geometry, including zero-area and self-intersecting polygons.
Empty geometry is handled by returning a
|Constructor and Description|
Creates a new interior point finder for an areal geometry.
|Modifier and Type||Method and Description|
Gets the computed interior point.
Computes an interior point for the polygonal components of a Geometry.
public InteriorPointArea(Geometry g)
g- an areal geometry
public static Coordinate getInteriorPoint(Geometry geom)
geom- the geometry to compute
nullif the geometry has no polygonal components
public Coordinate getInteriorPoint()
nullif the input geometry is empty
Copyright © 2020. All rights reserved.