List of all members.
Public Member Functions
|void||computeIntersections (std::vector< Edge * > *edges, SegmentIntersector *si, bool testAllSegments)|
|void||computeIntersections (std::vector< Edge * > *edges0, std::vector< Edge * > *edges1, SegmentIntersector *si)|
|std::vector< SweepLineEvent * >||events|
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.