Problem
1. Give a method for testing whether or not a given polygon is simple (doesn't intersect itself).
2. Give a method for testing whether one polygon is totally contained within another.
3. Describe how you would solve the general line-intersection problem given the additional fact that the minimum separation between two lines is greater than the maximum length of the lines.