http://blog.csdn.net/cxf7394373/article/details/7535105
最近在用opencv寫一個文本定位的程序,獲取到字符輪廓之後需要進行合並,涉及到判斷矩形是否相交的問題,記得去年去三星通信研究院面試同樣問到了這個問題,如何判斷兩條線段是否相交,如何判斷兩個矩形是否相交。以前寫過一篇如何判斷線段相交的問題,上網查了一些方法,在這裡做一下後一個問題的總結:
方法一:假定矩形是用一對點表達的(minx,miny)(maxx, maxy) ,那麼兩個矩形rect1{(minx1,miny1)(maxx1, maxy1)}, rect2{(minx2,miny2)(maxx2, maxy2)} 相交的結果一定是個矩形,構成這個相交矩形rect{(minx,miny)(maxx, maxy)}的點對坐標是:
minx = max(minx1, minx2)
miny = max(miny1, miny2)
maxx = min(maxx1, maxx2)
maxy = min(maxy1, maxy2)
如果兩個矩形不相交,那麼計算得到的點對坐標必然滿足
minx > maxx 或者 miny > maxy
- <pre name="code" class="cpp">bool CPreprocess::crossAlgorithm1(CvRect r1,CvRect r2)
- {
- int nMaxLeft = 0;
- int nMaxTop = 0;
- int nMinRight = 0;
- int nMinBottom = 0;
- //計算兩矩形可能的相交矩形的邊界
- nMaxLeft = r1.x >= r2.x ? r1.x : r2.x;
- nMaxTop = r1.y >= r2.y ? r1.y : r2.y;
- nMinRight = (r1.x + r1.width) <= (r2.x + r2.width) ? (r1.x + r1.width) : (r2.x + r2.width);
- nMinBottom = (r1.y + r1.height) <= (r2.y + r2.height) ? (r1.y + r1.height) : (r2.y + r2.height);
- // 判斷是否相交
- if (nMaxLeft > nMinRight || nMaxTop > nMinBottom)
- {
- return false;
- }
- else
- {
- return true;
- }
- }</pre>
- <pre></pre>
方法二:如果兩個矩形相交,則必然存在線條交叉,而能交叉的線條只有橫線和豎線,兩根橫線或兩根豎線都不可能交叉。所以,這個問題就轉化成尋找是否存在交叉的橫線與豎線。
- //判斷兩個矩形是否相交
- bool CPreprocess::crossAlgorithm2(CvRect r1,CvRect r2)
- {
- //判斷兩個矩形是否相交,
- //從一個矩形中取出一條橫線,與另一矩形中的一條豎線判斷是否交叉
- return crossLine(r1.x, r1.x + r1.width, r1.y, r2.y, r2.y + r2.height, r2.x)
- || crossLine(r1.x, r1.x + r1.width, r1.y, r2.y, r2.y + r2.height, r2.x + r2.width)
- || crossLine(r1.x, r1.x + r1.width, r1.y + r1.height, r2.y, r2.y + r2.height, r2.x)
- || crossLine(r1.x, r1.x + r1.width, r1.y + r1.height, r2.y, r2.y + r2.height, r2.x r2.width)
- || crossLine(r2.x, r2.x + r2.width, r2.y, r1.y, r1.y + r1.height, r1.x)
- || crossLine(r2.x, r2.x + r2.width, r2.y, r1.y, r1.y + r1.height, r1.x + r1.width)
- || crossLine(r2.x, r2.x + r2.width, r2.y + r2.height, r1.y, r1.y + r1.height, r1.x)
- || crossLine(r2.x, r2.x + r2.width, r2.y r2.height, r1.y + r1.height, r1.y + r1.height, r1.x r1.width);
- }
- //判斷直線是否相交
- bool CPreprocess::crossLine(int left,int right,int x,int top,int bottom,int y)
- {
- return (top < y) && (bottom > y) && (left < x) && (right > x);
- }