Finds an interior intersection in a set of SegmentStrings, if one exists. Only the first intersection found is reported. Creates an intersection finder which finds an interior intersection if one exists
||the LineIntersector to use.|
Gets the computed location of the intersection. Due to round-off, the location may not be exact.
the coordinate for the intersection location.
Gets the endpoints of the intersecting segments.
an array of the segment endpoints (p00, p01, p10, p11).
Tests whether an intersection was found.
true if an intersection was found.
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).
Sets whether only end segments should be tested for interior intersection. This is a performance optimization that may be used if the segments have been previously noded by an appropriate algorithm. It may be known that any potential noding failures will occur only in end segments.
||whether to test only end segments.|