Top
IntersectionAdder(LineIntersector)
isAdjacentSegments(int, int): boolean
getLineIntersector(): LineIntersector
getProperIntersectionPoint(): Coordinate
hasIntersection(): boolean
hasProperIntersection(): boolean
hasProperInteriorIntersection(): boolean
hasInteriorIntersection(): boolean
processIntersections(SegmentString, int, SegmentString, int): void
isDone(): boolean
Bottom
Source Classic

Class IntersectionAdder

Hierarchy: Object , IntersectionAdder
All Implemented Interfaces: SegmentIntersector
public class IntersectionAdder
implements SegmentIntersector
Computes the possible intersections between two line segments in NodedSegmentStrings and adds them to each string using NodedSegmentString.addIntersection(LineIntersector, int, int, int) .

Other

  • version: 1.7
public IntersectionAdder(LineIntersector li)
public static boolean isAdjacentSegments(int i1, int i2)
public LineIntersector getLineIntersector()
public Coordinate getProperIntersectionPoint()
Returns:
the proper intersection point, or null if none was found
public boolean hasIntersection()
public boolean hasProperIntersection()
A proper intersection is an intersection which is interior to at least two line segments. Note that a proper intersection is not necessarily in the interior of the entire Geometry, since another edge may have an endpoint equal to the intersection, which according to SFS semantics can result in the point being on the Boundary of the Geometry.
public boolean hasProperInteriorIntersection()
A proper interior intersection is a proper intersection which is not contained in the set of boundary nodes set for this SegmentIntersector.
public boolean hasInteriorIntersection()
An interior intersection is an intersection which is in the interior of some segment.
public 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. 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).
public boolean isDone()
Always process all intersections
Returns:
false always