扫瞄线填充算法 AND 高斯抗锯齿算法

#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

const int maxX = 1080, maxY = 1920, maxP = 100;

int num[maxX][maxY];

const double eps = 1e-6, Pi = 4 * atan(1);

struct Point {
	double x, y;

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

double operator * (Point a, Point b) {
	return a.x * b.x + a.y * b.y;
}

Point operator - (Point a, Point b) {
	return Point(a.x - b.x, a.y - b.y);
}

double operator ^ (Point a, Point b) {
	return a.x * b.y - a.y * b.x;
}

double mod(Point a) {
	return sqrt(a * a * 1.0);
}

double theta(Point a, Point b) {
	double csin = (a ^ b) / mod(a) / mod(b);
	double ccos = (a * b) / mod(a) / mod(b);
	return atan2(csin, ccos);
}

const int val[5][5] = {
	 18,  73, 116,  73,  18,
	 73, 293, 464, 293,  73,
	116, 464, 735, 464, 116,