Fun with convex polygons
wildbunny.co.uk
wildbunny.co.uk
Edit: for more fun with polygons, check out Pick's theorem [1].
Since I'm guessing that pretty much everyone on this site has a copy of CLRS, the Selected Topics chapter on Computational Geometry has a good overview of cross product tricks. The convex hull algorithms are also interesting, useful, and very simple to learn.
If you're finished with that and are actually still interested, look at the Rotating Calipers method. It's a way of addressing all antipodal pairs of a given polygon, which serves as the basis for a whole whack of algorithms. Example - finding the narrowest rotation of a polygon. Some of you may recognize this as the solution to the last (and easiest) problem at the 2011 ICPC world finals [2].
[1] http://en.wikipedia.org/wiki/Pick%27s_theorem
[2] (PDF) https://cm.baylor.edu/ICPCWiki/attach/Problem%20Resources/20...
[1] http://www.mpi-inf.mpg.de/~mehlhorn/ftp/classroomExamplesNon...