10二维裁剪探究.ppt

typedef struct{ float x,y; }Vertex; typedef Vertex Edge[2]; typedef Vertex Vertexarray[MAX];/*MAX允许的多边形最大顶点个数 void Intersect(Vertex *s, Vertex *p, Edge clipBoundary, Vertex *I) { if(clipBoundary[0].y==clipBoundary[1].y)//表示水平裁剪窗边 { I-y=clipBoundary[0].y; I-x=s-x+(clipBoundary[0].y-s-y)*(p-x-s-x)/(p-y-s-y); } else //表示垂直裁剪窗边 { I-x=clipboundary[0].x; I-y=s-y+(clipBoundary[0].x-s-x)*(p-y-s-y)/(p-x-s-x); } } 算法程序 算法程序 boolean Inside (Vertex * textVertex, Edge clipBoundary) { if(clipBoundary[1].xclipBoundary[0].x) //裁剪边为窗口下边 { if(testVertex-y=clipBoundary[0].y) return TRUE ; } else if( clipBoundary[1].x clipBoundary[0].x) //裁剪边为窗口上边 { if( testVertex-y = clipBoundary[0].y) return TRUE ; } else if(clipBoundary[1].y clipBoundary[0].y) //裁剪边为窗口右边 { if(testVertex-x = clipBoundary[0].x) return TRUE ; } else if(clipBoundary[1].y clipBoundary[0].y) //裁剪边为窗口左边 { if(testVertex-x = clipBoundary[0].x) return TRUE ; } return FALSE ; } void Output(Vertex *newVertex, int *outLength, VertexArray outVertexArray) { outVertexArray [* outLength].x = newVertex-x ; outVertexArray [* outLength].y = newVertex-y ; (*outLength)++ ; } 下面程序中，inVertexarray输入多边形项点数组；outVertexArray输出多边形顶点数组；clipBoundary一条裁剪边。 Void SutherlandHodgmanPolygonClip( int inLength, VertexArray inVertexarray, int *outLength, VertexArray outVertexArray, Edge clipBoundary) { vertex *s, *p, i ; int j; *outLength = 0 ; s = (inVertexArray[inLength-1]) ; 算法程序 for( j=0; jinLength; j++) { p = (inVertexArray[j]) ; if( Inside(p, clipBoundary )) { if( Inside( s, clipBoundary))