【boost使用之多边形合并】

        最近搞一个图形绘制的程序，在绘制多边形的时候需要提供相交合并的功能，正好前几天在看boost的多边形处理，直接拿来用了。

#include <boost/geometry.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <vector>

typedef boost::geometry::model::d2::point_xy<double> boost_point;
typedef boost::geometry::model::polygon<boost_point> boost_Polygon;

struct Point
{
    float x;
    float y;
    Point(float _x,float _y)
    {
        x = _x;
        y = _y;
    }
    Point(const boost_point & pt)
	{
		x = pt.x();
		y = pt.y();
	}
    operator boost_point()
	{
		return boost_point(x, y);
	}
}

bool PointInPolygon(std::vector<Point> vPoints,Point point)
{
    float testx = point.x;
	float testy = point.y;
	size_t nvert = vPoints.size();
	int c = 0;
	for (size_t i = 0, j = nvert - 1; i < nvert; j =i, ++i)
	{
		if (((vPoints[i].y > testy) != (vPoints[j].y > testy)) &&\
			(testx < (vPoints[j].x - vPoints[i].x) * (testy - vPoints[i].y)\
            / (vPoints[j].y - vPoints[i].y) + vPoints[i].x))
			c = !c;
	}
	return c;
}
double GetArea(std::vector<Point> &vPoints)
{
	double dArea;
	if (vPoints.size() < 3) return 0;
	dArea = vPoints[0].y*(vPoints[vPoints.size() - 1].x - vPoints[1].x);
	for (int i = 1; i < vPoints.size(); i++)
	{
		dArea += vPoints[i].y*(vPoints[(i - 1)].x - vPoints[(i + 1) % vPoints.size()].x);
	}
	return dArea / 2;
}

boost_Polygon vec2BoostPolygon(std::vector<Point> &vPoints)
{
        boost_Polygon rlt;
		if (vPoints.size() > 0)
		{
			if (GetArea(vPoints) > 0)//这里很重要，boost的多边形只有逆时针点序才能合并
			{
				for (std::vector<GcPoint>::reverse_iterator iter = m_vecPoints.rbegin(); iter != m_vecPoints.rend(); iter++)
				{
					boost::geometry::append(rlt, (boost_point)*iter);
				}
			}
			else
			{
				for (auto & pt : m_vecPoints)
				{
					boost::geometry::append(rlt, (boost_point)pt);
				}
			}
		}
		return rlt;
}

std::vector<Point> Merge(std::vector<Point> & lhs,std::vector<Point>& rhs)
{
    //判断两个多边形是否相交
	bool bCross = false;
	for (auto & pt : rhs)
	{
		if (PtInPolygon(lhs,pt))
		{
			bCross = true;
			break;
		}
	}
	if (!bCross)//不相交直接返回空向量
	{
		std::vector<Point>();
	}
    //进行并集计算
	std::vector<boost_Polygon> r;
	boost::geometry::union_(vec2BoostPolygon(lhs), vec2BoostPolygon(rhs), r);
	if (!r.empty())//有结果返回
	{
		std::vector<Point> vPoints;
		for (auto & pt : r[0].outer())
		{
			vPoints.push_back(pt);
		}
		return vPoints;
	}
    //无结果直接返回空向量
	std::vector<Point>();
}