SutherlndHodgman多边形裁剪算法.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 ins