mirror of
https://github.com/boostorg/geometry.git
synced 2025-05-10 07:34:03 +00:00
163 lines
4.5 KiB
C++
163 lines
4.5 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library) test file
|
|
//
|
|
// Copyright Barend Gehrels 2009, Geodan, Amsterdam, the Netherlands
|
|
// 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)
|
|
|
|
#include <iostream>
|
|
#include <sstream>
|
|
#include <fstream>
|
|
#include <iomanip>
|
|
#include <string>
|
|
|
|
#define BOOST_GEOMETRY_REPORT_OVERLAY_ERROR
|
|
#define BOOST_GEOMETRY_NO_BOOST_TEST
|
|
|
|
#include <boost/timer.hpp>
|
|
#include <boost/lexical_cast.hpp>
|
|
#include <boost/random/linear_congruential.hpp>
|
|
#include <boost/random/uniform_int.hpp>
|
|
#include <boost/random/uniform_real.hpp>
|
|
#include <boost/random/variate_generator.hpp>
|
|
|
|
|
|
|
|
#include <boost/geometry/geometry.hpp>
|
|
#include <boost/geometry/multi/multi.hpp>
|
|
#include <boost/geometry/multi/algorithms/overlay/assemble.hpp>
|
|
|
|
#include <boost/geometry/multi/geometries/multi_polygon.hpp>
|
|
|
|
#include <boost/geometry/extensions/gis/io/wkt/wkt.hpp>
|
|
|
|
#include <boost/geometry/extensions/io/svg/svg_mapper.hpp>
|
|
#include <geometry_test_common.hpp>
|
|
#include <test_overlay_p_q.hpp>
|
|
|
|
template <typename Polygon, typename Generator>
|
|
inline void make_box(Polygon& polygon, Generator& generator)
|
|
{
|
|
namespace bg = boost::geometry;
|
|
typedef typename bg::point_type<Polygon>::type point_type;
|
|
typedef typename bg::coordinate_type<Polygon>::type coordinate_type;
|
|
|
|
coordinate_type x, y;
|
|
x = generator();
|
|
y = generator();
|
|
|
|
typename bg::ring_type<Polygon>::type& ring = bg::exterior_ring(polygon);
|
|
|
|
point_type p;
|
|
bg::set<0>(p, x); bg::set<1>(p, y); ring.push_back(p);
|
|
bg::set<0>(p, x); bg::set<1>(p, y + 1); ring.push_back(p);
|
|
bg::set<0>(p, x + 1); bg::set<1>(p, y + 1); ring.push_back(p);
|
|
bg::set<0>(p, x + 1); bg::set<1>(p, y); ring.push_back(p);
|
|
bg::set<0>(p, x); bg::set<1>(p, y); ring.push_back(p);
|
|
}
|
|
|
|
|
|
|
|
template <typename MultiPolygon, typename Generator>
|
|
void test_recursive_boxes(MultiPolygon& result, int& index,
|
|
Generator& generator, bool svg, int level = 3)
|
|
{
|
|
namespace bg = boost::geometry;
|
|
MultiPolygon p, q;
|
|
|
|
// Generate two boxes
|
|
if (level == 0)
|
|
{
|
|
p.resize(1);
|
|
q.resize(1);
|
|
make_box(p.front(), generator);
|
|
make_box(q.front(), generator);
|
|
}
|
|
else
|
|
{
|
|
test_recursive_boxes(p, index, generator, svg, level - 1);
|
|
test_recursive_boxes(q, index, generator, svg, level - 1);
|
|
}
|
|
|
|
typedef typename boost::range_value<MultiPolygon>::type polygon;
|
|
|
|
std::ostringstream out;
|
|
out << "recursive_box_" << index++ << "_" << level;
|
|
test_overlay_p_q
|
|
<
|
|
polygon,
|
|
typename bg::coordinate_type<MultiPolygon>::type
|
|
>(out.str(), p, q, svg, 0.001);
|
|
|
|
MultiPolygon mp;
|
|
bg::union_inserter
|
|
<
|
|
polygon
|
|
>(p, q, std::back_inserter(mp));
|
|
|
|
result = mp;
|
|
}
|
|
|
|
template <typename T>
|
|
void test_all(int seed, int count, bool svg)
|
|
{
|
|
boost::timer t;
|
|
|
|
typedef boost::minstd_rand base_generator_type;
|
|
|
|
boost::uniform_int<> random_coordinate(0, 9);
|
|
base_generator_type generator(seed);
|
|
boost::variate_generator<base_generator_type&, boost::uniform_int<> >
|
|
int_generator(generator, random_coordinate);
|
|
|
|
typedef boost::geometry::polygon
|
|
<
|
|
boost::geometry::point_xy<T>
|
|
> polygon;
|
|
typedef boost::geometry::multi_polygon<polygon> mp;
|
|
|
|
|
|
int index = 0;
|
|
for(int i = 0; i < count; i++)
|
|
{
|
|
|
|
mp p;
|
|
test_recursive_boxes<mp>(p, index, int_generator, svg);
|
|
}
|
|
std::cout
|
|
<< "type: " << string_from_type<T>::name()
|
|
<< " time: " << t.elapsed() << std::endl;
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
try
|
|
{
|
|
int count = argc > 1 ? boost::lexical_cast<int>(argv[1]) : 10;
|
|
int seed = (argc > 2 && std::string(argv[2]) != std::string("#"))
|
|
? boost::lexical_cast<int>(argv[2])
|
|
: static_cast<unsigned int>(std::time(0));
|
|
bool svg = argc > 3 && std::string(argv[3]) == std::string("svg");
|
|
|
|
//test_all<float>(seed, count, svg, 1e-3);
|
|
test_all<double>(seed, count, svg);
|
|
|
|
#if defined(HAVE_CLN)
|
|
//test_recursive_boxes<boost::numeric_adaptor::cln_value_type>("c",
|
|
#endif
|
|
#if defined(HAVE_GMP)
|
|
// test_recursive_boxes<boost::numeric_adaptor::gmp_value_type>(selection, "g");
|
|
#endif
|
|
}
|
|
catch(std::exception const& e)
|
|
{
|
|
std::cout << "Exception " << e.what() << std::endl;
|
|
}
|
|
catch(...)
|
|
{
|
|
std::cout << "Other exception" << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|