   Collision Detection
  Comments for the article Collision Detection
  I belive that is a good algorithm. I have been looking for one for a long time now. I came up with something like that a long time ago but it had muy grande problemas. anyway, I guess i can spend another hour or two of my life pulling up my old project and polishing its collision detection. Thanks alot.selen_03@yahoo.com ;template < class T >const bool &overlaps( const T& x0,const T&  y0,const T&  x1,const T&  y1,const T&  x2,const T&  y2,const T&  x3,const T&  y3) const {return  ((!(  ((x0)<(x2) && (x1)<(x2))|| ((x0)>(x3) && (x1)>(x3))|| ((y0)<(y2) && (y1)<(y2))||  ((y0)>(y3) && (y1)>(y3)) )));}; ;  dg   ;  hi :p   ;  Thank you for a great article :);  Out of curiosity, how did someone manage to resurrect this thread?   ;  I read the article. Was good. Described it very well. I have a suggestion however.  And i'm sure I will probably get told it has it's flaws.When constructing the overlap rectangle. I believe the best thing to do is just to test the center pixel in the rectangle to see if it is overlapping in both bitmaps. Would this not be far more efficient while also giving you some degree of interaction better than just reduced rectangle formula?1. Saves you of testing all pixels which improves efficiency.2. gives you a greater degree of collision detection than just reduced rectangles.Let me know your thoughts. I might see if I can sketch some ascii art to represent my point.[Edited by - aschk on December 22, 2006 5:39:56 AM];  @Moe - there's a great thing out there on the internet called Google, you should try it out ;)   