Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!paperboy!hsdndev!cfa203!dp
From: dp@cfa.harvard.edu (Dave Plummer)
Newsgroups: comp.graphics
Subject: Wanted: algorithm to compute intersection of square and circle
Message-ID: <1991Apr25.192400.8438@cfa203.harvard.edu>
Date: 25 Apr 91 19:24:00 GMT
Organization: Harvard-Smithsonian Center for Astrophysics, Cambridge, MA,  USA
Lines: 12

I am looking for an algorithm (C or Fortran code would be nice) that
finds the area of intersection between a circle and a square of arbitrary
position and size.  After thinking about it for a few minutes I realized
that this is more complicated than it sounds.

The intersecting area will vary from zero (no overlap) to the full area of
the circle or square (one enclosed by the other).

Please post any suggestions, references or code or e-mail them to:
dp@cfa.harvard.edu

- Dave Plummer