Package com.vividsolutions.jts.geomgraph.index

Class SimpleSweepLineIntersector

  • public class SimpleSweepLineIntersector
extends EdgeSetIntersector
    Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm. While still O(n^2) in the worst case, this algorithm drastically improves the average-case time.
    Version:
    1.7

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void computeIntersections​(java.util.List edges, SegmentIntersector si, boolean testAllSegments)
      Computes all self-intersections between edges in a set of edges, allowing client to choose whether self-intersections are computed.
      void computeIntersections​(java.util.List edges0, java.util.List edges1, SegmentIntersector si)
      Computes all mutual intersections between two sets of edges.

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Constructor Detail

      • SimpleSweepLineIntersector

        public SimpleSweepLineIntersector()

    • Method Detail

      • computeIntersections

        public void computeIntersections​(java.util.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