Class SegmentIntersector

java.lang.Object
org.locationtech.jts.geomgraph.index.SegmentIntersector

public class SegmentIntersector extends Object
Computes the intersection of line segments, and adds the intersection to the edges containing the segments.
Version:
1.7
  • Field Details

    • numTests

      public int numTests
  • Constructor Details

    • SegmentIntersector

      public SegmentIntersector(LineIntersector li, boolean includeProper, boolean recordIsolated)
  • Method Details

    • isAdjacentSegments

      public static boolean isAdjacentSegments(int i1, int i2)
    • setBoundaryNodes

      public void setBoundaryNodes(Collection bdyNodes0, Collection bdyNodes1)
    • isDone

      public boolean isDone()
    • getProperIntersectionPoint

      public Coordinate getProperIntersectionPoint()
      Returns:
      the proper intersection point, or null if none was found
    • hasIntersection

      public boolean hasIntersection()
    • hasProperIntersection

      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.
      Returns:
      indicates a proper intersection with an interior to at least two line segments
    • hasProperInteriorIntersection

      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.
      Returns:
      indicates a proper interior intersection
    • addIntersections

      public void addIntersections(Edge e0, int segIndex0, Edge e1, int segIndex1)
      This method is called by clients of the EdgeIntersector class to test for and add intersections for two segments of the edges being intersected. Note that clients (such as MonotoneChainEdges) may choose not to intersect certain pairs of segments for efficiency reasons.