mirror of
https://github.com/boostorg/geometry.git
synced 2025-05-10 07:34:03 +00:00
266 lines
7.7 KiB
C++
266 lines
7.7 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library)
|
|
// Unit Test
|
|
|
|
// Copyright (c) 2010-2012 Barend Gehrels, 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)
|
|
|
|
|
|
#ifndef BOOST_GEOMETRY_TEST_BUFFER_HPP
|
|
#define BOOST_GEOMETRY_TEST_BUFFER_HPP
|
|
|
|
#define BOOST_GEOMETRY_DEBUG_WITH_MAPPER
|
|
#define TEST_WITH_SVG
|
|
|
|
#include <fstream>
|
|
#include <iomanip>
|
|
|
|
#include <boost/foreach.hpp>
|
|
#include <geometry_test_common.hpp>
|
|
|
|
|
|
#include <boost/geometry/algorithms/envelope.hpp>
|
|
#include <boost/geometry/algorithms/area.hpp>
|
|
#include <boost/geometry/algorithms/buffer.hpp>
|
|
#include <boost/geometry/algorithms/centroid.hpp>
|
|
#include <boost/geometry/algorithms/union.hpp>
|
|
|
|
#include <boost/geometry/algorithms/detail/overlay/debug_turn_info.hpp>
|
|
|
|
#include <boost/geometry/geometries/geometries.hpp>
|
|
|
|
#include <boost/geometry/strategies/strategies.hpp>
|
|
|
|
#include <boost/geometry/algorithms/disjoint.hpp>
|
|
#include <boost/geometry/algorithms/intersects.hpp>
|
|
|
|
#include <boost/geometry/extensions/algorithms/buffer/buffer_inserter.hpp>
|
|
|
|
#include <boost/geometry/extensions/strategies/buffer.hpp>
|
|
|
|
#include <boost/geometry/io/wkt/wkt.hpp>
|
|
|
|
|
|
#if defined(TEST_WITH_SVG)
|
|
# include <boost/geometry/extensions/io/svg/svg_mapper.hpp>
|
|
#endif
|
|
|
|
|
|
#include <boost/geometry/algorithms/detail/overlay/self_turn_points.hpp>
|
|
template <typename Geometry, typename Mapper>
|
|
void post_map(Geometry const& geometry, Mapper& mapper)
|
|
{
|
|
typedef bg::detail::overlay::turn_info
|
|
<
|
|
typename bg::point_type<Geometry>::type
|
|
> turn_info;
|
|
|
|
std::vector<turn_info> turns;
|
|
|
|
bg::detail::self_get_turn_points::no_interrupt_policy policy;
|
|
bg::self_turns
|
|
<
|
|
bg::detail::overlay::assign_null_policy
|
|
>(geometry, turns, policy);
|
|
|
|
BOOST_FOREACH(turn_info const& turn, turns)
|
|
{
|
|
mapper.map(turn.point, "fill:rgb(255,128,0);stroke:rgb(0,0,100);stroke-width:1", 3);
|
|
}
|
|
}
|
|
|
|
template
|
|
<
|
|
typename GeometryOut,
|
|
template<typename, typename> class JoinStrategy,
|
|
typename Geometry
|
|
>
|
|
void test_buffer(std::string const& caseid, Geometry const& geometry,
|
|
char join,
|
|
bool check, double expected_area,
|
|
double distance_left, double distance_right, int expected_self_tangencies)
|
|
{
|
|
namespace bg = boost::geometry;
|
|
|
|
typedef typename bg::coordinate_type<Geometry>::type coordinate_type;
|
|
typedef typename bg::point_type<Geometry>::type point_type;
|
|
typedef bg::strategy::buffer::distance_asymmetric<coordinate_type> distance;
|
|
|
|
typedef typename bg::ring_type<GeometryOut>::type ring_type;
|
|
|
|
typedef typename bg::tag<Geometry>::type tag;
|
|
// TODO use something different here:
|
|
std::string type = boost::is_same<tag, bg::polygon_tag>::value ? "poly"
|
|
: boost::is_same<tag, bg::linestring_tag>::value ? "line"
|
|
: boost::is_same<tag, bg::point_tag>::value ? "point"
|
|
: boost::is_same<tag, bg::multi_polygon_tag>::value ? "multipoly"
|
|
: boost::is_same<tag, bg::multi_linestring_tag>::value ? "multiline"
|
|
: boost::is_same<tag, bg::multi_point_tag>::value ? "multipoint"
|
|
: ""
|
|
;
|
|
|
|
std::ostringstream complete;
|
|
complete
|
|
<< type << "_"
|
|
<< caseid << "_"
|
|
<< string_from_type<coordinate_type>::name()
|
|
<< "_" << join;
|
|
|
|
//std::cout << complete.str() << std::endl;
|
|
|
|
std::ostringstream filename;
|
|
filename << "buffer_" << complete.str() << ".svg";
|
|
|
|
std::ofstream svg(filename.str().c_str());
|
|
|
|
bg::svg_mapper<point_type> mapper(svg, 1000, 1000);
|
|
|
|
{
|
|
bg::model::box<point_type> box;
|
|
bg::envelope(geometry, box);
|
|
double d = std::abs(distance_left);
|
|
if (distance_right > -998)
|
|
{
|
|
d += std::abs(distance_right);
|
|
}
|
|
else
|
|
{
|
|
distance_right = distance_left;
|
|
}
|
|
|
|
bg::buffer(box, box, d * (join == 'm' ? 2.0 : 1.1));
|
|
mapper.add(box);
|
|
}
|
|
|
|
typedef JoinStrategy
|
|
<
|
|
point_type,
|
|
typename bg::point_type<GeometryOut>::type
|
|
> join_strategy_type;
|
|
|
|
join_strategy_type join_strategy;
|
|
|
|
typedef bg::strategy::buffer::distance_asymmetric<coordinate_type> distance_strategy_type;
|
|
distance_strategy_type distance_strategy(distance_left, distance_right);
|
|
|
|
std::vector<GeometryOut> buffered;
|
|
|
|
bg::buffer_inserter<GeometryOut>(geometry, std::back_inserter(buffered),
|
|
distance_strategy,
|
|
join_strategy
|
|
#ifdef BOOST_GEOMETRY_DEBUG_WITH_MAPPER
|
|
, mapper
|
|
#endif
|
|
);
|
|
|
|
typename bg::default_area_result<GeometryOut>::type area = 0;
|
|
BOOST_FOREACH(GeometryOut const& polygon, buffered)
|
|
{
|
|
area += bg::area(polygon);
|
|
}
|
|
|
|
//std::cout << caseid << " " << distance_left << std::endl;
|
|
//std::cout << "INPUT: " << bg::wkt(geometry) << std::endl;
|
|
//std::cout << "OUTPUT: " << area << std::endl;
|
|
//BOOST_FOREACH(GeometryOut const& polygon, buffered)
|
|
//{
|
|
// std::cout << bg::wkt(polygon) << std::endl;
|
|
//}
|
|
|
|
|
|
if (expected_area > -0.1)
|
|
{
|
|
typename bg::default_area_result<GeometryOut>::type tolerance = 0.01;
|
|
if (join == 'r')
|
|
{
|
|
tolerance = 0.1;
|
|
}
|
|
|
|
if (expected_area < 1.0e-5)
|
|
{
|
|
tolerance = 1.0e-10;
|
|
}
|
|
|
|
BOOST_CHECK_MESSAGE
|
|
(
|
|
bg::math::abs(area - expected_area) < tolerance,
|
|
complete.str() << " not as expected. "
|
|
<< " Expected: " << expected_area
|
|
<< " Detected: " << area
|
|
);
|
|
|
|
// Be sure resulting polygon does not contain
|
|
// self-intersections
|
|
// But indentation5 should contain 1 self-ip TODO give this check as an argument
|
|
if (expected_self_tangencies == 0
|
|
&& ! boost::contains(complete.str(), "indentation5_d_r")
|
|
&& ! boost::contains(complete.str(), "flower25_d_r")
|
|
&& ! boost::contains(complete.str(), "multipoly_rt_d_d_m")
|
|
)
|
|
{
|
|
BOOST_FOREACH(GeometryOut const& polygon, buffered)
|
|
{
|
|
BOOST_CHECK_MESSAGE
|
|
(
|
|
! bg::intersects(polygon),
|
|
complete.str() << " output is self-intersecting. "
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Map input geometry in green
|
|
mapper.map(geometry, "opacity:0.5;fill:rgb(0,128,0);stroke:rgb(0,128,0);stroke-width:10");
|
|
|
|
BOOST_FOREACH(GeometryOut const& polygon, buffered)
|
|
{
|
|
mapper.map(polygon, "opacity:0.4;fill:rgb(255,255,128);stroke:rgb(0,0,0);stroke-width:3");
|
|
//mapper.map(polygon, "opacity:0.2;fill:none;stroke:rgb(255,0,0);stroke-width:3");
|
|
post_map(polygon, mapper);
|
|
}
|
|
}
|
|
|
|
|
|
#ifdef BOOST_GEOMETRY_CHECK_WITH_POSTGIS
|
|
static int counter = 0;
|
|
#endif
|
|
|
|
template
|
|
<
|
|
typename Geometry,
|
|
template<typename, typename> class JoinStrategy,
|
|
typename GeometryOut
|
|
>
|
|
void test_one(std::string const& caseid, std::string const& wkt,
|
|
char join, double expected_area,
|
|
double distance_left, double distance_right = -999, int expected_self_tangencies = 0)
|
|
{
|
|
namespace bg = boost::geometry;
|
|
Geometry g;
|
|
bg::read_wkt(wkt, g);
|
|
|
|
typedef typename bg::point_type<Geometry>::type point_type;
|
|
|
|
|
|
#ifdef BOOST_GEOMETRY_CHECK_WITH_POSTGIS
|
|
std::cout
|
|
<< (counter > 0 ? "union " : "")
|
|
<< "select " << counter++
|
|
<< ", '" << caseid << "' as caseid"
|
|
<< ", ST_Area(ST_Buffer(ST_GeomFromText('" << wkt << "'), "
|
|
<< distance_left
|
|
<< ", 'endcap=flat join=" << (join == 'm' ? "miter" : "round") << "'))"
|
|
<< ", " << expected_area
|
|
<< std::endl;
|
|
#endif
|
|
|
|
test_buffer<GeometryOut, JoinStrategy>
|
|
(caseid, g, join, false, expected_area,
|
|
distance_left, distance_right, expected_self_tangencies);
|
|
}
|
|
|
|
|
|
|
|
#endif
|