Class SimpleEdgeSetIntersector

java.lang.Object
org.locationtech.jts.geomgraph.index.EdgeSetIntersector
org.locationtech.jts.geomgraph.index.SimpleEdgeSetIntersector

public class SimpleEdgeSetIntersector extends EdgeSetIntersector
Finds all intersections in one or two sets of edges, using the straightforward method of comparing all segments. This algorithm is too slow for production use, but is useful for testing purposes.
Version:
1.7
  • Field Details

    • nOverlaps

      int nOverlaps
  • Constructor Details

    • SimpleEdgeSetIntersector

      public SimpleEdgeSetIntersector()
  • Method Details

    • computeIntersections

      public void computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
      Description copied from class: EdgeSetIntersector
      Computes all self-intersections between edges in a set of edges, allowing client to choose whether self-intersections are computed.
      Specified by:
      computeIntersections in class EdgeSetIntersector
      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
    • computeIntersections

      public void computeIntersections(List edges0, List edges1, SegmentIntersector si)
      Description copied from class: EdgeSetIntersector
      Computes all mutual intersections between two sets of edges.
      Specified by:
      computeIntersections in class EdgeSetIntersector
    • computeIntersects

      private void computeIntersects(Edge e0, Edge e1, SegmentIntersector si)
      Performs a brute-force comparison of every segment in each Edge. This has n^2 performance, and is about 100 times slower than using monotone chains.