SutherlandHodgman多边形裁剪算法.docVIP

Sutherland_Hodgman多边形裁剪算法 #define TRUE 1 #define FALSE 0 typedef struct { float x, y; } vertex; void intersect(p1, p2, clipboundary, intersectp) vertex p1, p2, *clipboundary, *intersectpt; /* p1和p2为多边形的边的起点和终点，clipboundary为窗口边界，intersectpt中返回边与窗口边界的交点 */ { if ( clipboundary[0].y== clipboundary[1].y ) /* 水平边界 */ { intersectpt-y = clipboundary[0].y; intersectpt-x = p1.x + (clipboundary[0].y-p1.y)*(p2.x-p1.x)/(p2.y-p1.y); } else /* 垂直边界 */ { intersectpt-x = clipboundary[0].x; intersectpt-y = p1.y + (clipboundary[0].x-p1.x)*(p2.y-p1.y)/(p2.x-p1.x); } } int inside(testvertex, clipboundary) vertex testvertex, *clipboundary; /* 如果顶点testvertex在窗口边界clipboundary的内部，那么返回TRUE；否则返回FALSE */ { if ( clipboundary[1].x clipboundary[0].x ) /* 上边界 */ if ( testvertex.y = clipboundary[0].y ) return TRUE; if ( clipboundary[1].x clipboundary[0].x ) /* 下边界 */ if ( testvertex.y = clipboundary[0].y ) return TRUE; if ( clipboundary[1].y clipboundary[0].y ) /* 右边界 */ if ( testvertex.x = clipboundary[0].x ) return TRUE; if ( clipboundary[1].y clipboundary[0].y ) /* 左边界 */ if ( testvertex.y = clipboundary[0].x ) return TRUE; return FALSE; } outputvertex(outvertex, outlength, outvertexlist) vertex outvertex; int *outlength; vertex *outvertexlist /* 向输出顶点序列中输出顶点outvertex */ { outvertexlist[*outlength] = outvertex; (*outlength)++; } void Sutherland_Hodgman_Polygon_Clipping(invertexlist, outvertexlist, inlength, outlength, clipboundary) vertex *invertexlist, *outvertexlist; int inlength, *outlength; vertex *clipboundary; /* invertexlist为输入顶点序列，inlength为输入序列长度；outvertexlist为输出顶点序列，outlenght中返回输出序列长度；clipboundary为窗口边界 */ { vertex s, p, i; int j; *outlength = 0; s = invertexlist[inlength-1]; /* 输入顶点序列的最后一个顶点 */ for ( j=0; jinlength; j++ ) { p = invertexlist[j]; if ( inside(p,clipboundary) ) /* 情况1和4 */ { if ( inside(s,clipboundary) ) /* 情况1 */ outputvertex(p,outlen