GEOS
3.4.2
|
Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm. More...
#include <SimpleSweepLineIntersector.h>
Inherits geos::geomgraph::index::EdgeSetIntersector.
Public Member Functions | |
void | computeIntersections (std::vector< Edge * > *edges, SegmentIntersector *si, bool testAllSegments) |
void | computeIntersections (std::vector< Edge * > *edges0, std::vector< Edge * > *edges1, SegmentIntersector *si) |
![]() | |
virtual void | computeIntersections (std::vector< Edge * > *edges, SegmentIntersector *si, bool testAllSegments)=0 |
virtual void | computeIntersections (std::vector< Edge * > *edges0, std::vector< Edge * > *edges1, SegmentIntersector *si)=0 |
Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm.
While still O(n^2) in the worst case, this algorithm drastically improves the average-case time.