[OpenGL] 绘制并且判断凹凸多边形、自相交多边形。

#include <iostream>
#include <ctime>
#include <GL/glut.h>
#include <math.h>
#include <vector>

using namespace std;

struct Pos
{
	int x;
	int y;
};

struct Edge
{
	int x1, x2;
	int y1, y2;
	int vx;
	int vy;
	int a, b, c;
};

struct Poly
{
	// 点集
	int xx[100];
	int yy[100];

	// 边集
	Edge Edges[100];

	int plotNums = 0; //点数量
	int edgeNums = 0; //边数量

	// 记录凹点
	int conv = 0;
};

Poly poly;


// 求交点坐标
Pos CrossPos(int p1,int p2){
	Pos res;
	int A1 = poly.Edges[p1].a;
	int B1 = poly.Edges[p1].b;
	int A2 = poly.Edges[p2].a;
	int B2 = poly.Edges[p2].b;
	int C1 = poly.Edges[p1].c;
	int C2 = poly.Edges[p2].c;

	int m = A1 * B2 - A2 * B1;
	if (m == 0)
		cout <<"第"<<p1<<"边和第"<<p2<<"边"<< "无交点" << endl;
	else
	{
		res.x = (C2*B1 - C1 * B2) / m;
		res.y = (C1*A2 - C2 * A1) / m;