UVA 11437 Triangle Fun

最新推荐文章于 2020-11-14 22:22:12 发布

Wall_F

最新推荐文章于 2020-11-14 22:22:12 发布

阅读量932

点赞数

分类专栏： UVA（训练指南）

本文链接：https://blog.csdn.net/Wall_F/article/details/8757823

版权

UVA（训练指南）专栏收录该内容

34 篇文章 0 订阅

订阅专栏

本文介绍了一种通过向量运算快速计算任意四边形面积的算法，利用点、向量、直线交点和叉积的概念，实现了一种简洁且高效的面积计算方法。该算法首先通过向量定比分点公式获取关键点坐标，然后求解直线交点确定四边形边界，最后使用叉积计算面积。通过实例演示了算法的应用过程，并提供了完整代码实现。

摘要由CSDN通过智能技术生成

大意略。

思路：我的思路比较蠢，把所有坐标求出来，然后再求直线与直线的交点，最后通过叉积算面积即可。

坐标可以通过向量定比分点公式计算：

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;

const double eps = 1e-10;
const double PI = acos(-1.0);

struct Point
{
	double x, y;
	Point(double x = 0, double y = 0) : x(x), y(y) { }
	bool operator < (const Point& a) const
	{
		if(a.x != x) return x < a.x;
		return y < a.y;
	}
};

typedef Point Vector;

Vector operator + (Vector A, Vector B) { return Vector(A.x+B.x, A.y+B.y); }

Vector operator - (Point A, Point B) { return Vector(A.x-B.x, A.y-B.y); }

Vector operator * (Vector A, double p) { return Vector(A.x*p, A.y*p); }

Vector operator / (Vector A, double p) { return Vector(A.x/p, A.y/p); }

int dcmp(double x)
{
	if(fabs(x) < eps) return 0; else return x < 0 ? -1 : 1;
}

bool operator == (const Point& a, const Point &b)
{
	return dcmp(a.x-b.x) == 0 && dcmp(a.y-b.y) == 0;
}

double Dot(Vector A, Vector B) { return A.x*B.x + A.y*B.y; }
double Length(Vector A) { return sqrt(Dot(A, A)); }
double Angle(Vector A, Vector B) { return acos(Dot(A, B) / Length(A) / Length(B)); }

double Cross(Vector A, Vector B) { return A.x*B.y - A.y*B.x; }
double Area2(Point A, Point B, Point C) { return fabs(Cross(B-A, C-A)) / 2; }

Vector Rotate(Vector A, double rad)
{
	return Vector(A.x*cos(rad)-A.y*sin(rad), A.x*sin(rad) + A.y*cos(rad));
}

Point GetLineIntersection(Point P, Vector v, Point Q, Vector w)
{
	Vector u = P-Q;
	double t = Cross(w, u) / Cross(v, w);
	return P+v*t;
}

bool SegmentProperIntersection(Point a1, Point a2, Point b1, Point b2)
{
	double c1 = Cross(a2-a1, b1-a1), c2 = Cross(a2-a1, b2-a1);
	double c3 = Cross(b2-b1, a1-b1), c4 = Cross(b2-b1, a2-b1);
	return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0;
}

double PolygonArea(Point* p, int n)
{
	double area = 0;
	for(int i = 1; i < n-1; i++)
		area += Cross(p[i]-p[0], p[i+1]-p[0]);
	return area/2;
}

bool OnSegment(Point p, Point a1, Point a2)
{
	return dcmp(Cross(a1-p, a2-p)) == 0 && dcmp(Dot(a1-p, a2-p)) < 0;
}

double DistanceToLine(Point P, Point A, Point B)
{
	Vector v1 = B-A, v2 = P-A;
	return fabs(Cross(v1, v2)) / Length(v1);
}

double DistanceToSegment(Point P, Point A, Point B)
{
	if(A == B) return Length(P-A);
	Vector v1 = B-A, v2 = P-A, v3 = P-B;
	if(dcmp(Dot(v1, v2) < 0)) return Length(v2);
	else if(dcmp(Dot(v1, v3) > 0)) return Length(v3);
	else return fabs(Cross(v1, v2)) / Length(v1);
}

int ConvexHull(Point *p, int n, Point *ch) //凸包 
{
	sort(p, p+n);
	n = unique(p, p+n) - p; //去重 
	int m = 0;
	for(int i = 0; i < n; i++)
	{
		while(m > 1 && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
		ch[m++] = p[i];
	}
	int k = m;
	for(int i = n-2; i >= 0; i--)
	{
		while(m > k && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
		ch[m++] = p[i];
	}
	if(n > 1) m--;
	return m;
}

Point read_point()
{
	Point A;
	scanf("%lf%lf", &A.x, &A.y);
	return A;
}

Point A, B, C, D, E, F, P, Q, R;

void read_case()
{
	A = read_point();
	B = read_point();
	C = read_point();
}

void build()
{
	Vector Va, Vb, Vc;
	F = Point((2*A.x+B.x)/3, (2*A.y+B.y)/3);
	D = Point((2*B.x+C.x)/3, (2*B.y+C.y)/3);
	E = Point((2*C.x+A.x)/3, (2*C.y+A.y)/3);
	Va = F-C, Vb = E-B, Vc = D-A;
	R = GetLineIntersection(C, Va, A, Vc);
	P = GetLineIntersection(A, Vc, B, Vb);
	Q = GetLineIntersection(B, Vb, C, Va);
}

void solve()
{
	read_case();
	build();
	double area = Area2(R, P, Q);
	printf("%.0lf\n", area);
}

int main()
{
	int T;
	scanf("%d", &T);
	while(T--)
	{
		solve();
	}
	return 0;
}