C++作业凸多边形的三角剖分_c++ 三角形剖分代码

手动输入顶点的个数，然后分别输入顶点的坐标，得出结果为依次划分的三角形的顶点（序号）
#include
#include <math.h>
using namespace std;

void MinWeightTriangulation(int n, int **t, int **s);
void Traceback(int i, int j, int **s);//构造最优解
int Weight(int a, int b, int c);//权函数
int x;
int z[20][2];
int main()
{

cin >> x;//输入顶点的个数
for (int i = 0; i < x; i++) {
	cin >> z[i][0];
	cin >> z[i][1];
	
}
int **s = new int *[x];
int **t = new int *[x];
for (int i = 0; i < x; i++)
{
	s[i] = new int[x];
	t[i] = new int[x];
}

MinWeightTriangulation(x - 1, t, s);
Traceback(1, x-1, s); //s[i][j]记录了Vi-1和Vj构成三角形的第3个顶点的位置  

return 0;
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

}

void MinWeightTriangulation(int n, int **t, int **s)
{
for (int i = 1; i <= n; i++)
{
t[i][i] = 0;
}
for (int r = 2; r <= n; r++)
{
for (int i = 1; i <= n - r + 1; i++)
{
int j = i + r - 1;

		t[i][j] = t[i + 1][j] + Weight(i - 1, i, j);
		s[i][j] = i;
		for (int k = i + 1; k < i+r-1; k++)
		{
			int u = t[i][k] + t[k + 1][j] + Weight(i - 1, k, j);
			if (u < t[i][j])
			{
				t[i][j] = u;
				s[i][j] = k;
			}
		}
	}
}
1
2
3
4
5
6
7
8
9
10
11
12
13

}

void Traceback(int i, int j, int **s)
{
if (i == j) return;
Traceback(i, s[i][j], s);
Traceback(s[i][j] + 1, j, s);
cout << i - 1 << s[i][j] << j << endl;
}

int Weight(int a, int b, int c)
{
int quan;
quan = sqrt((z[a][0] - z[b][0])(z[a][0] - z[b][0]) + (z[a][1] - z[b][1])(z[a][1] - z[b][1])) + sqrt((z[a][0] - z[c][0])(z[a][0] - z[c][0]) + (z[a][1] - z[c][1])(z[a][1] - z[c][1])) + sqrt((z[c][0] - z[b][0])(z[c][0] - z[b][0]) + (z[c][1] - z[b][1])(z[c][1] - z[b][1]));
return quan;
}