poj初期 计算几何

 

第七个专题了，初期计算几何：

(1)、基本公式

拿了白书上面的三个例题做做。。。

1、uva 11178
题意：作三角形ABC每个内角的三等分线，相交成三角形DEF，则DEF是等边三角形。已知A，B，C三点坐标，问D,E,F三点坐标。
分析：简单的求直线交点、内角等分线可以通过直线旋转角度求出。

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

typedef long long LL;
const double EPS = 1e-10;
const int INF = 0x3f3f3f3f;
const int N = 310;
int dcmp(double x) {return abs(x) < EPS ? 0 : x < 0 ? 1 : -1;}
struct po {
    double x, y;
    po(double x = 0, double y = 0) : x(x), y(y) {}
    inline void in() { scanf("%lf %lf", &x, &y); }
    inline double length() { return sqrt(x * x + y * y); }
};
inline po operator + (po a, po b) { return po(b.x + a.x, b.y + a.y); }
inline po operator - (po a, po b) { return po(a.x - b.x, a.y - b.y); }
inline po operator * (po a, double d) { return po(a.x * d, a.y * d); }
inline po operator / (po a, double d) { return po(a.x / d, a.y / d); }
inline bool operator < (const po &a, const po &b)  { return a.x == b.x ? a.y < b.y : a.x < b.x; }
inline bool operator == (const po &a, const po &b) { return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0; }
inline double dot(po a, po b) { return a.x * b.x + a.y * b.y; }//点积
inline double det(po a, po b) { return a.x * b.y - a.y * b.x; }//叉积
//求出以向量a绕起点逆时针旋转a角度之后该向量的坐标
inline po rot(po a, double rad) { return po(a.x * cos(rad) - a.y * sin(rad), a.x * sin(rad) + a.y * cos(rad)); }
double angle(po a, po b) {return acos(dot(a, b) / a.length() / b.length()); }//求向量a和b之间的角度
double area(po a, po b, po c) { return det(b - a, c - a); }//求出以ab、ac为邻边组成的三角形的面积
inline po normal(po a) {
    double l = a.length();
    return po(-a.y / l, a.x / l);
}
//求出直线p1+tv和直线q+tw的交点，v和w为方向向量
po getlineintersection(po p, po v, po q, po w) {
    po u = p - q;
    double t = det(w, u) / det(v, w);
    return p + v * t;
}
//求出p1、p2点确定的直线与q1、q2点确定的直线的交点，使用确保两条直线不会平行
po intersection(po p1, po p2, po q1, po q2) { return p1 + (p2 - p1) * det(q2 - q1, q1 - p1) / det(q2 - q1, p2 - p1); }
//线段相交判定
bool SegmentProperIntersection(po a1, po a2, po b1, po b2) {
    double c1 =  det(a2 - a1, b1 - a1), c2 = det(a2 - a1, b2 - a1),
           c3 =  det(b2 - b1, a1 - b1), c4 = det(b2 - b1, a2 - b1);
    return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0;
}
//判断一个点是否在一条线段上（不包含端点）.
bool Onsegment(po p, po a1, po a2) { return dcmp(det(a1 - p, a2 - p)) == 0 && dcmp(dot(a1 - p, a2 - p)) < 0; }
double DistanceToLine(po q, po a, po b) {//求出q点到直线ab的距离。
    po v1 = b - a, v2 = q - a;
    return abs(det(v1, v2)) / v1.length();
}
double DistanceToSegment(po q, po a, po b) {//求出点q到线段ab之间的距离
    if (a == b) return (q - a).length();
    po v1 = b - a, v2 = q - a, v3 = q - b;
    if (dcmp(dot(v1, v2)) < 0) return v2.length();
    if (dcmp(dot(v1, v3)) > 0) return v3.length();
    return abs(det(v1, v2)) / v1.length();
}
po GetLinePorjection(po q, po a, po b) {//获得点q在直线ab上的投影
    po v = b - a;
    return a + v * dot(v, q - a) / dot(v, v);
}
po solve(po a, po b, po c){
    po v1 = rot(c - b, angle(a - b, c - b) / 3);
    po v2 = rot(b - c, -angle(a - c, b - c) / 3);
    return getlineintersection(b, v1, c, v2);
}
int main() {
    int t;
    scanf("%d", &t);
    while (t--){
        po a, b, c;
        a.in(); b.in(); c.in();
        po d = solve(a, b, c), e = solve(b, c, a), f = solve(c, a, b);
        printf("%.6f %.6f %.6f %.6f %.6f %.6f\n", d.x, d.y, e.x, e.y, f.x, f.y);
    }
    return 0;
}

2、uvalive 3263

题意：给定一个一笔画构成的平面图的点、求出这一笔画把整个平面分成了几个部分。
分析：根据欧拉定理可以求出面数，假设一个平面图的点数为V，边数为E，则面数F = E + 2 – V。点数可以把所有直线的交点求出后去重得出、至于边数，可以枚举每一个点，如果一个点在一条边上，那么增加一条边。

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

const double EPS = 1e-10;
const int INF = 0x3f3f3f3f;
const int N = 310;
int dcmp(double x) { return abs(x) < EPS ? 0 : x < 0 ? -1 : 1; }
struct po {
    double x, y;
    po(double x = 0, double y = 0) : x(x), y(y) {}
    inline void in() { scanf("%lf %lf", &x, &y); }
    inline void out() { printf("%f %f", x, y); }
    inline double length() { return sqrt(x * x + y * y); }
};
inline po operator + (po a, po b) { return po(b.x + a.x, b.y + a.y); }
inline po operator - (po a, po b) { return po(a.x - b.x, a.y - b.y); }
inline po operator * (po a, double d) { return po(a.x * d, a.y * d); }
inline po operator / (po a, double d) { return po(a.x / d, a.y / d); }
inline bool operator < (const po &a, const po &b)  { return a.x == b.x ? a.y < b.y : a.x < b.x; }
inline bool operator == (const po &a, const po &b) { return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0; }
inline double dot(po a, po b) { return a.x * b.x + a.y * b.y; }//点积
inline double det(po a, po b) { return a.x * b.y - a.y * b.x; }//叉积
//求出以向量a绕起点逆时针旋转a角度之后该向量的坐标
inline po rot(po a, double rad) { return po(a.x * cos(rad) - a.y * sin(rad), a.x * sin(rad) + a.y * cos(rad)); }
double angle(po a, po b) {return acos(dot(a, b) / a.length() / b.length()); }//求向量a和b之间的角度
double area(po a, po b, po c) { return det(b - a, c - a); }//求出以ab、ac为邻边组成的三角形的面积
inline po normal(po a) {
    double l = a.length();
    return po(-a.y / l, a.x / l);
}
//求出直线p1+tv和直线q+tw的交点，v和w为方向向量
po getlineintersection(po p, po v, po q, po w) {
    po u = p - q;
    double t = det(w, u) / det(v, w);
    return p + v * t;
}
//求出p1、p2点确定的直线与q1、q2点确定的直线的交点，使用确保两条直线不会平行
po intersection(po p1, po p2, po q1, po q2) { return p1 + (p2 - p1) * det(q2 - q1, q1 - p1) / det(q2 - q1, p2 - p1); }
//线段相交判定
bool SegmentProperIntersection(po a1, po a2, po b1, po b2) {
    double c1 =  det(a2 - a1, b1 - a1), c2 = det(a2 - a1, b2 - a1),
           c3 =  det(b2 - b1, a1 - b1), c4 = det(b2 - b1, a2 - b1);
    return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0;
}
//判断q点是否在p1、p2点组成的线段上
//bool on_seg(po p1, po p2, po q) { return (p1 - q).det(p2 - q) == 0 && (p1 - q).dot(p2 - q) <= 0; }
bool OnSegment(po p, po a1, po a2) { return dcmp(det(a1 - p, a2 - p)) == 0 && dcmp(dot(a1 - p, a2 - p)) < 0; }

double DistanceToLine(po q, po a, po b) {//求出q到直线ab的距离。
    po v1 = b - a, v2 = q - a;
    return abs(det(v1, v2)) / v1.length();
}
double DistanceToSegment(po q, po a, po b) {//求出点q到线段ab之间的距离
    if (a == b) return (q - a).length();
    po v1 = b - a, v2 = q - a, v3 = q - b;
    if (dcmp(dot(v1, v2)) < 0) return v2.length();
    if (dcmp(dot(v1, v3)) > 0) return v3.length();
    return abs(det(v1, v2)) / v1.length();
}
po GetLinePorjection(po q, po a, po b) {//获得点q在直线ab上的投影
    po v = b - a;
    return a + v * dot(v, q - a) / dot(v, v);
}
po p[N], v[N*N];
int main() {
    int n, k = 0;
    while (scanf("%d", &n), n) {
        for (int i = 0; i < n; i++) p[i].in();
        memcpy(v, p, sizeof(po) * n);
        n--;
        int e = n, c = n;
        for (int i = 0; i < n; i++)
            for (int j = i + 2; j < n; j++)
                if (SegmentProperIntersection(p[i], p[i+1], p[j], p[j+1]))
                    v[c++] = intersection(p[i], p[i+1], p[j], p[j+1]);
        sort(v, v + c);
        c = unique(v, v + c) - v;
        for (int i = 0; i < c; i++)
            for (int j = 0; j < n; j++)
                if (OnSegment(v[i], p[j], p[j+1])) e++;
        printf("Case %d: There are %d pieces.\n", ++k, e + 2 - c);
    }
    return 0;
}

3、uva 11796