uva 10652 凸包 + 更新版计算几何模板

题意：

给一些木板的中心点，给木板的长和宽还有倾斜角度，求把这些木板包起来的凸包面积。

求他们的面积比。

解析：

计算集合。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long

using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);

/
struct Point
{
    double x, y;
    Point(double x = 0, double y = 0) : x(x), y(y){}
};

bool cmp(Point A, Point B)
{
    if (A.x == B.x)
        return A.y < B.y;
    return A.x < B.x;
}

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);
}

bool operator < (const Point& a, const Point& b)
{
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}

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 Cross(B - A, C - A);
}

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

Vector Normal(Vector A)//µ¥Î»·¨Ïß turn left 90 degrees
{
    double L = Length(A);
    return Vector(-A.y / L, A.x / L);
}

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;
}

double DistanceToLine(Point P, Point A, Point B)
{
    Vector v1 = B - A;
    Vector 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;
    Vector v2 = P - A;
    Vector 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);
}

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;
}

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

double ConvexPolygonArea(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.0;
}

double torad(double deg)
{
    return deg / 180 * pi;
}

int ConvexHull(Point* p, int n, Point* ch)
{
    sort(p, p + n, cmp);
    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 readPoint()
{
    double x, y;
    scanf("%lf %lf", &x, &y);
    return Point(x, y);
}

//

const int maxn = 2500 + 10;

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    Point p[maxn], ch[maxn];
    int ncase;
    scanf("%d", &ncase);
    int ca = 1;
    while (ncase--)
    {
        int n, pc = 0;
        double area1 = 0;
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
        {
            double x, y, w, h, j, ang;
            scanf("%lf%lf%lf%lf%lf", &x, &y, &w, &h, &j);
            Point o(x, y);
            ang = -torad(j);
            p[pc++] = o + Rotate(Vector(-w / 2, - h / 2), ang);
            p[pc++] = o + Rotate(Vector(w / 2, -h / 2), ang);
            p[pc++] = o + Rotate(Vector(-w / 2, h / 2), ang);
            p[pc++] = o + Rotate(Vector(w / 2, h / 2), ang);
            area1 += w * h;
        }
        int m = ConvexHull(p, pc, ch);
        double area2 = ConvexPolygonArea(ch, m);
        printf("%.1lf %%\n", area1 * 100 / area2);
    }
    return 0;
}