计算机图形学_有效边表算法源代码.docxVIP

#include stdio.h#include malloc.h#include gl/glut.h#include Windows.h#define EPSILON 0.000001 //最小浮点数//点结构体struct Point{ int x; //x坐标 int y; //y坐标};//线结构体struct Line{ Point high_point; //高端点 Point low_point; //低端点 int is_active; //是否为有效边，水平边（0），非水平边（1） double inverse_k; //斜率k的倒数};//边结点struct EdgeNode{ double x; //扫描线与边交点的x坐标（边的低端点的x坐标） int y_max; //边的高端点的y坐标ymax double inverse_k; //斜率k的倒数 EdgeNode *next; //下一个边结点的指针};//有效边表struct ActiveEdgeTable{ int y; //扫描线y EdgeNode *head; //边链表的头指针};//桶结点typedef struct Bucket{ int y; //扫描线y EdgeNode *head; //边链表的头指针 Bucket *next; //下一个桶的指针} EdgeTable;int compare(Point p1, Point p2);Line* create_lines(Point points[], int n);Point get_lowest_point(Line lines[], int n);Point get_highest_point(Line lines[], int n);void swap(Line l1, Line l2);void sort(Line lines[], int n);EdgeTable* create_edge_table(Line lines[], int n);ActiveEdgeTable* init_active_table(EdgeTable *edge_table);void delete_edge(ActiveEdgeTable *active_table, int y_max);void add_edge(ActiveEdgeTable *active_table, EdgeNode edge);ActiveEdgeTable* update_active_table(ActiveEdgeTable *active_table, EdgeTable *edge_table);void DrawPolygon(Point points, int n);void DrawGrid(int x, int y);void Fill(Point points[], int n);void Initial();void Display();int main(int argc, char* argv[]){glutInit(argc, argv);glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);glutInitWindowSize(400, 300);glutInitWindowPosition(100, 120);glutCreateWindow(Polygon Filling);glutDisplayFunc(Display);Initial();glutMainLoop(); return 0;}//比较2个点的高度int compare(Point p1, Point p2){ if (p1.y p2.y) return 1; else if (p1.y == p2.y) return 0; return -1;}//由点数组生成线段数组Line* create_lines(Point points[], int n){Line *lines = (Line*)malloc(n * sizeof(Line));for (int i = 0; i n; ++i){Point p1 = points[i];Point p2