如何求两个向交矩形的交集的面积?

如何求两个相交矩形的交集的面积?
就是交接的公共部分面积?

class Rectangle {
Point min;
Point max;
}

Rectangle rect1, rect2;
Rectangle rect;

rect.min.x = max(rect1.min.x, rect2.min.x);
rect.min.y = max(rect1.min.y, rect2.min.y);
rect.max.x = min(rect1.max.x, rect2.max.x);
rect.max.y = min(rect1.max.y, rect2.max.y);
if ( rect.min.x<rect.max.x && rect.min.y <rect.max.y )
s = (rect.max.x-rect.min.x)*(rect.max.y-rect.min.y)
else
s = 0;

来自:http://www.softwelt.com/Know/KnowDetail-2486480.html

如何判断两个矩形是否相交 (2008-05-19 20:33:01)

<script> var $tag='interview,杂谈'; var $tag_code='afb3ad62a616a8fddbee271e29836477'; </script> 标签：interview<wbr><a class="tag" href="http://uni.sina.com.cn/c.php?t=blog&amp;k=%D4%D3%CC%B8&amp;ts=bpost&amp;stype=tag" target="_blank"><u><font color="#094287">杂谈</font></u></a><wbr></wbr></wbr>

分类：数据结构&&c++

假定矩形是用一对点表达的(minx,miny)(maxx, <wbr> maxy) <wbr><br><wbr> 那么两个矩形rect1{(minx1,miny1)(maxx1, <wbr> maxy1)}, <wbr> rect2{(minx2,miny2)(maxx2, <wbr> maxy2)} <wbr><br><wbr><wbr><br><wbr> 相交的结果一定是个矩形，构成这个相交矩形rect{(minx,miny)(maxx, <wbr> maxy)}的点对坐标是： <wbr><br><wbr> minx <wbr> = <wbr> max(minx1, <wbr> minx2) <wbr><br><wbr> miny <wbr> = <wbr> max(miny1, <wbr> miny2) <wbr><br><wbr> maxx <wbr> = <wbr> min(maxx1, <wbr> maxx2) <wbr><br><wbr> maxy <wbr> = <wbr> min(maxy1, <wbr> maxy2) <wbr><br><wbr><wbr><br><wbr> 如果两个矩形不相交，那么计算得到的点对坐标必然满足 <wbr><br><wbr> minx <wbr> &gt; <wbr> maxx <wbr><br><wbr> 或者 <wbr><br><wbr> miny <wbr> &gt; <wbr> maxy <wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>