Path: utzoo!censor!geac!torsqnt!lethe!yunexus!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!cs.utexas.edu!usc!samsung!uunet!mcsun!hp4nl!tnofel.fel.tno.nl!jsgn3
From: jsgn3@tnofel.fel.tno.nl (Jos Groot)
Newsgroups: comp.graphics
Subject: Area of overlap of areas bounded by two given polygons
Summary: Algorithm wanted to determine the area of the overlap of two polygons
Keywords: polygons
Message-ID: <1991Jan15.150033.6579@tnofel.fel.tno.nl>
Date: 15 Jan 91 15:00:33 GMT
Organization: TNO Physics and Electronics Laboratory
Lines: 15


Let two polygons A and B be defined by the coordinate pair sequences
(x , y ) for i= 1, 2, ..., a and (x , y ) for i= 1, 2, ..., b respectively.
  i   i                           i    i

I would like to have (a reference to) an algorithm that can be used to 
calculate the area of the overlap of the areas bounded by these two polygons.
Note that this overlap is not necessarily a simply connected area.


Jos Groot
Physics and Electronics Laboratory FEL-TNO
P.O.box 96864
's-Gravenhage
the Netherlands