计算几何进阶(一)

题意: 在一个平面内给定一个点集, 要求在这些点中找到一个三角形, 而且要求这个三角形内没有点(包括三角形的三条边)

>> face <<

strategy: 默认点1, 2, 3为答案, 当三角形内部有点时,我就更新1, 2, 3为新的点

Complexity : O(n)

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define oo INT_MAX
#define ll long long
#define db double
#define all(a) a.begin(), a.end()
#define met(a, b) memset(a, b, sizeof(a))
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define lowbit(x) x &(-x)
#define pi acos(-1.0)
using namespace std;
using namespace __gnu_pbds;
const int maxn = 100009;
const db eps = 1e-6;
// FILE *o = freopen("C:\\Users\\Jason.Z\\Desktop\\in.txt", "r", stdin);
// assert(o != NULL);
// FILE *e = freopen("C:\\Users\\Jason.Z\\Desktop\\y[i].txt", "w", stdout);
// assert(e != NULL);
vector <pair<ll, ll> > q(maxn);
inline pair<ll, ll> operator - (const  pair<ll, ll> &a, const  pair<ll, ll>& b){
    return {a.first - b.first, a.second - b.second};
}
inline ll operator*(pair<ll, ll> a, pair<ll, ll> b){
    return a.first * b.second - a.second * b.first;
}
bool in_line(pair<ll, ll> & a, pair<ll, ll> & b, pair<ll, ll> c){
    return (b - a) * (c - b) == 0;
}
bool in_triangle(pair<ll, ll> a, pair<ll, ll> b, pair<ll, ll> c, pair<ll,ll>  d ){
    if((b - a) * (c - a) < 0)swap(b, c);//逆时针排序
    return ((c - a) * (d - a) <= 0 && (b - c) * (d - c) <= 0 && (a - b) * (d - b) <= 0);
}
int main(){
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    int ans1 = 1, ans2 = 2, ans3 = 3;
    _rep(i, 1, n){
        cin >> q[i].first >> q[i].second;
    }
    while (in_line(q[ans1], q[ans2], q[ans3]))ans3++;
    _rep(i, 1, n){
        if(i != ans1 && i != ans2 && i != ans3 && in_triangle(q[ans1], q[ans2], q[ans3], q[i])){
            if(in_line(q[ans1], q[ans2], q[i])) ans1 = i;
            else if(in_line(q[ans1], q[ans3], q[i])) ans1 = i;
            else if(in_line(q[ans2], q[ans3], q[i])) ans2 = i;
            else ans1 = i;
        }
    }
    printf("%d %d %d\n", ans1, ans2, ans3);
}

Strategy2 : 把所有的点按X-Y轴升序排列, 选出最底下的两个点, 然后往上找,如果找到一个不和前两个点共线的点, 就输出, 画个图就比较显然了.

Complexity : O(log(n))

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define oo INT_MAX
#define ll long long
#define db double
#define all(a) a.begin(), a.end()
#define met(a, b) memset(a, b, sizeof(a))
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define lowbit(x) x &(-x)
#define pi acos(-1.0)
#define what_is(x) cerr << #x << " is " << x << endl;
using namespace std;
using namespace __gnu_pbds;
const int maxn = 100009;
const db eps = 1e-6;
// FILE *o = freopen("C:\\Users\\Jason.Z\\Desktop\\in.txt", "r", stdin);
// assert(o != NULL);
// FILE *e = freopen("C:\\Users\\Jason.Z\\Desktop\\y[i].txt", "w", stdout);
// assert(e != NULL);
vector <pair<ll, ll> > q(maxn);
inline pair<ll, ll> operator - (const  pair<ll, ll> &a, const  pair<ll, ll>& b){
    return {a.first - b.first, a.second - b.second};
}
inline ll operator*(pair<ll, ll> a, pair<ll, ll> b){
    return a.first * b.second - a.second * b.first;
}
bool in_line(pair<ll, ll> & a, pair<ll, ll> & b, pair<ll, ll> c){
    return (b - a) * (c - b) == 0;
}
bool in_triangle(pair<ll, ll> a, pair<ll, ll> b, pair<ll, ll> c, pair<ll,ll>  d ){
    if((b - a) * (c - a) < 0)swap(b, c);//逆时针排序
    return ((c - a) * (d - a) <= 0 && (b - c) * (d - c) <= 0 && (a - b) * (d - b) <= 0);
}
inline db area(pair<ll, ll> a, pair<ll, ll> b, pair<ll, ll> c){
    return fabs((b - a) * (c - a)) / 2;
}
map<pair<ll, ll >, int> mp;
int main(){
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    int ans1 = 1, ans2 = 2, ans3 = 3;
    _rep(i, 1, n){
        cin >> q[i].first >> q[i].second;
        mp[{q[i].first, q[i].second}] = i;
    }
    sort(q.begin() + 1, q.begin() + 1 + n);
    _rep(i, 3, n){
        if(!in_line(q[1], q[2], q[i])){
            printf("%d %d %d\n",mp[{q[1].first, q[1].second}] ,mp[{q[2].first, q[2].second}] , mp[{q[i].first, q[i].second}]);
            break;
        }
    }

}