1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
// 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)
// Tests with-strategies, especially point-in-polygon
#include <geometry_test_common.hpp>
#include <boost/geometry/algorithms/covered_by.hpp>
#include <boost/geometry/algorithms/within.hpp>
#include <boost/geometry/strategies/cartesian/point_in_poly_franklin.hpp>
#include <boost/geometry/strategies/cartesian/point_in_poly_crossings_multiply.hpp>
#include <boost/geometry/strategies/agnostic/point_in_poly_winding.hpp>
#include <boost/geometry/strategies/cartesian/point_in_box.hpp>
#include <boost/geometry/strategies/cartesian/box_in_box.hpp>
#include <boost/geometry/strategies/agnostic/point_in_box_by_side.hpp>
#include <boost/geometry/strategies/cartesian/side_by_triangle.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/io/wkt/wkt.hpp>
template <typename Point, typename Polygon, typename Strategy>
void test_point_in_polygon(std::string const& case_id,
Point const& point, Polygon const& polygon,
Strategy const& strategy, std::string const& strategy_id,
bool expected)
{
BOOST_CONCEPT_ASSERT( (bg::concept::WithinStrategyPolygonal<Strategy>) );
bool detected = bg::within(point, polygon, strategy);
BOOST_CHECK_MESSAGE(detected == expected,
"within: " << case_id
<< " strategy: " << strategy_id // typeid(strategy).name() is too long
<< " output expected: " << int(expected)
<< " detected: " << int(detected)
);
}
template <typename Point, typename Polygon>
void test_geometry(std::string const& case_id, std::string const& wkt_point
, std::string const& wkt_polygon
, bool expected
, std::string const& deviations = ""
)
{
Point point;
Polygon polygon;
bg::read_wkt(wkt_point, point);
bg::read_wkt(wkt_polygon, polygon);
namespace sw = bg::strategy::within;
test_point_in_polygon(case_id, point, polygon, sw::winding<Point>(),
"winding", expected);
test_point_in_polygon(case_id, point, polygon, sw::franklin<Point>(),
"franklin", boost::contains(deviations, "f") ? !expected : expected);
test_point_in_polygon(case_id, point, polygon, sw::crossings_multiply<Point>(),
"cross.mult", boost::contains(deviations, "c") ? !expected : expected);
}
template <typename Point>
void test_box_of(std::string const& wkt_point, std::string const& wkt_box,
bool expected_within, bool expected_covered_by)
{
typedef bg::model::box<Point> box_type;
Point point;
box_type box;
bg::read_wkt(wkt_point, point);
bg::read_wkt(wkt_box, box);
bool detected_within = bg::within(point, box);
bool detected_covered_by = bg::covered_by(point, box);
BOOST_CHECK_EQUAL(detected_within, expected_within);
BOOST_CHECK_EQUAL(detected_covered_by, expected_covered_by);
// Also test with the non-default agnostic side version
namespace wi = bg::strategy::within;
wi::point_in_box_by_side<Point, box_type> within_strategy;
wi::point_in_box_by_side<Point, box_type, wi::decide_covered_by> covered_by_strategy;
detected_within = bg::within(point, box, within_strategy);
detected_covered_by = bg::covered_by(point, box, covered_by_strategy);
BOOST_CHECK_EQUAL(detected_within, expected_within);
BOOST_CHECK_EQUAL(detected_covered_by, expected_covered_by);
// We might exchange strategies between within/covered by.
// So the lines below might seem confusing, but are as intended
detected_within = bg::covered_by(point, box, within_strategy);
detected_covered_by = bg::within(point, box, covered_by_strategy);
BOOST_CHECK_EQUAL(detected_within, expected_within);
BOOST_CHECK_EQUAL(detected_covered_by, expected_covered_by);
// Finally we call the strategies directly
detected_within = within_strategy.apply(point, box);
detected_covered_by = covered_by_strategy.apply(point, box);
BOOST_CHECK_EQUAL(detected_within, expected_within);
BOOST_CHECK_EQUAL(detected_covered_by, expected_covered_by);
}
template <typename Point>
void test_box()
{
test_box_of<Point>("POINT(1 1)", "BOX(0 0,2 2)", true, true);
test_box_of<Point>("POINT(0 0)", "BOX(0 0,2 2)", false, true);
test_box_of<Point>("POINT(2 2)", "BOX(0 0,2 2)", false, true);
test_box_of<Point>("POINT(0 1)", "BOX(0 0,2 2)", false, true);
test_box_of<Point>("POINT(1 0)", "BOX(0 0,2 2)", false, true);
test_box_of<Point>("POINT(3 3)", "BOX(0 0,2 2)", false, false);
}
template <typename Point>
void test_all()
{
test_box<Point>();
typedef bg::model::polygon<Point> polygon;
std::string const box = "POLYGON((0 0,0 2,2 2,2 0,0 0))";
std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))";
std::string const with_hole = "POLYGON((0 0,0 3,3 3,3 0,0 0),(1 1,2 1,2 2,1 2,1 1))";
test_geometry<Point, polygon>("b1", "POINT(1 1)", box, true);
test_geometry<Point, polygon>("b2", "POINT(3 3)", box, false);
// Test ALL corners (officialy false but some strategies might answer true)
test_geometry<Point, polygon>("b3a", "POINT(0 0)", box, false, "f");
test_geometry<Point, polygon>("b3b", "POINT(0 2)", box, false);
test_geometry<Point, polygon>("b3c", "POINT(2 2)", box, false);
test_geometry<Point, polygon>("b3d", "POINT(2 0)", box, false);
// Test ALL sides (officialy false but some strategies might answer true)
test_geometry<Point, polygon>("b4a", "POINT(0 1)", box, false, "f");
test_geometry<Point, polygon>("b4b", "POINT(1 2)", box, false, "c");
test_geometry<Point, polygon>("b4c", "POINT(2 1)", box, false);
test_geometry<Point, polygon>("b4d", "POINT(1 0)", box, false, "f");
test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, true);
test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, false);
test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, false, "f");
test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, false, "c");
test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, false, "f");
test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, false, "f");
test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, false);
test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, false, "f");
test_geometry<Point, polygon>("h1", "POINT(0.5 0.5)", with_hole, true);
test_geometry<Point, polygon>("h2a", "POINT(1.5 1.5)", with_hole, false);
test_geometry<Point, polygon>("h2b", "POINT(5 5)", with_hole, false);
test_geometry<Point, polygon>("h3a", "POINT(1 1)", with_hole, false, "c");
test_geometry<Point, polygon>("h3b", "POINT(2 2)", with_hole, false, "f");
test_geometry<Point, polygon>("h3c", "POINT(0 0)", with_hole, false, "f");
test_geometry<Point, polygon>("h4a", "POINT(1 1.5)", with_hole, false);
test_geometry<Point, polygon>("h4b", "POINT(1.5 2)", with_hole, false, "f");
// Lying ON (one of the sides of) interior ring
test_geometry<Point, polygon>("#77-1", "POINT(6 3.5)", "POLYGON((5 3,5 4,4 4,4 5,3 5,3 6,5 6,5 5,7 5,7 6,8 6,8 5,9 5,9 2,8 2,8 1,7 1,7 2,5 2,5 3),(6 3,8 3,8 4,6 4,6 3))", false);
}
int test_main(int, char* [])
{
test_all<bg::model::point<float, 2, bg::cs::cartesian> >();
test_all<bg::model::point<double, 2, bg::cs::cartesian> >();
#if defined(HAVE_TTMATH)
test_all<bg::model::point<ttmath_big, 2, bg::cs::cartesian> >();
#endif
return 0;
}
|
