SimpleSweepLineIntersector
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
Value members
Concrete methods
override def computeIntersections(edges: List[Edge], si: SegmentIntersector, testAllSegments: Boolean): Unit
- Definition Classes
override def computeIntersections(edges0: List[Edge], edges1: List[Edge], si: SegmentIntersector): Unit
- Definition Classes