transform.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480
  1. // Boost.Geometry (aka GGL, Generic Geometry Library)
  2. // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
  3. // Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
  4. // Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
  5. // Copyright (c) 2014 Adam Wulkiewicz, Lodz, Poland.
  6. // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
  7. // (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
  8. // Use, modification and distribution is subject to the Boost Software License,
  9. // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  10. // http://www.boost.org/LICENSE_1_0.txt)
  11. #ifndef BOOST_GEOMETRY_ALGORITHMS_TRANSFORM_HPP
  12. #define BOOST_GEOMETRY_ALGORITHMS_TRANSFORM_HPP
  13. #include <cmath>
  14. #include <iterator>
  15. #include <boost/range.hpp>
  16. #include <boost/type_traits/remove_reference.hpp>
  17. #include <boost/variant/apply_visitor.hpp>
  18. #include <boost/variant/static_visitor.hpp>
  19. #include <boost/variant/variant_fwd.hpp>
  20. #include <boost/geometry/algorithms/assign.hpp>
  21. #include <boost/geometry/algorithms/clear.hpp>
  22. #include <boost/geometry/algorithms/detail/interior_iterator.hpp>
  23. #include <boost/geometry/algorithms/num_interior_rings.hpp>
  24. #include <boost/geometry/core/cs.hpp>
  25. #include <boost/geometry/core/exterior_ring.hpp>
  26. #include <boost/geometry/core/interior_rings.hpp>
  27. #include <boost/geometry/core/mutable_range.hpp>
  28. #include <boost/geometry/core/ring_type.hpp>
  29. #include <boost/geometry/core/tag_cast.hpp>
  30. #include <boost/geometry/core/tags.hpp>
  31. #include <boost/geometry/geometries/concepts/check.hpp>
  32. #include <boost/geometry/strategies/default_strategy.hpp>
  33. #include <boost/geometry/strategies/transform.hpp>
  34. namespace boost { namespace geometry
  35. {
  36. #ifndef DOXYGEN_NO_DETAIL
  37. namespace detail { namespace transform
  38. {
  39. struct transform_point
  40. {
  41. template <typename Point1, typename Point2, typename Strategy>
  42. static inline bool apply(Point1 const& p1, Point2& p2,
  43. Strategy const& strategy)
  44. {
  45. return strategy.apply(p1, p2);
  46. }
  47. };
  48. struct transform_box
  49. {
  50. template <typename Box1, typename Box2, typename Strategy>
  51. static inline bool apply(Box1 const& b1, Box2& b2,
  52. Strategy const& strategy)
  53. {
  54. typedef typename point_type<Box1>::type point_type1;
  55. typedef typename point_type<Box2>::type point_type2;
  56. point_type1 lower_left, upper_right;
  57. geometry::detail::assign::assign_box_2d_corner<min_corner, min_corner>(
  58. b1, lower_left);
  59. geometry::detail::assign::assign_box_2d_corner<max_corner, max_corner>(
  60. b1, upper_right);
  61. point_type2 p1, p2;
  62. if (strategy.apply(lower_left, p1) && strategy.apply(upper_right, p2))
  63. {
  64. // Create a valid box and therefore swap if necessary
  65. typedef typename coordinate_type<point_type2>::type coordinate_type;
  66. coordinate_type x1 = geometry::get<0>(p1)
  67. , y1 = geometry::get<1>(p1)
  68. , x2 = geometry::get<0>(p2)
  69. , y2 = geometry::get<1>(p2);
  70. if (x1 > x2) { std::swap(x1, x2); }
  71. if (y1 > y2) { std::swap(y1, y2); }
  72. geometry::set<min_corner, 0>(b2, x1);
  73. geometry::set<min_corner, 1>(b2, y1);
  74. geometry::set<max_corner, 0>(b2, x2);
  75. geometry::set<max_corner, 1>(b2, y2);
  76. return true;
  77. }
  78. return false;
  79. }
  80. };
  81. struct transform_box_or_segment
  82. {
  83. template <typename Geometry1, typename Geometry2, typename Strategy>
  84. static inline bool apply(Geometry1 const& source, Geometry2& target,
  85. Strategy const& strategy)
  86. {
  87. typedef typename point_type<Geometry1>::type point_type1;
  88. typedef typename point_type<Geometry2>::type point_type2;
  89. point_type1 source_point[2];
  90. geometry::detail::assign_point_from_index<0>(source, source_point[0]);
  91. geometry::detail::assign_point_from_index<1>(source, source_point[1]);
  92. point_type2 target_point[2];
  93. if (strategy.apply(source_point[0], target_point[0])
  94. && strategy.apply(source_point[1], target_point[1]))
  95. {
  96. geometry::detail::assign_point_to_index<0>(target_point[0], target);
  97. geometry::detail::assign_point_to_index<1>(target_point[1], target);
  98. return true;
  99. }
  100. return false;
  101. }
  102. };
  103. template
  104. <
  105. typename PointOut,
  106. typename OutputIterator,
  107. typename Range,
  108. typename Strategy
  109. >
  110. inline bool transform_range_out(Range const& range,
  111. OutputIterator out, Strategy const& strategy)
  112. {
  113. PointOut point_out;
  114. for(typename boost::range_iterator<Range const>::type
  115. it = boost::begin(range);
  116. it != boost::end(range);
  117. ++it)
  118. {
  119. if (! transform_point::apply(*it, point_out, strategy))
  120. {
  121. return false;
  122. }
  123. *out++ = point_out;
  124. }
  125. return true;
  126. }
  127. struct transform_polygon
  128. {
  129. template <typename Polygon1, typename Polygon2, typename Strategy>
  130. static inline bool apply(Polygon1 const& poly1, Polygon2& poly2,
  131. Strategy const& strategy)
  132. {
  133. typedef typename point_type<Polygon2>::type point2_type;
  134. geometry::clear(poly2);
  135. if (!transform_range_out<point2_type>(geometry::exterior_ring(poly1),
  136. range::back_inserter(geometry::exterior_ring(poly2)), strategy))
  137. {
  138. return false;
  139. }
  140. // Note: here a resizeable container is assumed.
  141. traits::resize
  142. <
  143. typename boost::remove_reference
  144. <
  145. typename traits::interior_mutable_type<Polygon2>::type
  146. >::type
  147. >::apply(geometry::interior_rings(poly2),
  148. geometry::num_interior_rings(poly1));
  149. typename geometry::interior_return_type<Polygon1 const>::type
  150. rings1 = geometry::interior_rings(poly1);
  151. typename geometry::interior_return_type<Polygon2>::type
  152. rings2 = geometry::interior_rings(poly2);
  153. typename detail::interior_iterator<Polygon1 const>::type
  154. it1 = boost::begin(rings1);
  155. typename detail::interior_iterator<Polygon2>::type
  156. it2 = boost::begin(rings2);
  157. for ( ; it1 != boost::end(rings1); ++it1, ++it2)
  158. {
  159. if ( ! transform_range_out<point2_type>(*it1,
  160. range::back_inserter(*it2),
  161. strategy) )
  162. {
  163. return false;
  164. }
  165. }
  166. return true;
  167. }
  168. };
  169. template <typename Point1, typename Point2>
  170. struct select_strategy
  171. {
  172. typedef typename strategy::transform::services::default_strategy
  173. <
  174. typename cs_tag<Point1>::type,
  175. typename cs_tag<Point2>::type,
  176. typename coordinate_system<Point1>::type,
  177. typename coordinate_system<Point2>::type,
  178. dimension<Point1>::type::value,
  179. dimension<Point2>::type::value,
  180. typename point_type<Point1>::type,
  181. typename point_type<Point2>::type
  182. >::type type;
  183. };
  184. struct transform_range
  185. {
  186. template <typename Range1, typename Range2, typename Strategy>
  187. static inline bool apply(Range1 const& range1,
  188. Range2& range2, Strategy const& strategy)
  189. {
  190. typedef typename point_type<Range2>::type point_type;
  191. // Should NOT be done here!
  192. // geometry::clear(range2);
  193. return transform_range_out<point_type>(range1,
  194. range::back_inserter(range2), strategy);
  195. }
  196. };
  197. /*!
  198. \brief Is able to transform any multi-geometry, calling the single-version as policy
  199. */
  200. template <typename Policy>
  201. struct transform_multi
  202. {
  203. template <typename Multi1, typename Multi2, typename S>
  204. static inline bool apply(Multi1 const& multi1, Multi2& multi2, S const& strategy)
  205. {
  206. traits::resize<Multi2>::apply(multi2, boost::size(multi1));
  207. typename boost::range_iterator<Multi1 const>::type it1
  208. = boost::begin(multi1);
  209. typename boost::range_iterator<Multi2>::type it2
  210. = boost::begin(multi2);
  211. for (; it1 != boost::end(multi1); ++it1, ++it2)
  212. {
  213. if (! Policy::apply(*it1, *it2, strategy))
  214. {
  215. return false;
  216. }
  217. }
  218. return true;
  219. }
  220. };
  221. }} // namespace detail::transform
  222. #endif // DOXYGEN_NO_DETAIL
  223. #ifndef DOXYGEN_NO_DISPATCH
  224. namespace dispatch
  225. {
  226. template
  227. <
  228. typename Geometry1, typename Geometry2,
  229. typename Tag1 = typename tag_cast<typename tag<Geometry1>::type, multi_tag>::type,
  230. typename Tag2 = typename tag_cast<typename tag<Geometry2>::type, multi_tag>::type
  231. >
  232. struct transform {};
  233. template <typename Point1, typename Point2>
  234. struct transform<Point1, Point2, point_tag, point_tag>
  235. : detail::transform::transform_point
  236. {
  237. };
  238. template <typename Linestring1, typename Linestring2>
  239. struct transform
  240. <
  241. Linestring1, Linestring2,
  242. linestring_tag, linestring_tag
  243. >
  244. : detail::transform::transform_range
  245. {
  246. };
  247. template <typename Range1, typename Range2>
  248. struct transform<Range1, Range2, ring_tag, ring_tag>
  249. : detail::transform::transform_range
  250. {
  251. };
  252. template <typename Polygon1, typename Polygon2>
  253. struct transform<Polygon1, Polygon2, polygon_tag, polygon_tag>
  254. : detail::transform::transform_polygon
  255. {
  256. };
  257. template <typename Box1, typename Box2>
  258. struct transform<Box1, Box2, box_tag, box_tag>
  259. : detail::transform::transform_box
  260. {
  261. };
  262. template <typename Segment1, typename Segment2>
  263. struct transform<Segment1, Segment2, segment_tag, segment_tag>
  264. : detail::transform::transform_box_or_segment
  265. {
  266. };
  267. template <typename Multi1, typename Multi2>
  268. struct transform
  269. <
  270. Multi1, Multi2,
  271. multi_tag, multi_tag
  272. >
  273. : detail::transform::transform_multi
  274. <
  275. dispatch::transform
  276. <
  277. typename boost::range_value<Multi1>::type,
  278. typename boost::range_value<Multi2>::type
  279. >
  280. >
  281. {};
  282. } // namespace dispatch
  283. #endif // DOXYGEN_NO_DISPATCH
  284. namespace resolve_strategy {
  285. struct transform
  286. {
  287. template <typename Geometry1, typename Geometry2, typename Strategy>
  288. static inline bool apply(Geometry1 const& geometry1,
  289. Geometry2& geometry2,
  290. Strategy const& strategy)
  291. {
  292. concepts::check<Geometry1 const>();
  293. concepts::check<Geometry2>();
  294. return dispatch::transform<Geometry1, Geometry2>::apply(
  295. geometry1,
  296. geometry2,
  297. strategy
  298. );
  299. }
  300. template <typename Geometry1, typename Geometry2>
  301. static inline bool apply(Geometry1 const& geometry1,
  302. Geometry2& geometry2,
  303. default_strategy)
  304. {
  305. return apply(
  306. geometry1,
  307. geometry2,
  308. typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
  309. );
  310. }
  311. };
  312. } // namespace resolve_strategy
  313. namespace resolve_variant {
  314. template <typename Geometry1, typename Geometry2>
  315. struct transform
  316. {
  317. template <typename Strategy>
  318. static inline bool apply(Geometry1 const& geometry1,
  319. Geometry2& geometry2,
  320. Strategy const& strategy)
  321. {
  322. return resolve_strategy::transform::apply(
  323. geometry1,
  324. geometry2,
  325. strategy
  326. );
  327. }
  328. };
  329. template <BOOST_VARIANT_ENUM_PARAMS(typename T), typename Geometry2>
  330. struct transform<boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2>
  331. {
  332. template <typename Strategy>
  333. struct visitor: static_visitor<bool>
  334. {
  335. Geometry2& m_geometry2;
  336. Strategy const& m_strategy;
  337. visitor(Geometry2& geometry2, Strategy const& strategy)
  338. : m_geometry2(geometry2)
  339. , m_strategy(strategy)
  340. {}
  341. template <typename Geometry1>
  342. inline bool operator()(Geometry1 const& geometry1) const
  343. {
  344. return transform<Geometry1, Geometry2>::apply(
  345. geometry1,
  346. m_geometry2,
  347. m_strategy
  348. );
  349. }
  350. };
  351. template <typename Strategy>
  352. static inline bool apply(
  353. boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)> const& geometry1,
  354. Geometry2& geometry2,
  355. Strategy const& strategy
  356. )
  357. {
  358. return boost::apply_visitor(visitor<Strategy>(geometry2, strategy), geometry1);
  359. }
  360. };
  361. } // namespace resolve_variant
  362. /*!
  363. \brief Transforms from one geometry to another geometry \brief_strategy
  364. \ingroup transform
  365. \tparam Geometry1 \tparam_geometry
  366. \tparam Geometry2 \tparam_geometry
  367. \tparam Strategy strategy
  368. \param geometry1 \param_geometry
  369. \param geometry2 \param_geometry
  370. \param strategy The strategy to be used for transformation
  371. \return True if the transformation could be done
  372. \qbk{distinguish,with strategy}
  373. \qbk{[include reference/algorithms/transform_with_strategy.qbk]}
  374. */
  375. template <typename Geometry1, typename Geometry2, typename Strategy>
  376. inline bool transform(Geometry1 const& geometry1, Geometry2& geometry2,
  377. Strategy const& strategy)
  378. {
  379. return resolve_variant::transform<Geometry1, Geometry2>
  380. ::apply(geometry1, geometry2, strategy);
  381. }
  382. /*!
  383. \brief Transforms from one geometry to another geometry using a strategy
  384. \ingroup transform
  385. \tparam Geometry1 \tparam_geometry
  386. \tparam Geometry2 \tparam_geometry
  387. \param geometry1 \param_geometry
  388. \param geometry2 \param_geometry
  389. \return True if the transformation could be done
  390. \qbk{[include reference/algorithms/transform.qbk]}
  391. */
  392. template <typename Geometry1, typename Geometry2>
  393. inline bool transform(Geometry1 const& geometry1, Geometry2& geometry2)
  394. {
  395. return geometry::transform(geometry1, geometry2, default_strategy());
  396. }
  397. }} // namespace boost::geometry
  398. #endif // BOOST_GEOMETRY_ALGORITHMS_TRANSFORM_HPP