QuickHull 快速凸包算法

资料

http://hivemined.ir/wp-content/uploads/2012/04/convexHull.pdf

http://en.literateprograms.org/Quickhull_%28Python%2C_arrays%29

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <ctime>
using namespace std;

#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define UREP(i, s, t) for(int (i)=(s);(i)>=(t);--(i))

const double eps = 1e-5;
const int INF = 0x7FFFFFFF;
struct Point {
    double x, y;
    Point(){};
    Point(double x, do