CareerCup

return ! ( (R1.right<=R2.left) | (R2.right<=R1.left) | (R1.bottom<=R2.top) | (R2.bottom<=R1.top) )

You are assuming that the rectangle is aligned with axes.. It could be more generic where you have total 8 pairs of coordinates ( 4 for each ).

find distance betweeen the centers of two rectangles(let it be D)
find distance of centre of R2 from edge of R1(let it be s1)
" " " " " R1 from edge of R2(let it be s2)
if s1+s2!= D then rectangles overlap

I could not understand the solution......
"distance of centre of R2 from edge of R1(let it be s1)" !!!! From which edge of R1 !!!!
similarly for R1

For any Rectangle find its four corresponding lines using y-y1/(x-x1) = y2-y1/x2-x1
You got four lines for Rectangle A.

You got four points for rectangle B.

For A or B to intersect ( I am assuming this is what overlap means), the value of one point should be > 0 and < 0 for two parallel lines and < 0 and > 0 for the other two parallels lines. ( or the other way around)

In case not they would have the same sign. ( both > 0 and both < 0 or other way around).

Overlapping = Atleast one vertex of a rectangle contained within/on the vertices of the other.

My method - Check each vertex of each rectangle for containment within the other.

bool isContained( rect r, point p)
{
   if( (p.x > r.left && p.x < r.right) //Check if x is within rect's bounds
       && (p.y < r.top && p.y > r.bottom) )
   { 
      return true;
   }
   else
      return false;
}

bool isOverlapped( rect bg_rect, rect fg_rect)
{
   for each (vertex v in fg_rect)
   { 
       if (isContained(bg_rect, v))
       { 
           return true;
       }
    }
    return false;
}

bool checkMutualOverlap(rect r1, rect r2)
{
   return (isOverlapped(r1,r2) || isOverlapped(r2,r1));
}

stackoverflow.com/questions/306316/determine-if-two-rectangles-overlap-each-other

project the 2 rectangles into the X-axis and Y-axis, then check whether they are overlap on both axes.

NA

typedef struct
{
double x;
double y;
double width;
double height;
} rectangle;

bool overlap(rectangle *rect_a, rectangle *rect_b)
{
bool var = false;

if (rect_a->x<=rect_b->x && rect_a->y<=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_a->width &&
abs(rect_a->y-rect_b->y)<=rect_a->height)
var = true;
}
else if (rect_a->x>=rect_b->x && rect_a->y<=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_b->width &&
abs(rect_a->y-rect_b->y)<=rect_a->height)
var = true;
}
else if (rect_a->x>=rect_b->x && rect_a->y>=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_b->width &&
abs(rect_a->y-rect_b->y)<=rect_b->height)
var = true;
}
else if (rect_a->x<=rect_b->x && rect_a->y>=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_a->width &&
abs(rect_a->y-rect_b->y)<=rect_b->height)
var = true;
}
else
{
var = true;
}

return var;
}


Can someone help to debug/test/improve my logic? Thanks.

typedef struct
{
double x;
double y;
double width;
double height;
} rectangle;

bool overlap(rectangle *rect_a, rectangle *rect_b)
{
bool var = false;

if (rect_a->x<=rect_b->x && rect_a->y<=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_a->width &&
abs(rect_a->y-rect_b->y)<=rect_a->height)
var = true;
}
else if (rect_a->x>=rect_b->x && rect_a->y<=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_b->width &&
abs(rect_a->y-rect_b->y)<=rect_a->height)
var = true;
}
else if (rect_a->x>=rect_b->x && rect_a->y>=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_b->width &&
abs(rect_a->y-rect_b->y)<=rect_b->height)
var = true;
}
else if (rect_a->x<=rect_b->x && rect_a->y>=rect_b->y)
{
if(abs(rect_a->x-rect_b->x)<=rect_a->width &&
abs(rect_a->y-rect_b->y)<=rect_b->height)
var = true;
}
else
{
var = true;
}

return var;
}


Can someone help to debug/test/improve my logic? Thanks.