Comments on: Rectangle Intersection – Find the Intersecting Rectangle http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/ The largest pool of technical questions with answers, explantions, code and detailed analysis Tue, 17 Nov 2009 16:28:09 +0000 http://wordpress.com/ hourly 1 By: Deepak http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9623 Deepak Mon, 16 Nov 2009 12:48:45 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9623 Hey, Ive made a program that would be of some useful reference to you guys. Please see the following link to get the C code to find intresecting rectangles. It uses a tree datastructure and the efficiency is good. http://myexps.blogspot.com/2009/11/rectangle-intersection-with-tree.html Hey,
Ive made a program that would be of some useful reference to you guys. Please see the following link to get the C code to find intresecting rectangles. It uses a tree datastructure and the efficiency is good.
http://myexps.blogspot.com/2009/11/rectangle-intersection-with-tree.html

]]> By: Best Webfoot Forward » Programming persistence http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9549 Best Webfoot Forward » Programming persistence Mon, 01 Dec 2008 07:21:56 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9549 [...] When it came time to implement my polygon bounding box intersection code again, I looked at my old polygon intersection code again, saw that it took eight comparisons, and thought to myself, “That can’t be right!”  Indeed, it took me very little time to come up with a version with only four comparisons, (and was now able to find sources on the Web that describe that algorithm). [...] [...] When it came time to implement my polygon bounding box intersection code again, I looked at my old polygon intersection code again, saw that it took eight comparisons, and thought to myself, “That can’t be right!”  Indeed, it took me very little time to come up with a version with only four comparisons, (and was now able to find sources on the Web that describe that algorithm). [...]

]]> By: karlrado http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9493 karlrado Fri, 04 Apr 2008 20:04:37 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9493 I think that Chris H is forgetting that the y axis is increasing in a downwards direction in Windows. http://www.functionx.com/visualc/gdi/gdicoord.htm I think that Chris H is forgetting that the y axis is increasing in a downwards direction in Windows. http://www.functionx.com/visualc/gdi/gdicoord.htm

]]> By: Chris H http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9003 Chris H Tue, 08 Jan 2008 02:00:48 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-9003 This algorithm is broken. Imagine two squares whose intersection is a small square in the upper right of one of the squares. This algorithm will choose the max left (upper square), max top (upper square), min right (lower square) and min bottom (lower square) giving a rectangle that stretches from the bottom of the lower square all the way to the top of the upper square. It also misses the case Tim Nicholson points out where one rectangle completely covers the second rectangle. This algorithm is broken. Imagine two squares whose intersection is a small square in the upper right of one of the squares. This algorithm will choose the max left (upper square), max top (upper square), min right (lower square) and min bottom (lower square) giving a rectangle that stretches from the bottom of the lower square all the way to the top of the upper square.

It also misses the case Tim Nicholson points out where one rectangle completely covers the second rectangle.

]]> By: Tim Nicholson http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-6133 Tim Nicholson Sun, 28 Oct 2007 09:09:28 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-6133 What this is missing is the case where the second rectangle is wholly contained within the first. The above returns the coordinates of the larger of the two rectangles, but in most clipping cases, it would be the coordinates of the smaller rectangle that would be of interest. This is easy to fix and would make a more useful function for graphic clipping applications. What this is missing is the case where the second rectangle is wholly contained within the first. The above returns the coordinates of the larger of the two rectangles, but in most clipping cases, it would be the coordinates of the smaller rectangle that would be of interest. This is easy to fix and would make a more useful function for graphic clipping applications.

]]> By: Mehmood http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-371 Mehmood Thu, 29 Mar 2007 14:25:36 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-371 Hey thats great and never thought it so simple.. 'coz i was thinking of some hidden surface removal algorithm .. OUCH !!! anyway thanks for such a wonderful post.. Hey thats great and never thought it so simple.. ‘coz i was thinking of some hidden surface removal algorithm .. OUCH !!! anyway thanks for such a wonderful post..

]]> By: swissreplica6 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-252 swissreplica6 Mon, 15 Jan 2007 11:56:29 +0000 http://tekpool.wordpress.com/2006/10/12/rectangle-intersection-find-the-intersecting-rectangle/#comment-252 <strong>very good post from our team</strong> very good post from our team

]]>