C++判斷矩形相交的方法
本文實(shí)例講述了C++判斷矩形相交的方法。分享給大家供大家參考。具體如下:
已知2矩形原點(diǎn)和寬高,判斷2矩形相交,相交矩形
相交判斷原理:
假定矩形是用一對(duì)點(diǎn)表達(dá)的(minx, miny) (maxx, maxy),那么兩個(gè)矩形
rect1{(minx1, miny1)(maxx1, maxy1)}
rect2{(minx2, miny2)(maxx2, maxy2)}
相交的結(jié)果一定是個(gè)矩形,構(gòu)成這個(gè)相交矩形rect{(minx, miny) (maxx, maxy)}的點(diǎn)對(duì)坐標(biāo)是:
minx = max(minx1, minx2)
miny = max(miny1, miny2)
maxx = min(maxx1, maxx2)
maxy = min(maxy1, maxy2)
如果兩個(gè)矩形不相交,那么計(jì)算得到的點(diǎn)對(duì)坐標(biāo)必然滿足:
( minx > maxx ) 或者 ( miny > maxy )
判定是否相交,以及相交矩形是什么都可以用這個(gè)方法一體計(jì)算完成
設(shè)計(jì)3個(gè)類:
1. 點(diǎn)類:x,y
2. 矩形類:點(diǎn),寬,高
3. 判斷相交類
程序?qū)崿F(xiàn):
CPoint.h
#import <Foundation/Foundation.h>
@interface CPoint : NSObject
{
int x; //點(diǎn)坐標(biāo)
int y;
}
-(void) print;
-(void) setX: (int) vx;
-(void) setY: (int) vy;
-(void) setXY:(int) vx :(int) vy;
-(int) x;
-(int) y;
@end
CPoint.m
#import "CPoint.h"
@implementation CPoint
-(void) print
{
NSLog(@"the point is (%i, %i)",x,y);
}
-(void) setX: (int) vx
{
x = vx;
}
-(void) setY: (int) vy
{
y = vy;
}
-(void) setXY:(int)vx :(int)vy
{
x = vx;
y = vy;
}
-(int) x
{
return x;
}
-(int) y
{
return y;
}
@end
CRect.h
#import <Foundation/Foundation.h>
#import "CPoint.h"
@interface CRect : NSObject
{
int w; //矩形長(zhǎng)
int h; //矩形高
}
-(void) print;
-(int) w;
-(int) h;
-(void) setW: (int) vw;
-(void) setH: (int) vh;
-(void) setWH: (int) vw :(int) vh;
-(CPoint *) origin;
-(void) setOrigin: (CPoint *) pt;
@end
CRect.m
#import "CRect.h"
@implementation CRect
{
CPoint *origin; //點(diǎn)
}
-(void) print
{
NSLog(@"the rect:(x:%i, y:%i, w:%i,h:%i)",origin.x, origin.y, w, h);
}
-(int) w
{
return w;
}
-(int) h
{
return h;
}
-(void) setW:(int)vw
{
w = vw;
}
-(void) setH:(int)vh
{
h = vh;
}
-(void) setWH:(int)vw :(int)vh
{
w = vw;
h = vh;
}
-(CPoint *) origin
{
return origin;
}
-(void) setOrigin:(CPoint *)pt
{
origin = pt;
}
@end
DoCRect.h
#import <Foundation/Foundation.h>
#import "CRect.h"
@interface DoCRect : NSObject
-(BOOL) isIntersect:(CRect *) rect1 :(CRect *) rect2; //矩形相交否
-(CRect *) intersectRect: (CRect *) rect1 :(CRect *) rect2; //相交矩形
@end
DoCRect.m
#import "DoCRect.h"
@implementation DoCRect
//矩形是否相交
-(BOOL) isIntersect:(CRect *)rect1 :(CRect *)rect2
{
int minx = MAX(rect1.origin.x, rect2.origin.x);
int miny = MAX(rect1.origin.y, rect2.origin.y);
int maxx = MIN(rect1.origin.x+rect1.w, rect2.origin.x+rect2.w);
int maxy = MIN(rect1.origin.y+rect1.h, rect2.origin.y+rect2.h);
if (minx>maxx || miny>maxy)
{
return NO;
}
return YES;
}
-(CRect *) intersectRect:(CRect *)rect1 :(CRect *)rect2
{
int minx = MAX(rect1.origin.x, rect2.origin.x);
int miny = MAX(rect1.origin.y, rect2.origin.y);
int maxx = MIN(rect1.origin.x+rect1.w, rect2.origin.x+rect2.w);
int maxy = MIN(rect1.origin.y+rect1.h, rect2.origin.y+rect2.h);
CRect * rect = [[CRect alloc] init];
CPoint *p = [[CPoint alloc] init];
if (NO == [self isIntersect:rect1 :rect2])//no isIntersect
{
[p setXY:minx :miny];
[rect setOrigin:p];
rect.w = 0;
rect.h = 0;
return rect;
}
[p setXY:minx :miny];
[rect setOrigin:p];
rect.w = ABS(maxx-minx);
rect.h = ABS(maxy - miny);
return rect;
}
@end
main.m 測(cè)試
#import <Foundation/Foundation.h>
#import "DoCRect.h"
int main(int argc, const char * argv[])
{
@autoreleasepool
{
NSLog(@"Hello,判斷矩形相交,返回矩形的原點(diǎn)和長(zhǎng)高");
//初始化對(duì)象
CRect *myrect1 = [[CRect alloc] init];
CRect *myrect2 = [[CRect alloc] init];
CPoint *p1 = [[CPoint alloc] init];
CPoint *p2 = [[CPoint alloc] init];
DoCRect *dorect = [[DoCRect alloc] init];
//原點(diǎn)變量
[p1 setXY:200 :420];
[p2 setXY:400 :300];
//設(shè)置矩形原點(diǎn)
[myrect1 setOrigin:p1];
[myrect1 setWH:250 :75];
[myrect1 print];
[myrect2 setOrigin:p2];
[myrect2 setWH:100 :180];
[myrect2 print];
//判斷2矩形是否相交
BOOL insersect = [dorect isIntersect:myrect1 :myrect1];
NSLog(@" two rect is :%@",insersect?@"YES":@"NO");
//返回相交矩形
//CRect *inserectRect = [[CRect alloc] init];
CRect *inserectRect = [dorect intersectRect:myrect1 :myrect2];
[inserectRect print];
}
return 0;
}
希望本文所述對(duì)大家的C++程序設(shè)計(jì)有所幫助。
相關(guān)文章
C語(yǔ)言實(shí)現(xiàn)找出二叉樹(shù)中某個(gè)值的所有路徑的方法
這篇文章主要介紹了C語(yǔ)言實(shí)現(xiàn)找出二叉樹(shù)中某個(gè)值的所有路徑的方法,針對(duì)數(shù)據(jù)結(jié)構(gòu)中二叉樹(shù)的實(shí)用操作技巧,需要的朋友可以參考下2014-09-09
C語(yǔ)言如何實(shí)現(xiàn)可變參數(shù)詳解
這種可變參數(shù)可以說(shuō)是C語(yǔ)言一個(gè)比較難理解的部分,下面這篇文章主要給大家介紹了關(guān)于C語(yǔ)言如何實(shí)現(xiàn)可變參數(shù)的相關(guān)資料,需要的朋友可以參考下2021-07-07
基于Qt實(shí)現(xiàn)駕??颇靠荚囅到y(tǒng)的示例代碼
這篇文章主要為大家詳細(xì)介紹了如何基于Qt實(shí)現(xiàn)駕??颇靠荚囅到y(tǒng),文中的示例代碼講解詳細(xì),對(duì)我們學(xué)習(xí)Qt有一定幫助,需要的可以參考一下2022-07-07
C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)單回聲服務(wù)器
這篇文章主要為大家詳細(xì)介紹了C語(yǔ)言實(shí)現(xiàn)簡(jiǎn)單回聲服務(wù)器,文中示例代碼介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們可以參考一下2022-03-03
C++11 中的std::function和std::bind詳解
這篇文章主要介紹了C++ 11 std::function和std::bind,文中通過(guò)示例代碼介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,需要的朋友們下面隨著小編來(lái)一起學(xué)習(xí)學(xué)習(xí)吧2021-10-10

