Bounds intersection

Question

Given a Bounds structure like this:

struct Bounds {
  public double xMin;
  public double xMax;
  public double yMin;
  public double yMax;
}

I'm trying to find out how two Bounds A and B intersect. Possible results are:

A and B do not intersect at all
A and B are equal
A fully contains B
B fully contains A
A and B intersect each other

My first and naive attempt at it, is to test how many points of A are in B and how many points of B are in A, but I need this test to be as fast as possible and there is probably a better way to do it.

Thanks a lot !

Looks like a repeat http://stackoverflow.com/questions/306316/determine-if-two-rectangles-overlap-each-other — Sanjeevakumar Hiremath, Mar 12 '11 at 09:02

Beta · Accepted Answer · 2011-03-10T16:24:23.127

3

Try it in 2D 1D first. It should be clear how to test two [x_min, x_max] objects for those five possible results. Then do the same for [y_min, y_max]. Then combine the two results:

(no intersection)_x + (anything)_y = (no intersection)
(equal)_x + (something)_y = (something)
(A contains B)_x + (A contains B)_y = (A contains B)
(A contains B)_x + (A and B intersect)_y = (A and B intersect)
(A contains B)_x + (B contains A)_y = (A and B intersect)

(I think that covers it.)

edited Mar 10 '11 at 16:24

answered Mar 10 '11 at 12:47

Beta

96,650
16
149
150

@Nicolas Repiquet: [facepalm] Thanks. – Beta Mar 10 '11 at 16:23

Bounds intersection

1 Answers1