|
|
|
| more useful options | |
| PerlMonks |
Re^2: Sorting hashes...by husker (Chaplain) |
| on May 11, 2007 at 21:23 UTC ( [id://615016]=note: print w/replies, xml ) | Need Help?? |
|
For checking overlap, if any vertex of rectangle A is within rectangle B then they overlap. If no vertex of A is within B, B might still be entirely contained within A, so check one vertex of B to see if it's within A.
Actually, two rectangles could intersect without any vertex of either box lying inside the other. Picture two rectangles, perpendicular to each other, arranged as a cross.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||