Pick定理:具体看http://episte.math.ntu.edu.tw/articles/sm/sm_25_10_1/index.html
简要说明:对于格点多边形(即在一个网格中,所有的顶点均在格点上的多边形),其面积公式 A = b / 2 + i - 1;
其中b为在边上的格点数,i为在多边形内部的格点数
格点多边形边上的格点数b的求法:每条边上的格点数相加
假设给定边e,两端点为p1(x1,y1),(x2,y2);则边e上的格点数为GCD(x2-x1,y2-y1),注意:此处求出的格点数只包含一个端点。GCD为最大公约数
poj1265:给定一个格点多边形,求出内部点数i,边上点数b,和面积a
面积用叉积求,b用上述方法求,i由公式得
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int GCD(int a, int b) {
while (b) {
int r = b;
b = a % b;
a = r;
}
return a;
}
int main()
{
int t, cas, n, i, x1, y1, x2, y2, dx, dy, on, in, area;
scanf ("%d", &cas);
for (t = 1; t <= cas; t++) {
scanf ("%d", &n);
x1 = y1 = on = area = 0;
for (i = 1; i <= n; i++) {
scanf ("%d%d", &dx, &dy);
x2 = x1 + dx;
y2 = y1 + dy;
on += GCD(abs(dx), abs(dy));
area += x1 * y2 - x2 * y1;
x1 = x2;
y1 = y2;
}
in = (area + 2 - on) / 2;
printf ("Scenario #%d:\n%d %d %.1lf\n\n", t, in, on, area/2.0);
}
return 0;
}
poj2954:给出三角形的三个顶点,求内部点个数
#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;
int GCD(int a, int b) {
if (!b) return a;
return GCD(b, a%b);
}
int main()
{
int x1, y1, x2, y2, x3, y3;
while (scanf ("%d%d%d%d%d%d", &x1, &y1, &x2, &y2, &x3, &y3)) {
if (!x1 && !y1 && !x2 && !y2 && !x3 && !y3) break;
int area = (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1);
int on = GCD(abs(x2-x1), abs(y2-y1)) + GCD(abs(x3-x2), abs(y3-y2)) + GCD(abs(x1-x3), abs(y1-y3));
printf ("%d\n", (abs(area)-on+2)/2);
}
return 0;
}