凸包 Graham扫描法

凸包函数模板

Graham扫描法 简单概括就是 排序+扫描

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 20000 ;
struct Point {
    double x,y,len ;
}Stack[maxn] , Pt[maxn] , Point_A ;

double Cross(Point a , Point b , Point c) {                 //向量叉积
    return (b.x-a.x)*(c.y-a.y) - ( b.y-a.y)*(c.x-a.x) ;
}
double Dis( Point a , Point b) {
    return sqrt((a.x-b.x)*(a.x-b.x) + ( a.y-b.y)*(a.y-b.y)) ;
}
void FindPoint( int n ) {                                   //找最左下角的点为起点
    int tempNumber = 0 ;
    Point_A = Pt[0] ;
    for( int i = 0 ; i < n ; ++i ) {
        if( Pt[i].y < Point_A.y || Pt[i].y == Point_A.y && Pt[i].x < Point_A.x) {
            Point_A = Pt[i] ;                               // 利用了||短路特性
            tempNumber = i ;
        }
    }
    Point tempPoint ;
    tempPoint = Pt[0] ;
    Pt[0] = Pt[tempNumber];
    Pt[tempNumber] = tempPoint ;
}
bool Cmp( Point a , Point b ) {                             //极角排序
    double k = Cross(Point_A , a , b) ;
    if( k > 0 ) return true ;                               //边(Point_A,a)在（Point_A,b)逆时针方向
    if( k < 0 ) return false ;                              //边(Point_A,a)在（Point_A,b)顺时针方向
    a.len = Dis(Point_A,a) ;
    b.len = Dis(Point_A,b) ;
    return a.len < b.len ;                                  //各点到Point_A距离按从小到大排序
}
int Graham(int n ) {
    int top = 2;
    Stack[0] = Pt[0] ;
    Stack[1] = Pt[1] ;
    Stack[2] = Pt[2] ;
    Pt[n] = Pt[0] ;                                         //首尾相接
    for( int i = 3 ; i <= n ; ++i ) {                       //判断转向，若顺时针则>0 , 相同则==0 ， 逆时针<0
        while( Cross(Stack[top-1] , Stack[top] , Pt[i] ) <= 0 && top > 1 ) --top ;
        Stack[++top] = Pt[i] ;                              //极角排序后，前两个点组成的边必定为有效边。
    }
    return top ;                                            // Stack[0] ..Stack[top-1] 即为所求
}

int main() {
    int Num ;
    while(~scanf("%d",&Num)) {
        for(int i = 0 ; i < Num ; ++i ) {
            scanf("%lf%lf",&Pt[i].x,&Pt[i].y) ;
        }
        FindPoint(Num) ;
        sort(Pt, Pt+Num , Cmp) ;
        int num = Graham(Num) ;
        cout << num << endl ;
        for( int i = 0 ; i < num ; ++i ){               //打印各点
            cout << Stack[i].x << " " << Stack[i].y << endl ;
        }
    }
    return 0 ;
}