Class PartitionedUnion
java.lang.Object
org.locationtech.jts.operation.union.PartitionedUnion
Unions a set of polygonal geometries by partitioning them
into connected sets of polygons.
This works best for a sparse set of polygons.
Sparse means that if the geometries are partioned
into connected sets, the number of sets
is a significant fraction of the total number of geometries.
The algorithm used provides performance and memory advantages
over the
CascadedPolygonUnion
algorithm.
It also has the advantage that it does not alter input geometries
which do not intersect any other input geometry.
Non-sparse sets are computed correctly, but may be slower than using cascaded union.
- Author:
- Martin Davis
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
PartitionedUnion
-
-
Method Details
-
union
-
union
-