16 #ifndef GEOS_GEOMGRAPH_INDEX_SIMPLESWEEPLINEINTERSECTOR_H 17 #define GEOS_GEOMGRAPH_INDEX_SIMPLESWEEPLINEINTERSECTOR_H 19 #include <geos/export.h> 22 #include <geos/geomgraph/index/EdgeSetIntersector.h> 26 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 34 class SegmentIntersector;
59 void computeIntersections(std::vector<Edge*> *edges,
60 SegmentIntersector *si,
61 bool testAllSegments);
63 void computeIntersections(std::vector<Edge*> *edges0,
64 std::vector<Edge*> *edges1,
65 SegmentIntersector *si);
69 void add(std::vector<Edge*> *edges);
71 std::vector<SweepLineEvent*> events;
76 void add(std::vector<Edge*> *edges,
void* edgeSet);
78 void add(
Edge *edge,
void* edgeSet);
82 void computeIntersections(SegmentIntersector *si);
84 void processOverlaps(
int start,
int end, SweepLineEvent *ev0,
85 SegmentIntersector *si);
96 #endif // GEOS_GEOMGRAPH_INDEX_SIMPLESWEEPLINEINTERSECTOR_H Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm...
Definition: SimpleSweepLineIntersector.h:51
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
Definition: geomgraph/Edge.h:66