geometry algorithm question

[mbp]

> 	My question is:  Is there an algorithm for calculating the area of
> intersection between two arbitrary polygons in 2D, prehaps assuming that
> they are convex?

Loki,
   I don't know the specifics off the top of my head, but there
are well-known algorithms for (1) computing the intersection
of polygons and (2) computing the area of a polygon.  You might
try looking in the Graphics Gems books for both of these.
   I've forwarded your question to some of our resident computational
geometers who might be able to provide a more specific reference.

Hope this helps,

Mark Phillips
Geometry Center