123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405 |
- // Boost.Geometry (aka GGL, Generic Geometry Library)
- // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
- // This file was modified by Oracle on 2014, 2017, 2019.
- // Modifications copyright (c) 2014-2019, Oracle and/or its affiliates.
- // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
- // 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_ALGORITHMS_DETAIL_INTERSECTION_INTERFACE_HPP
- #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_INTERSECTION_INTERFACE_HPP
- #include <boost/variant/apply_visitor.hpp>
- #include <boost/variant/static_visitor.hpp>
- #include <boost/variant/variant_fwd.hpp>
- #include <boost/geometry/algorithms/detail/overlay/intersection_insert.hpp>
- #include <boost/geometry/policies/robustness/get_rescale_policy.hpp>
- #include <boost/geometry/strategies/default_strategy.hpp>
- #include <boost/geometry/util/range.hpp>
- namespace boost { namespace geometry
- {
- #ifndef DOXYGEN_NO_DISPATCH
- namespace dispatch
- {
- // By default, all is forwarded to the intersection_insert-dispatcher
- template
- <
- typename Geometry1, typename Geometry2,
- typename Tag1 = typename geometry::tag<Geometry1>::type,
- typename Tag2 = typename geometry::tag<Geometry2>::type,
- bool Reverse = reverse_dispatch<Geometry1, Geometry2>::type::value
- >
- struct intersection
- {
- template <typename RobustPolicy, typename GeometryOut, typename Strategy>
- static inline bool apply(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- RobustPolicy const& robust_policy,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- typedef typename boost::range_value<GeometryOut>::type OneOut;
- intersection_insert
- <
- Geometry1, Geometry2, OneOut,
- overlay_intersection
- >::apply(geometry1, geometry2, robust_policy,
- range::back_inserter(geometry_out), strategy);
- return true;
- }
- };
- // If reversal is needed, perform it
- template
- <
- typename Geometry1, typename Geometry2,
- typename Tag1, typename Tag2
- >
- struct intersection
- <
- Geometry1, Geometry2,
- Tag1, Tag2,
- true
- >
- : intersection<Geometry2, Geometry1, Tag2, Tag1, false>
- {
- template <typename RobustPolicy, typename GeometryOut, typename Strategy>
- static inline bool apply(
- Geometry1 const& g1,
- Geometry2 const& g2,
- RobustPolicy const& robust_policy,
- GeometryOut& out,
- Strategy const& strategy)
- {
- return intersection
- <
- Geometry2, Geometry1,
- Tag2, Tag1,
- false
- >::apply(g2, g1, robust_policy, out, strategy);
- }
- };
- } // namespace dispatch
- #endif // DOXYGEN_NO_DISPATCH
- namespace resolve_strategy {
- struct intersection
- {
- template
- <
- typename Geometry1,
- typename Geometry2,
- typename GeometryOut,
- typename Strategy
- >
- static inline bool apply(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut & geometry_out,
- Strategy const& strategy)
- {
- typedef typename geometry::rescale_overlay_policy_type
- <
- Geometry1,
- Geometry2,
- typename Strategy::cs_tag
- >::type rescale_policy_type;
-
- rescale_policy_type robust_policy
- = geometry::get_rescale_policy<rescale_policy_type>(
- geometry1, geometry2, strategy);
- return dispatch::intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, geometry2, robust_policy, geometry_out,
- strategy);
- }
- template
- <
- typename Geometry1,
- typename Geometry2,
- typename GeometryOut
- >
- static inline bool apply(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut & geometry_out,
- default_strategy)
- {
- typedef typename geometry::rescale_overlay_policy_type
- <
- Geometry1,
- Geometry2,
- typename geometry::cs_tag<Geometry1>::type
- >::type rescale_policy_type;
-
- typename strategy::relate::services::default_strategy
- <
- Geometry1, Geometry2
- >::type strategy;
- rescale_policy_type robust_policy
- = geometry::get_rescale_policy<rescale_policy_type>(
- geometry1, geometry2, strategy);
- return dispatch::intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, geometry2, robust_policy, geometry_out,
- strategy);
- }
- };
- } // resolve_strategy
- namespace resolve_variant
- {
-
- template <typename Geometry1, typename Geometry2>
- struct intersection
- {
- template <typename GeometryOut, typename Strategy>
- static inline bool apply(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- concepts::check<Geometry1 const>();
- concepts::check<Geometry2 const>();
-
- return resolve_strategy::intersection::apply(geometry1,
- geometry2,
- geometry_out,
- strategy);
- }
- };
- template <BOOST_VARIANT_ENUM_PARAMS(typename T), typename Geometry2>
- struct intersection<variant<BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2>
- {
- template <typename GeometryOut, typename Strategy>
- struct visitor: static_visitor<bool>
- {
- Geometry2 const& m_geometry2;
- GeometryOut& m_geometry_out;
- Strategy const& m_strategy;
-
- visitor(Geometry2 const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- : m_geometry2(geometry2)
- , m_geometry_out(geometry_out)
- , m_strategy(strategy)
- {}
-
- template <typename Geometry1>
- bool operator()(Geometry1 const& geometry1) const
- {
- return intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, m_geometry2, m_geometry_out, m_strategy);
- }
- };
-
- template <typename GeometryOut, typename Strategy>
- static inline bool
- apply(variant<BOOST_VARIANT_ENUM_PARAMS(T)> const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- return boost::apply_visitor(visitor<GeometryOut, Strategy>(geometry2,
- geometry_out,
- strategy),
- geometry1);
- }
- };
- template <typename Geometry1, BOOST_VARIANT_ENUM_PARAMS(typename T)>
- struct intersection<Geometry1, variant<BOOST_VARIANT_ENUM_PARAMS(T)> >
- {
- template <typename GeometryOut, typename Strategy>
- struct visitor: static_visitor<bool>
- {
- Geometry1 const& m_geometry1;
- GeometryOut& m_geometry_out;
- Strategy const& m_strategy;
-
- visitor(Geometry1 const& geometry1,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- : m_geometry1(geometry1)
- , m_geometry_out(geometry_out)
- , m_strategy(strategy)
- {}
-
- template <typename Geometry2>
- bool operator()(Geometry2 const& geometry2) const
- {
- return intersection
- <
- Geometry1,
- Geometry2
- >::apply(m_geometry1, geometry2, m_geometry_out, m_strategy);
- }
- };
-
- template <typename GeometryOut, typename Strategy>
- static inline bool
- apply(Geometry1 const& geometry1,
- variant<BOOST_VARIANT_ENUM_PARAMS(T)> const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- return boost::apply_visitor(visitor<GeometryOut, Strategy>(geometry1,
- geometry_out,
- strategy),
- geometry2);
- }
- };
- template <BOOST_VARIANT_ENUM_PARAMS(typename T1), BOOST_VARIANT_ENUM_PARAMS(typename T2)>
- struct intersection<variant<BOOST_VARIANT_ENUM_PARAMS(T1)>, variant<BOOST_VARIANT_ENUM_PARAMS(T2)> >
- {
- template <typename GeometryOut, typename Strategy>
- struct visitor: static_visitor<bool>
- {
- GeometryOut& m_geometry_out;
- Strategy const& m_strategy;
-
- visitor(GeometryOut& geometry_out, Strategy const& strategy)
- : m_geometry_out(geometry_out)
- , m_strategy(strategy)
- {}
-
- template <typename Geometry1, typename Geometry2>
- bool operator()(Geometry1 const& geometry1,
- Geometry2 const& geometry2) const
- {
- return intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, geometry2, m_geometry_out, m_strategy);
- }
- };
-
- template <typename GeometryOut, typename Strategy>
- static inline bool
- apply(variant<BOOST_VARIANT_ENUM_PARAMS(T1)> const& geometry1,
- variant<BOOST_VARIANT_ENUM_PARAMS(T2)> const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- return boost::apply_visitor(visitor<GeometryOut, Strategy>(geometry_out,
- strategy),
- geometry1, geometry2);
- }
- };
-
- } // namespace resolve_variant
-
- /*!
- \brief \brief_calc2{intersection}
- \ingroup intersection
- \details \details_calc2{intersection, spatial set theoretic intersection}.
- \tparam Geometry1 \tparam_geometry
- \tparam Geometry2 \tparam_geometry
- \tparam GeometryOut Collection of geometries (e.g. std::vector, std::deque, boost::geometry::multi*) of which
- the value_type fulfills a \p_l_or_c concept, or it is the output geometry (e.g. for a box)
- \tparam Strategy \tparam_strategy{Intersection}
- \param geometry1 \param_geometry
- \param geometry2 \param_geometry
- \param geometry_out The output geometry, either a multi_point, multi_polygon,
- multi_linestring, or a box (for intersection of two boxes)
- \param strategy \param_strategy{intersection}
- \qbk{distinguish,with strategy}
- \qbk{[include reference/algorithms/intersection.qbk]}
- */
- template
- <
- typename Geometry1,
- typename Geometry2,
- typename GeometryOut,
- typename Strategy
- >
- inline bool intersection(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut& geometry_out,
- Strategy const& strategy)
- {
- return resolve_variant::intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, geometry2, geometry_out, strategy);
- }
- /*!
- \brief \brief_calc2{intersection}
- \ingroup intersection
- \details \details_calc2{intersection, spatial set theoretic intersection}.
- \tparam Geometry1 \tparam_geometry
- \tparam Geometry2 \tparam_geometry
- \tparam GeometryOut Collection of geometries (e.g. std::vector, std::deque, boost::geometry::multi*) of which
- the value_type fulfills a \p_l_or_c concept, or it is the output geometry (e.g. for a box)
- \param geometry1 \param_geometry
- \param geometry2 \param_geometry
- \param geometry_out The output geometry, either a multi_point, multi_polygon,
- multi_linestring, or a box (for intersection of two boxes)
- \qbk{[include reference/algorithms/intersection.qbk]}
- */
- template
- <
- typename Geometry1,
- typename Geometry2,
- typename GeometryOut
- >
- inline bool intersection(Geometry1 const& geometry1,
- Geometry2 const& geometry2,
- GeometryOut& geometry_out)
- {
- return resolve_variant::intersection
- <
- Geometry1,
- Geometry2
- >::apply(geometry1, geometry2, geometry_out, default_strategy());
- }
- }} // namespace boost::geometry
- #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_INTERSECTION_INTERFACE_HPP
|