Skip to content
/ Sweep_Line_Algorithm Public

A sweep line algorithm which finds all the intersection points in a layer of wires.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Grishound/Sweep_Line_Algorithm

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
README.md
README.md
 
 
avl.py
avl.py
 
 
bst.py
bst.py
 
 
circuit2.py
circuit2.py
 
 

Repository files navigation

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.

About

A sweep line algorithm which finds all the intersection points in a layer of wires.

Topics

avl-tree binary-search-tree algorithms-and-data-structures avl-tree-implementations sweep-line-algorithm

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages