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.

Implementations can take advantage of this fact to optimize processing (i.e. by avoiding testing for intersections between linestrings belonging to the same set).

Version:

1.10

Author:

Martin Davis

Method Summary

Modifier and Type	Method	Description
void	process(java.util.Collection segStrings, SegmentIntersector segInt)	Computes the intersections with a given set of SegmentStrings, using the supplied SegmentIntersector.

Method Detail

process

void process(java.util.Collection segStrings,
             SegmentIntersector segInt)

Computes the intersections with a given set of SegmentStrings, using the supplied SegmentIntersector.

Parameters:

segStrings - a collection of SegmentStrings to node

segInt - the intersection detector to either record intersection occurrences or add intersection nodes to the input segment strings.