opengl 扫描线算法.docVIP

opengl 扫描线算法 #include GL/glut.h // (or others, depending on the system in use) #include stdlib.h #include math.h #include windows.h #define WINDOW_WIDTH 400 #define WINDOW_HEIGHT 400 typedef struct tEdge { int yUpper; float xIntersect, dxPerScan; struct tEdge * next; } Edge; struct dcPt { int x; int y; }; void init (void) { glClearColor (1.0, 1.0, 1.0, 0.0); // Set display-window color to white. glMatrixMode (GL_PROJECTION); // Set projection parameters. gluOrtho2D (0.0, 400.0, 0.0, 400.0); } void setPixel(GLint x,GLint y) { glBegin(GL_POINTS); glVertex2i(x, y); glEnd(); glFlush(); } /* Inserts edge into list in order of increasing xIntersect field. */ void insertEdge (Edge * list, Edge * edge) { Edge * p, * q = list; p = q-next; while (p != NULL) { if (edge-xIntersect p-xIntersect) p = NULL; else { q = p; p = p-next; } } edge-next = q-next; q-next = edge; } /* For an index, return y-coordinate of next nonhorizontal line */ int yNext (int k, int cnt, dcPt * pts) { int j; if ((k+1) (cnt-1)) j = 0; else j = k + 1; while (pts[k].y == pts[j].y) if ((j+1) (cnt-1)) j = 0; else j++; return (pts[j].y); } /* Store lower-y coordinate and inverse slope for each edge. Adjust and store upper-y coordinate for edges that are the lower member of a monotically increasing or decreasing pair of edges */ void makeEdgeRec (dcPt lower, dcPt upper, int yComp, Edge * edge, Edge * edges[]) { edge-dxPerScan = (float) (upper.x - lower.x) / (upper.y - lower.y); edge-xIntersect = lower.x; if (upper.y yComp) edge-yUpper = upper.y - 1; else edge-yUpper = upper.y; insertEdge (edges[lower.y], edge); } void buildEdgeList (int cnt, dcPt * pts, Edge * edges[]) { Edge * edge; dcPt v1, v2; int i, yPrev = pts[cnt - 2].y; v1.x = pts[cnt-1].x; v1.y = pts[cnt-1].y; for (i=0; icnt; i++) { v2 = pts[i]; if (v1.y != v2.y) {