GEOS 3.11.1
|
An intersector for the red-blue intersection problem. More...
#include <SegmentSetMutualIntersector.h>
Public Member Functions | |
void | setSegmentIntersector (SegmentIntersector *si) |
virtual void | setBaseSegments (SegmentString::ConstVect *segStrings)=0 |
virtual void | process (SegmentString::ConstVect *segStrings)=0 |
Protected Attributes | |
SegmentIntersector * | segInt |
An intersector for the red-blue intersection problem.
In this class of line arrangement problem, two disjoint sets of linestrings are provided. It is assumed that within each set, no two linestrings intersect except possibly at their endpoints. Implementations can take advantage of this fact to optimize processing.
|
pure virtual |
Computes the intersections for two collections of SegmentStrings.
segStrings | a collection of SegmentStrings to node |
Implemented in geos::noding::MCIndexSegmentSetMutualIntersector.
|
pure virtual |
segStrings | a collection of SegmentStrings to node |
Implemented in geos::noding::MCIndexSegmentSetMutualIntersector.
|
inline |
Sets the SegmentIntersector to use with this intersector. The SegmentIntersector will either record or add intersection nodes for the input segment strings.
si | the segment intersector to use |