欧美大屁股bbbbxxxx,狼人大香伊蕉国产www亚洲,男ji大巴进入女人的视频小说,男人把ji大巴放进女人免费视频,免费情侣作爱视频

歡迎來(lái)到入門(mén)教程網(wǎng)!

C語(yǔ)言

當(dāng)前位置:主頁(yè) > 軟件編程 > C語(yǔ)言 >

C++判斷矩形相交的方法

來(lái)源:本站原創(chuàng)|時(shí)間:2020-01-10|欄目:C語(yǔ)言|點(diǎn)擊: 次

本文實(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è)類(lèi):

1. 點(diǎn)類(lèi):x,y
2. 矩形類(lèi):點(diǎn),寬,高
3. 判斷相交類(lèi)

程序?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ì)有所幫助。

上一篇:C語(yǔ)言打印華氏-攝氏溫度對(duì)照表的方法

欄    目:C語(yǔ)言

下一篇:C語(yǔ)言統(tǒng)計(jì)字符個(gè)數(shù)代碼分享

本文標(biāo)題:C++判斷矩形相交的方法

本文地址:http://mengdiqiu.com.cn/a1/Cyuyan/2991.html

網(wǎng)頁(yè)制作CMS教程網(wǎng)絡(luò)編程軟件編程腳本語(yǔ)言數(shù)據(jù)庫(kù)服務(wù)器

如果侵犯了您的權(quán)利,請(qǐng)與我們聯(lián)系,我們將在24小時(shí)內(nèi)進(jìn)行處理、任何非本站因素導(dǎo)致的法律后果,本站均不負(fù)任何責(zé)任。

聯(lián)系QQ:835971066 | 郵箱:835971066#qq.com(#換成@)

Copyright © 2002-2020 腳本教程網(wǎng) 版權(quán)所有