Class SimpleSweepLineIntersector
- java.lang.Object
-
- org.locationtech.jts.geomgraph.index.EdgeSetIntersector
-
- org.locationtech.jts.geomgraph.index.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
-
-
Constructor Summary
Constructors Constructor Description SimpleSweepLineIntersector()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidcomputeIntersections(List edges0, List edges1, SegmentIntersector si)Computes all mutual intersections between two sets of edges.voidcomputeIntersections(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.
-
-
-
Method Detail
-
computeIntersections
public void computeIntersections(List edges, SegmentIntersector si, boolean testAllSegments)
Description copied from class:EdgeSetIntersectorComputes all self-intersections between edges in a set of edges, allowing client to choose whether self-intersections are computed.- Specified by:
computeIntersectionsin classEdgeSetIntersector- Parameters:
edges- a list of edges to test for intersectionssi- the SegmentIntersector to usetestAllSegments- true if self-intersections are to be tested as well
-
computeIntersections
public void computeIntersections(List edges0, List edges1, SegmentIntersector si)
Description copied from class:EdgeSetIntersectorComputes all mutual intersections between two sets of edges.- Specified by:
computeIntersectionsin classEdgeSetIntersector- Parameters:
edges0- set of edgesedges1- set of edgessi- segment intersector
-
-