From: "R.G. Morgan" <r DOT g DOT morgan AT ncl DOT ac DOT uk>
Newsgroups: comp.os.msdos.djgpp
Subject: Re: collision detection
Date: 17 Oct 1997 10:32:01 GMT
Organization: University of Newcastle upon Tyne
Lines: 11
Sender: n6368757 AT ncl DOT ac DOT uk
Distribution: World
Message-ID: <627er1$jsm@whitbeck.ncl.ac.uk>
References: <C1256524 DOT 002EA05E DOT 00 AT vega DOT ads DOT it>
    <wa+XKBAzE6Q0IwWa AT pulsedesign DOT demon DOT co DOT uk>
    <3446F310 DOT 291D AT vxl DOT imag DOT net>
NNTP-Posting-Host: longlee.ncl.ac.uk
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

> Rob Farley wrote:
>> >> Does anyone know how to detect if two rectangles overlap each other at
>> >> some point. Let's say we have something like this:

> Given two rectangles, A and B, check to see if any of the vertices of B
> lie on A.  If this is true, then there must be overlap.

Not the case; consider the Red Cross Sign decomposed into 2 rectangles.
Although if you check often enough, this shouldn't happen.

	Richard Morgan