【转】boost库之geometry

#include <boost/assign.hpp>
#include <boost/geometry/geometry.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/linestring.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/ring.hpp>
#include <boost/geometry/geometries/polygon.hpp>
namespace bg = boost::geometry;
typedef bg::model::d2::point_xy<double> DPoint;
typedef bg::model::segment<DPoint> DSegment;
typedef bg::model::linestring<DPoint> DLineString;
typedef bg::model::box<DPoint> DBox;
//这里的ring就是我们通常说的多边形闭合区域(内部不存在缕空)，模板参数为true，表示顺时针存储点，为false，表示逆时针存储点，由于MM_TEXT坐标系与传统上的坐标系的Y轴方向是相反的，所以最后为false，将TopLeft、TopRight、BottomRight、BottomLeft、TopLeft以此存储到ring中，以便能正确计算
typedef bg::model::ring<DPoint, false> DRing;
//polygon模板参数false，也是由上面相同的原因得出来的
typedef bg::model::polygon<DPoint, false> DPolygon;

int _tmain(int argc, _TCHAR* argv[])
{
    DPoint pt0(, );
    DPoint pt1(, );
    DSegment sg0(pt0, pt1);

    double dDistance = ;

    //1、点到点的距离
    dDistance = bg::distance(pt0, pt1);
    //2、点到线段的距离，如果点到直线的垂足不在线段上，所计算的距离为(点到直线的距离、线段到垂足延长的距离之和）
    dDistance = bg::distance(DPoint(, ), sg0);
    dDistance = bg::distance(DPoint(, ), sg0);

    //3、判断线段是否相交
    DSegment sg1(DPoint(, ), DPoint(, ));
    DSegment sg2(DPoint(, ), DPoint(, ));
    bool bIntersect = false;
    bIntersect = bg::intersects(sg0, sg1);
    bIntersect = bg::intersects(sg0, sg2);

    //4、求线段与线段的交点
    std::list<DPoint> lstPoints;
    bg::intersection(sg0, sg1, lstPoints);
    lstPoints.clear();
    bg::intersection(sg0, sg2, lstPoints);

    DBox rc2(DPoint(, ), DPoint(, ));

    //5、判断box是否相交
    DBox rc(DPoint(, ), DPoint(, ));
    DBox rc0(DPoint(, ), DPoint(, ));
    DBox rc1(DPoint(, ), DPoint(, ));

    bIntersect = bg::intersects(rc, rc0);
    bIntersect = bg::intersects(rc, rc1);
    //bg::intersection(rc, rc0, container);//error

    //6、判断box是否与LineString相交
    DLineString line0;

    line0.push_back(DPoint(, ));
    line0.push_back(DPoint(, ));
    line0.push_back(DPoint(, -));
    line0.push_back(DPoint(, ));
    bIntersect = bg::intersects(rc, line0);
    bIntersect = bg::intersects(rc0, line0);

    //7、求box与linestring的交点
    std::list<DLineString> lstLines;
    bg::intersection(rc, line0, lstLines);

    //8、点是否在box内
    DBox rc7(DPoint(, ), DPoint(, ));
    bool bInside = false;
    bInside = bg::within(DPoint(, ), rc7);
    bInside = bg::within(DPoint(, ), rc7);

    //9、判断LineString与LineString是否相交
    DLineString line1, line2, line3;

    line1.push_back(DPoint(, ));
    line1.push_back(DPoint(, ));
    line1.push_back(DPoint(, ));
    line1.push_back(DPoint(, ));
    line2.push_back(DPoint(, ));
    line2.push_back(DPoint(, ));
    line2.push_back(DPoint(, ));
    line3.push_back(DPoint(, ));
    line3.push_back(DPoint(, ));

    bIntersect = bg::intersects(line1, line2);
    bIntersect = bg::intersects(line1, line3);

    //10、求LineString与LineString的交点
    lstPoints.clear();
    bg::intersection(line1, line2, lstPoints);
    lstPoints.clear();
    bg::intersection(line1, line3, lstPoints);

    //11、判断ring与ring是否相交
    DPoint arDPoint0[] = {DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, )};
    DPoint arDPoint1[] = {DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, ), DPoint(, )};
    DRing r0(arDPoint0, arDPoint0 + );
    DRing r1(arDPoint1, arDPoint1 + );
    bIntersect = bg::intersects(r0, r1);

    //12、求ring与ring的交点
    lstPoints.clear();
    bg::intersection(r0, r1, lstPoints);

    DPolygon poly1;
    DPolygon poly2;
    DPolygon poly3;

    auto lstOf = boost::assign::list_of(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ));
    poly1.outer().assign(lstOf.begin(), lstOf.end());
    lstOf = boost::assign::list_of(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ));
    poly1.inners().push_back(lstOf);
    lstOf = boost::assign::list_of(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ));
    poly2.outer().assign(lstOf.begin(), lstOf.end());
    lstOf = boost::assign::list_of(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ))(DPoint(, ));
    poly3.outer().assign(lstOf.begin(), lstOf.end());

    //13、判断polygon与polygon是否相交
    bIntersect = bg::intersects(poly1, poly2);
    bIntersect = bg::intersects(poly1, poly3);

    //14、求polygon与polygon相交的区域
    std::list<DPolygon> lstPolygon;

    bg::intersection(poly1, poly2, lstPolygon);
    lstPolygon.clear();
    bg::intersection(poly1, poly3, lstPolygon);

    //15、判断点是否在polygon内
    bInside = bg::within(DPoint(, ), poly1);
    bInside = bg::within(DPoint(, ), poly1);

    return ;
}

转自：http://blog.csdn.net/dc2010_/article/details/23132521