1 // Boost.Geometry (aka GGL, Generic Geometry Library)
4 // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
5 // Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
6 // Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
8 // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
9 // (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
11 // Use, modification and distribution is subject to the Boost Software License,
12 // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
13 // http://www.boost.org/LICENSE_1_0.txt)
17 // We deliberately mix float/double's here so turn off warning
18 #pragma warning( disable : 4244 )
19 #endif // defined(_MSC_VER)
21 #include <geometry_test_common.hpp>
23 #include <boost/geometry/algorithms/assign.hpp>
25 #include <boost/geometry/strategies/cartesian/intersection.hpp>
26 #include <boost/geometry/strategies/intersection_result.hpp>
28 #include <boost/geometry/policies/relate/intersection_points.hpp>
29 #include <boost/geometry/policies/relate/direction.hpp>
30 #include <boost/geometry/policies/relate/tupled.hpp>
32 #include <boost/geometry/algorithms/intersection.hpp>
33 #include <boost/geometry/algorithms/detail/overlay/segment_as_subrange.hpp>
35 #include <boost/geometry/geometries/point.hpp>
36 #include <boost/geometry/geometries/segment.hpp>
37 #include <boost/geometry/geometries/adapted/boost_tuple.hpp>
39 BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS(cs::cartesian);
43 static void test_segment_intersection(int caseid,
44 int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4,
46 int expected_x1 = -99, int expected_y1 = -99,
47 int expected_x2 = -99, int expected_y2 = -99)
49 using namespace boost::geometry;
51 typedef typename bg::coordinate_type<P>::type coordinate_type;
52 typedef bg::model::referring_segment<const P> segment_type;
55 bg::assign_values(p1, x1, y1);
56 bg::assign_values(p2, x2, y2);
57 bg::assign_values(p3, x3, y3);
58 bg::assign_values(p4, x4, y4);
60 segment_type s12(p1,p2);
61 segment_type s34(p3,p4);
63 bg::detail::segment_as_subrange<segment_type> sr12(s12);
64 bg::detail::segment_as_subrange<segment_type> sr34(s34);
66 std::size_t expected_count = 0;
68 if (expected_x1 != -99 && expected_y1 != -99)
72 if (expected_x2 != -99 && expected_y2 != -99)
77 // Using intersection_insert
80 bg::detail::intersection::intersection_insert<P>(s12, s34,
81 std::back_inserter(out));
84 typedef bg::segment_intersection_points<P> result_type;
86 typedef bg::policies::relate::segments_intersection_points
92 = bg::strategy::intersection::cartesian_segments<>
93 ::apply(sr12, sr34, points_policy_type());
95 bg::policies::relate::direction_type dir
96 = bg::strategy::intersection::cartesian_segments<>
97 ::apply(sr12, sr34, bg::policies::relate::segments_direction());
99 //BOOST_CHECK_EQUAL(boost::size(out), expected_count);
100 BOOST_CHECK_EQUAL(is.count, expected_count);
101 BOOST_CHECK_MESSAGE(dir.how == expected_how,
103 << " how: detected: " << dir.how
104 << " expected: " << expected_how);
106 if (expected_count == 2
108 && boost::size(out) == 2)
110 // Two intersection points, reverse expectation if necessary
111 bool const first_matches
112 = std::fabs(bg::get<0>(out[0]) - expected_x1) < 1.0e-6
113 && std::fabs(bg::get<1>(out[0]) - expected_y1) < 1.0e-6;
117 std::swap(expected_x1, expected_x2);
118 std::swap(expected_y1, expected_y2);
122 if (expected_x1 != -99 && expected_y1 != -99
123 && boost::size(out) >= 1)
126 BOOST_CHECK_CLOSE(bg::get<0>(out[0]), coordinate_type(expected_x1), 0.001);
127 BOOST_CHECK_CLOSE(bg::get<1>(out[0]), coordinate_type(expected_y1), 0.001);
129 BOOST_CHECK_CLOSE(bg::get<0>(is.intersections[0]), expected_x1, 0.001);
130 BOOST_CHECK_CLOSE(bg::get<1>(is.intersections[0]), expected_y1, 0.001);
133 if (expected_x2 != -99 && expected_y2 != -99
134 && boost::size(out) >= 2)
136 BOOST_CHECK_CLOSE(bg::get<0>(out[1]), coordinate_type(expected_x2), 0.001);
137 BOOST_CHECK_CLOSE(bg::get<1>(out[1]), coordinate_type(expected_y2), 0.001);
139 BOOST_CHECK_CLOSE(bg::get<0>(is.intersections[1]), expected_x2, 0.001);
140 BOOST_CHECK_CLOSE(bg::get<1>(is.intersections[1]), expected_y2, 0.001);
145 template <typename P>
148 test_segment_intersection<P>( 1, 0,2, 2,0, 0,0, 2,2, 'i', 1, 1);
149 test_segment_intersection<P>( 2, 2,2, 3,1, 0,0, 2,2, 'a', 2, 2);
150 test_segment_intersection<P>( 3, 3,1, 2,2, 0,0, 2,2, 't', 2, 2);
151 test_segment_intersection<P>( 4, 0,2, 1,1, 0,0, 2,2, 'm', 1, 1);
153 test_segment_intersection<P>( 5, 1,1, 0,2, 0,0, 2,2, 's', 1, 1);
154 test_segment_intersection<P>( 6, 0,2, 2,0, 0,0, 1,1, 'm', 1, 1);
155 test_segment_intersection<P>( 7, 2,0, 0,2, 0,0, 1,1, 'm', 1, 1);
156 test_segment_intersection<P>( 8, 2,3, 3,2, 0,0, 2,2, 'd');
158 test_segment_intersection<P>( 9, 0,0, 2,2, 0,0, 2,2, 'e', 0, 0, 2, 2);
159 test_segment_intersection<P>(10, 2,2, 0,0, 0,0, 2,2, 'e', 2, 2, 0, 0);
160 test_segment_intersection<P>(11, 1,1, 3,3, 0,0, 2,2, 'c', 1, 1, 2, 2);
161 test_segment_intersection<P>(12, 3,3, 1,1, 0,0, 2,2, 'c', 1, 1, 2, 2);
163 test_segment_intersection<P>(13, 0,2, 2,2, 2,1, 2,3, 'm', 2, 2);
164 test_segment_intersection<P>(14, 2,2, 2,4, 2,0, 2,2, 'a', 2, 2);
165 test_segment_intersection<P>(15, 2,2, 2,4, 2,0, 2,1, 'd');
166 test_segment_intersection<P>(16, 2,4, 2,2, 2,0, 2,1, 'd');
168 test_segment_intersection<P>(17, 2,1, 2,3, 2,2, 2,4, 'c', 2, 2, 2, 3);
169 test_segment_intersection<P>(18, 2,3, 2,1, 2,2, 2,4, 'c', 2, 3, 2, 2);
170 test_segment_intersection<P>(19, 0,2, 2,2, 4,2, 2,2, 't', 2, 2);
171 test_segment_intersection<P>(20, 0,2, 2,2, 2,2, 4,2, 'a', 2, 2);
173 test_segment_intersection<P>(21, 1,2, 3,2, 2,1, 2,3, 'i', 2, 2);
174 test_segment_intersection<P>(22, 2,4, 2,1, 2,1, 2,3, 'c', 2, 1, 2, 3);
175 test_segment_intersection<P>(23, 2,4, 2,1, 2,3, 2,1, 'c', 2, 3, 2, 1);
176 test_segment_intersection<P>(24, 1,1, 3,3, 0,0, 3,3, 'c', 1, 1, 3, 3);
178 test_segment_intersection<P>(25, 2,0, 2,4, 2,1, 2,3, 'c', 2, 1, 2, 3);
179 test_segment_intersection<P>(26, 2,0, 2,4, 2,3, 2,1, 'c', 2, 3, 2, 1);
180 test_segment_intersection<P>(27, 0,0, 4,4, 1,1, 3,3, 'c', 1, 1, 3, 3);
181 test_segment_intersection<P>(28, 0,0, 4,4, 3,3, 1,1, 'c', 3, 3, 1, 1);
183 test_segment_intersection<P>(29, 1,1, 3,3, 0,0, 4,4, 'c', 1, 1, 3, 3);
184 test_segment_intersection<P>(30, 0,0, 2,2, 2,2, 3,1, 'a', 2, 2);
185 test_segment_intersection<P>(31, 0,0, 2,2, 2,2, 1,3, 'a', 2, 2);
186 test_segment_intersection<P>(32, 0,0, 2,2, 1,1, 2,0, 's', 1, 1);
188 test_segment_intersection<P>(33, 0,0, 2,2, 1,1, 0,2, 's', 1, 1);
189 test_segment_intersection<P>(34, 2,2, 1,3, 0,0, 2,2, 'a', 2, 2);
190 test_segment_intersection<P>(35, 2,2, 3,1, 0,0, 2,2, 'a', 2, 2);
191 test_segment_intersection<P>(36, 0,0, 2,2, 0,2, 1,1, 'm', 1, 1);
193 test_segment_intersection<P>(37, 0,0, 2,2, 2,0, 1,1, 'm', 1, 1);
194 test_segment_intersection<P>(38, 1,1, 0,2, 0,0, 2,2, 's', 1, 1);
195 test_segment_intersection<P>(39, 1,1, 2,0, 0,0, 2,2, 's', 1, 1);
196 test_segment_intersection<P>(40, 2,0, 1,1, 0,0, 2,2, 'm', 1, 1);
198 test_segment_intersection<P>(41, 1,2, 0,2, 2,2, 0,2, 'c', 1, 2, 0, 2);
199 test_segment_intersection<P>(42, 2,1, 1,1, 2,2, 0,2, 'd');
200 test_segment_intersection<P>(43, 4,1, 3,1, 2,2, 0,2, 'd');
201 test_segment_intersection<P>(44, 4,2, 3,2, 2,2, 0,2, 'd');
203 test_segment_intersection<P>(45, 2,0, 0,2, 0,0, 2,2, 'i', 1, 1);
205 // In figure: times 2
206 test_segment_intersection<P>(46, 8,2, 4,6, 0,0, 8, 8, 'i', 5, 5);
209 int test_main(int, char* [])
211 #if !defined(BOOST_GEOMETRY_TEST_ONLY_ONE_TYPE)
212 test_all<boost::tuple<double, double> >();
213 test_all<bg::model::point<float, 2, bg::cs::cartesian> >();
215 test_all<bg::model::point<double, 2, bg::cs::cartesian> >();