#include <SingleInteriorIntersectionFinder.h>
Inheritance diagram for geos::noding::SingleInteriorIntersectionFinder:
Public Member Functions | |
SingleInteriorIntersectionFinder (algorithm::LineIntersector &newLi) | |
Creates an intersection finder which finds an interior intersection if one exists. | |
bool | hasIntersection () const |
Tests whether an intersection was found. | |
const geom::Coordinate & | getInteriorIntersection () const |
Gets the computed location of the intersection. Due to round-off, the location may not be exact. | |
const std::vector< geom::Coordinate > & | getIntersectionSegments () const |
Gets the endpoints of the intersecting segments. | |
void | processIntersections (SegmentString *e0, int segIndex0, SegmentString *e1, int segIndex1) |
This method is called by clients of the SegmentIntersector class to process intersections for two segments of the SegmentStrings being intersected. | |
bool | isDone () const |
Reports whether the client of this class needs to continue testing all intersections in an arrangement. |
|
Creates an intersection finder which finds an interior intersection if one exists.
|
|
Gets the computed location of the intersection. Due to round-off, the location may not be exact.
|
|
Gets the endpoints of the intersecting segments.
|
|
Tests whether an intersection was found.
|
|
Reports whether the client of this class needs to continue testing all intersections in an arrangement.
Reimplemented from geos::noding::SegmentIntersector. |
|
This method is called by clients of the SegmentIntersector class to process intersections for two segments of the SegmentStrings being intersected. Note that some clients (such as MonotoneChains) may optimize away this call for segment pairs which they have determined do not intersect (e.g. by an disjoint envelope test). Implements geos::noding::SegmentIntersector. |