Package org.locationtech.jts.noding
Interface SegmentSetMutualIntersector
-
- All Known Implementing Classes:
MCIndexSegmentSetMutualIntersector
,SimpleSegmentSetMutualIntersector
public interface SegmentSetMutualIntersector
An intersector for the red-blue intersection problem. In this class of line arrangement problem, two disjoint sets of linestrings are intersected.Implementing classes must provide a way of supplying the base set of segment strings to test against (e.g. in the constructor, for straightforward thread-safety).
In order to allow optimizing processing, the following condition is assumed to hold for each set:
- the only intersection between any two linestrings occurs at their endpoints.
- Version:
- 1.10
- Author:
- Martin Davis
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description void
process(java.util.Collection segStrings, SegmentIntersector segInt)
Computes the intersections with a given set ofSegmentString
s, using the suppliedSegmentIntersector
.
-
-
-
Method Detail
-
process
void process(java.util.Collection segStrings, SegmentIntersector segInt)
Computes the intersections with a given set ofSegmentString
s, using the suppliedSegmentIntersector
.- Parameters:
segStrings
- a collection ofSegmentString
s to nodesegInt
- the intersection detector to either record intersection occurrences or add intersection nodes to the input segment strings.
-
-