19 #ifndef GEOS_NODING_INTERSECTIONFINDERADDER_H 20 #define GEOS_NODING_INTERSECTIONFINDERADDER_H 41 class LineIntersector;
65 std::vector<geom::Coordinate>& v)
68 interiorIntersections(v)
81 void processIntersections(
85 std::vector<geom::Coordinate>&
88 return interiorIntersections;
114 #endif // GEOS_NODING_INTERSECTIONFINDERADDER_H Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes...
std::vector< geom::Coordinate > & getInteriorIntersections()
An interface for classes which represent a sequence of contiguous line segments.
IntersectionFinderAdder(algorithm::LineIntersector &newLi, std::vector< geom::Coordinate > &v)
Creates an intersection finder which finds all proper intersections and stores them in the provided C...
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
algorithm::LineIntersector & li
bool isDone() const override
Basic namespace for all GEOS functionalities.
Processes possible intersections detected by a Noder.
std::vector< geom::Coordinate > & interiorIntersections