On Fri, 9 Sep 2005 04:32 pm, John Eriksson wrote:
> BTW...even if you do have large images with large areas of intersection you
> probably still would find a hit within the first row wouldn't you? Then the
> nested loop wouldn't cost that much after all.
Even better, perform rect collision first, then iterate over *just* the rect
that collided.
Richard
Attachment:
pgpoUmSVpKUDB.pgp
Description: PGP signature