Assignment 3: Finding segment intersections with a sweep line algorithm

Implement the sweep line algorithm for finding the intersections of a set of orthogonal line segments in 2D and animate the algorithm.

Start code is provided here. You will notice that the main file viewpoints.cpp is now in cpp and uses vectors. This is the one assignment where I wolud suggest that you use cpp, because it gives you balanced binary search trees. If you decide to stick to C, you'll need to find a free implementation of balanced binary search trees (like red-black trees or AVL trees).

You are encouraged to work with a partner and use the svn folder that DJ created for each group. If you would like to change partners, just come talk to me or send me an email, and we'll create new svn folders for you.

How to turn in:

• If you used the svn folder provided, there is no need to email me the files ----I will access them in your svn folder.
• If you did not use svn, email me the zip file of your code so that I can test it. Make sure not to include any clutter (object files, executables)----before you zip it run "make clean".

And finally, if your code has bugs, you need to make it to the study group and talk to Max (the TA). He may not be able to tell you exactly what is wrong, but going over your code with someone else may show you what's wrong. I've been in many situatiosn where someone would walk me through their code, only to find out the problem as they were explaining how it works.

Enjoy!