Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.
Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).
I was wondering if anybody who frequents this board is a relatively experienced programmer who can solve a damn annoying puzzle... Well you see, I need to write a routine, which operates as follows:
given 2 rects return true or false for whether or not the diagonals of the rects intersect
if that can be clarified, I'll try, anyways.. whether the rectangles cross over each other is not what I'm looking for. it's whether the line segments from top/left-bottom/right of one intersect with the bottom/left-top/right of the other. I'm really confused by this, so. Let me know, anybody, if you have a solid idea.
thanks
------------------ Dave
Try Just Chat or the EV Banter and Brawl...
------------------ "My guitar gently weeps." George Harrison, 1943-2001
Wait, what's this? The EV Board.... not the C++ board.
------------------ --mikeeJ