Finds all intersections in one or two sets of edges, using the straightforward method of comparing all segments.
More...
#include <SimpleEdgeSetIntersector.h>
Finds all intersections in one or two sets of edges, using the straightforward method of comparing all segments.
- Note
- This algorithm is too slow for production use, but is useful for testing purposes.
Definition at line 43 of file SimpleEdgeSetIntersector.h.
geos::geomgraph::index::SimpleEdgeSetIntersector::SimpleEdgeSetIntersector |
( |
| ) |
|
void geos::geomgraph::index::SimpleEdgeSetIntersector::computeIntersections |
( |
std::vector< Edge * > * |
edges, |
|
|
SegmentIntersector * |
si, |
|
|
bool |
testAllSegments |
|
) |
| |
|
overridevirtual |
Computes all self-intersections between edges in a set of edges, allowing client to choose whether self-intersections are computed.
- Parameters
-
edges | a list of edges to test for intersections |
si | the SegmentIntersector to use |
testAllSegments | true if self-intersections are to be tested as well |
Implements geos::geomgraph::index::EdgeSetIntersector.
void geos::geomgraph::index::SimpleEdgeSetIntersector::computeIntersections |
( |
std::vector< Edge * > * |
edges0, |
|
|
std::vector< Edge * > * |
edges1, |
|
|
SegmentIntersector * |
si |
|
) |
| |
|
overridevirtual |
int geos::geomgraph::index::SimpleEdgeSetIntersector::nOverlaps |
|
private |
The documentation for this class was generated from the following file: