From: rurban@x-ray.at (Reini Urban)
Subject: Re: Geometry Question??? Find Area of overlap
Date: Tue, 16 May 2000 21:19:36 GMT
Newsgroups: sci.math
Summary: Boolean intersection of polygons

hamtec@my-deja.com wrote:
>How to find the area of overlap if both polygon do overlap each other.
>What would be an efficient and fast way of doing this on a computer.
>Any help or references would be much appreciated.

search for "boolean intersection of polygons" in the computional
geometry literature.
e.g. deBerg explains it with a sweep plane algorithm which is the
fastest known way.

see
http://www.cs.sunysb.edu/~algorith/files/intersection-detection.shtml

(BTW: I miss "Boolonly", "Bool" and "clippoly" in this list of
implementations.
Bool is from the maintainers of
http://www.geom.umn.edu/software/cglist/, 
I lost the Boolonly url, 
clippoly is at
http://www.ph.tn.tudelft.nl/People/klamer/clippoly_entry.html
)

your problem is then solved as sum of the areas of the all intersecting
polygons.
--
Reini Urban
http://xarch.tu-graz.ac.at/autocad/news/faq/autolisp.html