459,914 Members | 1,706 Online
Need help? Post your question and get tips & solutions from a community of 459,914 IT Pros & Developers. It's quick & easy.

# Rectangle intersection

 P: n/a hi all, how to calculate the intersection of 2 rectangle a rectangle is the following: Rectangle makeRectangle (Point lowerLeft, Point upperRight) { Rectangle r; r.pt1 = lowerLeft; r.pt2 = upperRight; return r; } and Point is the following: Point makePoint(int x, int y) { Point p; p.x = x; p.y = y; return p; } And i want the know how to make: Rectangle intersection(Rectangle r1, Rectangle r2) this should return the intersection of the 2 rectangles anyone can help me plz? Nov 14 '05 #1
6 Replies

 P: n/a kimos scribbled the following: hi all, how to calculate the intersection of 2 rectangle a rectangle is the following: Rectangle makeRectangle (Point lowerLeft, Point upperRight) { Rectangle r; r.pt1 = lowerLeft; r.pt2 = upperRight; return r; } and Point is the following: Point makePoint(int x, int y) { Point p; p.x = x; p.y = y; return p; } And i want the know how to make: Rectangle intersection(Rectangle r1, Rectangle r2) this should return the intersection of the 2 rectangles anyone can help me plz? Which part are you having trouble with, calculating the intersection's coordinates or implementing the algorithm as a C program? -- /-- Joona Palaste (pa*****@cc.helsinki.fi) ------------- Finland --------\ \-- http://www.helsinki.fi/~palaste --------------------- rules! --------/ "Immanuel Kant but Genghis Khan." - The Official Graffitist's Handbook Nov 14 '05 #2

 P: n/a "kimos" wrote in message news:ae*************************@posting.google.co m... hi all, how to calculate the intersection of 2 rectangle a rectangle is the following: Rectangle makeRectangle (Point lowerLeft, Point upperRight) { Rectangle r; r.pt1 = lowerLeft; r.pt2 = upperRight; return r; } and Point is the following: Point makePoint(int x, int y) { Point p; p.x = x; p.y = y; return p; } And i want the know how to make: Rectangle intersection(Rectangle r1, Rectangle r2) this should return the intersection of the 2 rectangles anyone can help me plz? Rectangle intersection(Rectangle r1, Rectangle r2) { Find the leftmost and the bottommost rectangle. Find the rightmost and the topmost rectangle. If the left x co-ordinate of the non-leftmost rectangle is between the left and the right of the leftmost rectangle, you have the left cordinate of your intersection. If it is to the right you have no intersection, and the rectangles don't overlap. (If it is to the left you didn't calculate the leftmost rectangle correctly). Repeat for all the other coordinates (bottom, right, top). } Nov 14 '05 #3

 P: n/a kimos wrote: hi all, how to calculate the intersection of 2 rectangle Take the rightmost left-border, the left-most right border, the bottom-most top border and the top-most bottom border as borders for your intersection. If the left border of the intersection is on the right of the right border ot the top border below the bottom border, there is no intersection. -- Simon Stienen »What you do in this world is a matter of no consequence, The question is, what can you make people believe that you have done.« -- Sherlock Holmes in "A Study in Scarlet" by Sir Arthur Conan Doyle Nov 14 '05 #4

 P: n/a # this should return the intersection of the 2 rectangles # anyone can help me plz? Take two pieces of paper, overlay them, and think about you're looking at. Hint: the intersection is either empty, a point, or a rectangle. -- SM Ryan http://www.rawbw.com/~wyrmwif/ OOOOOOOOOO! NAVY SEALS! Nov 14 '05 #5

 P: n/a "SM Ryan" wrote in message news:10*************@corp.supernews.com... # this should return the intersection of the 2 rectangles # anyone can help me plz? Take two pieces of paper, overlay them, and think about you're looking at. Hint: the intersection is either empty, a point, or a rectangle. Or two points forming a line segment (the rectangles share some part of a border). Nov 14 '05 #6

 P: n/a kimos wrote: how to calculate the intersection of 2 rectangle The easiest way to think about this problem conceptually is to first come up with an algorithm for the 1D version, intersecting two line segments, then generalize it. Suppose we have a line from a to b and a line from c to d. There are four cases for intersecting them: a <= b < c <= d : a----b c----d In this case the intersection is empty. a <= b = c <= d : a----b/c----d In this case the intersection is the single point b=c (the line segment from b to b.) a <= c <= b <= d : a---c===b---d In this case the intersection is the line from c to b. a <= c <= d <= b : a---c===d---b In this case the intersection is the line from c to d. If you simply apply these same four cases to the x and y coordinate ranges of your rectangles separately, the result will be the x and y coordinate ranges of the intersection of the rectangles. -- Derrick Coetzee I grant this newsgroup posting into the public domain. I disclaim all express or implied warranty and all liability. I am not a professional. Nov 14 '05 #7

### This discussion thread is closed

Replies have been disabled for this discussion.