A plane sweep algorithm to find the intersection of two convex hulls

The algorithm is based on ideas discussed in the book "Computational Geometry: Algorithms and Applications" by Mark de Berg et al..
This is the version of the code as it was delivered for the class Topics in Algorithms (fall 2010) at USI.
Rename packages
Regenerate javadocs
Add license and readme files before uploading to github