com.vividsolutions.jts.geomgraph.index
Class SimpleMCSweepLineIntersector
public class SimpleMCSweepLineIntersector
Finds all intersections in one or two sets of edges,
using an x-axis sweepline algorithm in conjunction with Monotone Chains.
While still O(n^2) in the worst case, this algorithm
drastically improves the average-case time.
The use of MonotoneChains as the items in the index
seems to offer an improvement in performance over a sweep-line alone.
SimpleMCSweepLineIntersector() - A SimpleMCSweepLineIntersector creates monotone chains from the edges
and compares them using a simple sweep-line along the x-axis.
|
SimpleMCSweepLineIntersector
public SimpleMCSweepLineIntersector()
A SimpleMCSweepLineIntersector creates monotone chains from the edges
and compares them using a simple sweep-line along the x-axis.
computeIntersections
public void computeIntersections(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.
- computeIntersections in interface EdgeSetIntersector
edges
- a list of edges to test for intersectionssi
- the SegmentIntersector to usetestAllSegments
- true if self-intersections are to be tested as well