Part of pset3 of MIT OCW 6.006 Fall 2011.
A sweep line algorithm which finds all the intersection points in a layer of wires.
Uses an AVL tree to store the wires currently in contact with the sweep line.
-
Notifications
You must be signed in to change notification settings - Fork 0
Grishound/Sweep_Line_Algorithm
About
A sweep line algorithm which finds all the intersection points in a layer of wires.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published