// Boost.Geometry (aka GGL, Generic Geometry Library) // Robustness Test // Copyright (c) 2012-2015 Barend Gehrels, Amsterdam, the Netherlands. // This file was modified by Oracle on 2015. // Modifications copyright (c) 2015 Oracle and/or its affiliates. // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // Use, modification and distribution is subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #if defined(_MSC_VER) # pragma warning( disable : 4244 ) # pragma warning( disable : 4267 ) #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include struct buffer_settings : public common_settings { int join_code; double distance; }; namespace bg = boost::geometry; template void create_svg(std::string const& filename , Geometry1 const& mp , Geometry2 const& buffer ) { typedef typename boost::geometry::point_type::type point_type; std::ofstream svg(filename.c_str()); boost::geometry::svg_mapper mapper(svg, 800, 800); boost::geometry::model::box box; bg::envelope(mp, box); bg::buffer(box, box, 1.0); mapper.add(box); if (! bg::is_empty(buffer)) { bg::envelope(buffer, box); bg::buffer(box, box, 1.0); mapper.add(box); } mapper.map(mp, "fill-opacity:0.5;fill:rgb(153,204,0);stroke:rgb(153,204,0);stroke-width:3"); mapper.map(buffer, "stroke-opacity:0.9;stroke:rgb(0,0,0);fill:none;stroke-width:1"); //mapper.map(intersection,"opacity:0.6;stroke:rgb(0,128,0);stroke-width:5"); } template bool verify(std::string const& caseid, MultiPolygon const& mp, MultiPolygon const& buffer, Settings const& settings) { bool result = true; // Area of buffer must be larger than of original polygon double area_mp = bg::area(mp); double area_buf = bg::area(buffer); if (area_buf < area_mp) { result = false; } if (result) { typedef typename boost::range_value::type polygon_type; BOOST_FOREACH(polygon_type const& polygon, mp) { typename bg::point_type::type point; bg::point_on_border(point, polygon); if (! bg::within(point, buffer)) { result = false; } } } if (result) { std::string message; if (! bg::is_valid(buffer, message)) { std::cout << "Buffer is not valid: " << message << std::endl; result = false; } } bool svg = settings.svg; bool wkt = settings.wkt; if (! result) { std::cout << "ERROR " << caseid << std::endl; //std::cout << bg::wkt(mp) << std::endl; //std::cout << bg::wkt(buffer) << std::endl; svg = true; wkt = true; } if (svg || wkt) { //std::cout << caseid << std::endl; } if (svg) { std::ostringstream filename; filename << caseid << "_" << typeid(typename bg::coordinate_type::type).name() << ".svg"; create_svg(filename.str(), mp, buffer); } if (wkt) { std::ostringstream filename; filename << caseid << "_" << typeid(typename bg::coordinate_type::type).name() << ".wkt"; std::ofstream stream(filename.str().c_str()); stream << bg::wkt(mp) << std::endl; stream << bg::wkt(buffer) << std::endl; } return result; } template bool test_buffer(MultiPolygon& result, int& index, Generator& generator, int level, Settings const& settings) { MultiPolygon p, q; // Generate two boxes if (level == 0) { p.resize(1); q.resize(1); make_square_polygon(p.front(), generator, settings); make_square_polygon(q.front(), generator, settings); bg::correct(p); bg::correct(q); } else { bg::correct(p); bg::correct(q); if (! test_buffer(p, index, generator, level - 1, settings) || ! test_buffer(q, index, generator, level - 1, settings)) { return false; } } typedef typename boost::range_value::type polygon; MultiPolygon mp; bg::detail::union_::union_insert < polygon >(p, q, std::back_inserter(mp)); bg::unique(mp); bg::unique(mp); bg::correct(mp); result = mp; typedef typename bg::coordinate_type::type coordinate_type; typedef bg::strategy::buffer::distance_asymmetric distance_strategy_type; distance_strategy_type distance_strategy(settings.distance, settings.distance); MultiPolygon buffered; std::ostringstream out; out << "recursive_polygons_buffer_" << index++ << "_" << level; bg::strategy::buffer::end_round end_strategy; bg::strategy::buffer::point_circle point_strategy; bg::strategy::buffer::side_straight side_strategy; bg::strategy::buffer::join_round join_round_strategy(32); // Compatible with MySQL bg::strategy::buffer::join_miter join_miter_strategy; try { switch(settings.join_code) { case 1 : bg::buffer(mp, buffered, distance_strategy, side_strategy, join_round_strategy, end_strategy, point_strategy); break; case 2 : bg::buffer(mp, buffered, distance_strategy, side_strategy, join_miter_strategy, end_strategy, point_strategy); break; default : return false; } } catch(std::exception const& e) { MultiPolygon empty; std::cout << out.str() << std::endl; std::cout << "Exception " << e.what() << std::endl; verify(out.str(), mp, empty, settings); return false; } return verify(out.str(), mp, buffered, settings); } template void test_all(int seed, int count, int level, Settings const& settings) { boost::timer t; typedef boost::minstd_rand base_generator_type; base_generator_type generator(seed); boost::uniform_int<> random_coordinate(0, settings.field_size - 1); boost::variate_generator > coordinate_generator(generator, random_coordinate); typedef bg::model::polygon < bg::model::d2::point_xy, Clockwise, Closed > polygon; typedef bg::model::multi_polygon mp; int index = 0; for(int i = 0; i < count; i++) { mp p; test_buffer(p, index, coordinate_generator, level, settings); } std::cout << "geometries: " << index << " type: " << typeid(T).name() << " time: " << t.elapsed() << std::endl; } int main(int argc, char** argv) { try { namespace po = boost::program_options; po::options_description description("=== recursive_polygons_linear_areal ===\nAllowed options"); int count = 1; int seed = static_cast(std::time(0)); int level = 3; bool ccw = false; bool open = false; buffer_settings settings; std::string form = "box"; std::string join = "round"; description.add_options() ("help", "Help message") ("seed", po::value(&seed), "Initialization seed for random generator") ("count", po::value(&count)->default_value(1), "Number of tests") ("level", po::value(&level)->default_value(3), "Level to reach (higher->slower)") ("distance", po::value(&settings.distance)->default_value(1.0), "Distance (1.0)") ("form", po::value(&form)->default_value("box"), "Form of the polygons (box, triangle)") ("join", po::value(&join)->default_value("round"), "Form of the joins (round, miter)") ("ccw", po::value(&ccw)->default_value(false), "Counter clockwise polygons") ("open", po::value(&open)->default_value(false), "Open polygons") ("size", po::value(&settings.field_size)->default_value(10), "Size of the field") ("wkt", po::value(&settings.wkt)->default_value(false), "Create a WKT of the inputs, for all tests") ("svg", po::value(&settings.svg)->default_value(false), "Create a SVG for all tests") ; po::variables_map varmap; po::store(po::parse_command_line(argc, argv, description), varmap); po::notify(varmap); if (varmap.count("help") || (form != "box" && form != "triangle") || (join != "round" && join != "miter") ) { std::cout << description << std::endl; return 1; } settings.triangular = form != "box"; settings.join_code = join == "round" ? 1 : 2; if (ccw && open) { test_all(seed, count, level, settings); } else if (ccw) { test_all(seed, count, level, settings); } else if (open) { test_all(seed, count, level, settings); } else { test_all(seed, count, level, settings); } #if defined(HAVE_TTMATH) // test_all(seed, count, max, svg, level); #endif } catch(std::exception const& e) { std::cout << "Exception " << e.what() << std::endl; } catch(...) { std::cout << "Other exception" << std::endl; } return 0; }