19 #ifndef GEOS_NODING_MCINDEXNODER_H 20 #define GEOS_NODING_MCINDEXNODER_H 36 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 47 class SegmentIntersector;
76 void intersectChains();
86 nodedSegStrings(nullptr),
88 overlapTolerance(p_overlapTolerance)
94 std::vector<index::chain::MonotoneChain*>&
102 std::vector<SegmentString*>* getNodedSubstrings()
const override;
104 void computeNodes(std::vector<SegmentString*>* inputSegmentStrings)
override;
110 index::chain::MonotoneChainOverlapAction(),
134 # include <geos/noding/MCIndexNoder.inl> 137 #endif // GEOS_NODING_MCINDEXNODER_H
An interface for classes which represent a sequence of contiguous line segments.
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatia...
MCIndexNoder(SegmentIntersector *nSegInt=nullptr, double p_overlapTolerance=0.0)
The action for the internal iterator for performing overlap queries on a MonotoneChain.
Abstract class defines basic insertion and query operations supported by classes implementing spatial...
SegmentOverlapAction(SegmentIntersector &newSi)
Base class for Noders which make a single pass to find intersections.
Basic namespace for all GEOS functionalities.
Processes possible intersections detected by a Noder.
Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of...
Nodes a set of SegmentString using a index based on MonotoneChain and a SpatialIndex.
std::vector< index::chain::MonotoneChain * > monoChains
index::strtree::SimpleSTRtree index
std::vector< index::chain::MonotoneChain * > & getMonotoneChains()
Return a reference to this instance's std::vector of MonotoneChains.
std::vector< SegmentString * > * nodedSegStrings