id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
6696,boost::geometry::intersection on two triangles creates self-intersecting polygon,snubdodecahedron@…,Barend Gehrels,"The code below creates two triangles sharing one vertex, intersects them, and then tests the result for self intersections.  The test fails on 1.49.0.

#include <iostream>
#include <deque>

#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/io/wkt/wkt.hpp>
#include <boost/geometry/multi/geometries/register/multi_polygon.hpp>

typedef boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double>,false> polygon;
BOOST_GEOMETRY_REGISTER_MULTI_POLYGON(std::deque<polygon>);

int main()
{
    polygon green, blue;
    std::deque<polygon> output;

    boost::geometry::read_wkt(
        ""POLYGON((0.94458145927637815475 0.76153991837054491043 , 0.37399105052463710308 0.59515245421789586544 , ""
        ""0.031151068862527608871 0.95449111564084887505 , 0.94458145927637815475 0.76153991837054491043))"", green);

    boost::geometry::read_wkt(
        ""POLYGON((0.94458145927637815475 0.76153991837054491043 , 0.90063317718199253914 0.7487243450636832387 , ""
        ""0.57996011668279578988 0.83856179693083876536 , 0.94458145927637815475 0.76153991837054491043))"", blue);

    boost::geometry::intersection(blue, green, output);

    std::cout<<""testing output""<<std::endl;

    boost::geometry::detail::overlay::has_self_intersections(output);

    std::cout<<""valid output""<<std::endl;

    return 0;
}
",Bugs,closed,Boost 1.50.0,geometry,Boost 1.49.0,Problem,fixed,has_self_intersections intersection geometry overlay_invalid_input_exception,