geometry algorithm question

[loki at cecm.sfu.ca (Loki Jorgenson)]

	Hello,

	We currently have a number of pieces of software from the Geometry
Centre here at the CECM which we use for demos.  I pulled this address
from the documentation for GeomView.

	I have a question related to geometry algorithms and I don't have
anyone to ask.  I'm hoping you can either help me or point me in the right
direction.  

	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?

-- 
'gards,

Loki Jorgenson                     o           Research Manager
Centre for Experimental &          _           net: loki at cecm.sfu.ca
 Constructive Mathematics          =                jorgena at sfu.ca
Simon Fraser University        o       o       fax:   ((555) 555-5555/4947
Burnaby B.C. CANADA  V5A 1S6                   phone: ((555) 555-5555/3331
                     -*  Numinously transformed  *-