使用openGL,利用多边形填充的扫描线算法画出实心五边形

具体内容参考博客:https://blog.csdn.net/qq_38345598/article/details/84553043

实心五边形

任意给定5个顶点坐标,利用多边形填充的扫描线算法编写程序,生成一个实心五边形。

运行截图

在这里插入图片描述

代码(转载)

#include <GL/glut.h>
#include <windows.h>
const int POINTNUM = 5;
typedef struct XET{
	float x;
	float dx, ymax;
	XET* next;
}AET, NET;
struct point{
	float x;
	float y;
}
point[POINTNUM] = { 400, 100, 500, 250, 275, 400, 50, 250, 150, 100};
void PolyScan(){
	int MaxY = 0;
	int i;
	for (i = 0; i < POINTNUM; i++){
		if (point[i].y > MaxY)
			MaxY = point[i].y;
	}
	AET *pAET = new AET;
	pAET->next = NULL;
 
	NET *pNET[1024];
	for (i = 0; i <= MaxY; i++){
		pNET[i] = new NET;
		pNET[i]->next = NULL;
	}
	glClear(GL_COLOR_BUFFER_BIT);
	glColor3f(0.0, 0.0, 0.0);
	glBegin(GL_POINTS);
	for (i = 0; i < MaxY; i++){
		for (int j = 0; j < POINTNUM; j++){
			if (point[j].y == i){
				if (point[(j - 1 + POINTNUM) % POINTNUM].y > point[j].y){
					NET *p = new NET;
					p->x = point[j].x;
					p->ymax = point[(j - 1 + POINTNUM) % POINTNUM].y;
					p->dx = (point[(j - 1 + POINTNUM) % POINTNUM].x - point[j].x) / (point[(j - 1 + POINTNUM) % POINTNUM].y - point[j].y);
					p->next = pNET[i]->next;
					pNET[i]->next = p;
				}
				
				if (point[(j + 1 + POINTNUM) % POINTNUM].y > point[j].y){
					NET *p = new NET;
					p->x = point[j].x;
					p->ymax = point[(j + 1 + POINTNUM) % POINTNUM].y;
					p->dx = (point[(j + 1 + POINTNUM) % POINTNUM].x - point[j].x) / (point[(j + 1 + POINTNUM) % POINTNUM].y - point[j].y);
					p->next = pNET[i]->next;
					pNET[i]->next = p;
				}
			}
		}
	}
	for (i = 0; i <= MaxY; i++){
		NET *p = pAET->next;
		while (p){
			p->x = p->x + p->dx;
			p = p->next;
		}
		AET *tq = pAET;
		p = pAET->next;
		tq->next = NULL;
		while (p){
			while (tq->next && p->x >= tq->next->x)
				tq = tq->next;
			NET *s = p->next;
			p->next = tq->next;
			tq->next = p;
			p = s;
			tq = pAET;
		}
		AET *q = pAET;
		p = q->next;
		while (p){
			if (p->ymax == i){
				q->next = p->next;
				delete p;
				p = q->next;
			}
			else{
				q = q->next;
				p = q->next;
			}
		}
		p = pNET[i]->next;
		q = pAET;
		while (p){
			while (q->next && p->x >= q->next->x)
				q = q->next;
			NET *s = p->next;
			p->next = q->next;
			q->next = p;
			p = s;
			q = pAET;
		}
		p = pAET->next;
		while (p && p->next){
			for (float j = p->x; j <= p->next->x; j++){
				glVertex2i(static_cast<int>(j), i);
			}
			p = p->next->next;
		}
	}
	glEnd();
	glFlush();
}
void main(int argc, char* argv){
	glutInit(&argc, &argv);
	glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
	glutInitWindowPosition(400, 100);
	glutInitWindowSize(800, 600);
	glutCreateWindow("扫描线算法-实心五边形");
	glClearColor(1.0, 1.0, 1.0, 0.0);
	glMatrixMode(GL_PROJECTION);
	gluOrtho2D(0.0, 600.0, 0.0, 450.0);
	glutDisplayFunc(PolyScan);
	glutMainLoop();
}
  • 1
    点赞
  • 28
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值