19 #ifndef GEOS_NODING_ITERATEDNODER_H
20 #define GEOS_NODING_ITERATEDNODER_H
22 #include <geos/export.h>
27 #include <geos/inline.h>
29 #include <geos/algorithm/LineIntersector.h>
30 #include <geos/noding/SegmentString.h>
31 #include <geos/noding/Noder.h>
58 static const int MAX_ITER = 5;
63 std::vector<SegmentString*>* nodedSegStrings;
70 void node(std::vector<SegmentString*>* segStrings,
71 int& numInteriorIntersections,
102 std::vector<SegmentString*>*
105 return nodedSegStrings;
118 void computeNodes(std::vector<SegmentString*>* inputSegmentStrings)
override;
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
Definition: LineIntersector.h:49
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:60
Specifies the precision model of the Coordinate in a Geometry.
Definition: PrecisionModel.h:87
Nodes a set of SegmentStrings completely.
Definition: IteratedNoder.h:55
void setMaximumIterations(int n)
Sets the maximum number of noding iterations performed before the noding is aborted.
Definition: IteratedNoder.h:97
std::vector< SegmentString * > * getNodedSubstrings() const override
Returns a collection of fully noded SegmentStrings. The SegmentStrings have the same context as their...
Definition: IteratedNoder.h:103
void computeNodes(std::vector< SegmentString * > *inputSegmentStrings) override
Fully nodes a list of SegmentStrings, i.e. peforms noding iteratively until no intersections are foun...
Computes all intersections between segments in a set of SegmentString.
Definition: Noder.h:49
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:26