// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2015, Oracle and/or its affiliates. // Licensed under the Boost Software License version 1.0. // http://www.boost.org/users/license.html // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle #ifndef BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_POINTLIKE_LINEAR_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_POINTLIKE_LINEAR_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace overlay { // action struct for pointlike-linear difference/intersection // it works the same as its pointlike-pointlike counterpart, hence the // derivation template struct action_selector_pl_l : action_selector_pl_pl {}; // difference/intersection of point-linear template < typename Point, typename Linear, typename PointOut, overlay_type OverlayType, typename Policy > struct point_linear_point { template static inline OutputIterator apply(Point const& point, Linear const& linear, RobustPolicy const&, OutputIterator oit, Strategy const&) { action_selector_pl_l < PointOut, OverlayType >::apply(point, Policy::apply(point, linear), oit); return oit; } }; // difference/intersection of multipoint-segment template < typename MultiPoint, typename Segment, typename PointOut, overlay_type OverlayType, typename Policy > struct multipoint_segment_point { template static inline OutputIterator apply(MultiPoint const& multipoint, Segment const& segment, RobustPolicy const&, OutputIterator oit, Strategy const&) { for (typename boost::range_iterator::type it = boost::begin(multipoint); it != boost::end(multipoint); ++it) { action_selector_pl_l < PointOut, OverlayType >::apply(*it, Policy::apply(*it, segment), oit); } return oit; } }; // difference/intersection of multipoint-linear template < typename MultiPoint, typename Linear, typename PointOut, overlay_type OverlayType, typename Policy > class multipoint_linear_point { private: // structs for partition -- start struct expand_box { template static inline void apply(Box& total, Geometry const& geometry) { geometry::expand(total, geometry::return_envelope(geometry)); } }; struct overlaps_box { template static inline bool apply(Box const& box, Geometry const& geometry) { return ! geometry::disjoint(geometry, box); } }; template class item_visitor_type { public: item_visitor_type(OutputIterator& oit) : m_oit(oit) {} template inline void apply(Item1 const& item1, Item2 const& item2) { action_selector_pl_l < PointOut, overlay_intersection >::apply(item1, Policy::apply(item1, item2), m_oit); } private: OutputIterator& m_oit; }; // structs for partition -- end class segment_range { public: typedef geometry::segment_iterator const_iterator; typedef const_iterator iterator; segment_range(Linear const& linear) : m_linear(linear) {} const_iterator begin() const { return geometry::segments_begin(m_linear); } const_iterator end() const { return geometry::segments_end(m_linear); } private: Linear const& m_linear; }; template static inline OutputIterator get_common_points(MultiPoint const& multipoint, Linear const& linear, OutputIterator oit) { item_visitor_type item_visitor(oit); segment_range rng(linear); geometry::partition < geometry::model::box < typename boost::range_value::type >, expand_box, overlaps_box >::apply(multipoint, rng, item_visitor); return oit; } public: template static inline OutputIterator apply(MultiPoint const& multipoint, Linear const& linear, RobustPolicy const& robust_policy, OutputIterator oit, Strategy const& strategy) { typedef std::vector < typename boost::range_value::type > point_vector_type; point_vector_type common_points; // compute the common points get_common_points(multipoint, linear, std::back_inserter(common_points)); return multipoint_multipoint_point < MultiPoint, point_vector_type, PointOut, OverlayType >::apply(multipoint, common_points, robust_policy, oit, strategy); } }; }} // namespace detail::overlay #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace detail_dispatch { namespace overlay { // dispatch struct for pointlike-linear difference/intersection computation template < typename PointLike, typename Linear, typename PointOut, overlay_type OverlayType, typename Tag1, typename Tag2 > struct pointlike_linear_point : not_implemented {}; template < typename Point, typename Linear, typename PointOut, overlay_type OverlayType > struct pointlike_linear_point < Point, Linear, PointOut, OverlayType, point_tag, linear_tag > : detail::overlay::point_linear_point < Point, Linear, PointOut, OverlayType, detail::not_ > {}; template < typename Point, typename Segment, typename PointOut, overlay_type OverlayType > struct pointlike_linear_point < Point, Segment, PointOut, OverlayType, point_tag, segment_tag > : detail::overlay::point_linear_point < Point, Segment, PointOut, OverlayType, detail::not_ > {}; template < typename MultiPoint, typename Linear, typename PointOut, overlay_type OverlayType > struct pointlike_linear_point < MultiPoint, Linear, PointOut, OverlayType, multi_point_tag, linear_tag > : detail::overlay::multipoint_linear_point < MultiPoint, Linear, PointOut, OverlayType, detail::not_ > {}; template < typename MultiPoint, typename Segment, typename PointOut, overlay_type OverlayType > struct pointlike_linear_point < MultiPoint, Segment, PointOut, OverlayType, multi_point_tag, segment_tag > : detail::overlay::multipoint_segment_point < MultiPoint, Segment, PointOut, OverlayType, detail::not_ > {}; }} // namespace detail_dispatch::overlay #endif // DOXYGEN_NO_DISPATCH }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_POINTLIKE_LINEAR_HPP