栈的算法实现.docVIP

实验二 基本2D图形填充 实验目的： 掌握多边形域的扫描线填充算法的基本原理和计算机实现填充功能； 实验内容： 多边形域的扫描线算法 实验程序： #include alloc.h #include stdio.h #include graphics.h struct Edge { float y_max; float x; float delta_x; float y0; struct Edge* next; }; struct Point { float x; float y; }; float point[16]; struct Edge* Push(struct Edge* L, struct Edge* p) { if (L == NULL) { L = p; L-next = NULL; } else { p-next = L; L = p; } return L; } struct Edge* cut(struct Edge* L, struct Edge* p) { struct Edge* t = L; if (L == p) { L = L-next; free(p); } else { while (t-next != p t != NULL) { t = t-next; } t-next = p-next; free(p); } return L; } void psort(float* pt, int i) { int t, j; float v; if (i = 1) { return; } for (t = 0; t i; t++) { for (j = i - 1; j t; j--) { if (pt[j] pt[j - 1] ) { v = pt[j]; pt[j] = pt[j - 1]; pt[j - 1] = v; } } } } void DrawLine(int x0, int y0, int x, int y) { line(200 + x0, 300 - y0, 200 + x, 300 - y); } void main() { int p_num, k, i, j, y; struct Point allpoint[32]; struct Edge* list[32]; float yh[32]; float hp[32]; int length = 0; struct Edge fulledge[32]; float ymax; int count = 0; struct Edge* record = NULL; struct Edge* p, *t, e, *add; int h = 0; struct Edge* at; int gdriver = DETECT, gmode; registerbgidriver(EGAVGA_driver); initgraph(gdriver, gmode, ); cleardevice(); printf(put in point number: ); scanf(%d, p_num); for (k = 0; k p_num; k++) { list[k] = NULL; } setcolor(RED); for (i = 0; i p_num; i++) { printf(put in x and y ); scanf(%f%f, allpoint[i].x, allpoint[i].y); yh[i] = allpoint[i].y; } for(i = 0; i p_num - 1; i++) { DrawLine(allpoint[i].x, allpoint[i].y, allpoint[i+1].x, allpoint[i+1].y); } DrawLine(allpoint[i].x, allpoint[i].y, allpoint[0].x, allpoint[0].y); getch(); psort(yh, p_num); ymax = yh[p_num - 1]; hp[0] = yh[0]; length = 1; for (i = 1; i p_num; i++) { if (yh[i] ==