basic linesweep algorithms
make-github-pseudonymous-again opened this issue · 0 comments
make-github-pseudonymous-again commented
Implement a binary search tree storing line segments (ordered by y coordinates for the x position of a sweepline). For example, a Treap.
Use it to implement some linesweep algorithm, either given n points and a polygon P, decide which points are in P; or given n line segments, find all intersections