// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2014 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2008-2014 Bruno Lalande, Paris, France. // Copyright (c) 2009-2014 Mateusz Loskot, London, UK. // Copyright (c) 2013-2014 Adam Wulkiewicz, Lodz, Poland. // This file was modified by Oracle on 2013-2019. // Modifications copyright (c) 2013-2019, Oracle and/or its affiliates. // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library // (geolib/GGL), copyright (c) 1995-2010 Geodan, 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) #ifndef BOOST_GEOMETRY_ALGORITHMS_DETAIL_DISJOINT_AREAL_AREAL_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_DISJOINT_AREAL_AREAL_HPP #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace disjoint { template inline bool point_on_border_covered_by(Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { typename geometry::point_type::type pt; return geometry::point_on_border(pt, geometry1) && geometry::covered_by(pt, geometry2, strategy); } /*! \tparam Strategy point_in_geometry strategy */ template struct check_each_ring_for_within { bool not_disjoint; Geometry const& m_geometry; Strategy const& m_strategy; inline check_each_ring_for_within(Geometry const& g, Strategy const& strategy) : not_disjoint(false) , m_geometry(g) , m_strategy(strategy) {} template inline void apply(Range const& range) { not_disjoint = not_disjoint || point_on_border_covered_by(range, m_geometry, m_strategy); } }; /*! \tparam Strategy point_in_geometry strategy */ template inline bool rings_containing(FirstGeometry const& geometry1, SecondGeometry const& geometry2, Strategy const& strategy) { check_each_ring_for_within < FirstGeometry, Strategy > checker(geometry1, strategy); geometry::detail::for_each_range(geometry2, checker); return checker.not_disjoint; } template struct areal_areal { /*! \tparam Strategy relate (segments intersection) strategy */ template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { if ( ! disjoint_linear::apply(geometry1, geometry2, strategy) ) { return false; } // If there is no intersection of segments, they might located // inside each other // We check that using a point on the border (external boundary), // and see if that is contained in the other geometry. And vice versa. if ( rings_containing(geometry1, geometry2, strategy.template get_point_in_geometry_strategy()) || rings_containing(geometry2, geometry1, strategy.template get_point_in_geometry_strategy()) ) { return false; } return true; } }; template struct areal_box { /*! \tparam Strategy relate (segments intersection) strategy */ template static inline bool apply(Areal const& areal, Box const& box, Strategy const& strategy) { if ( ! for_each_segment(geometry::segments_begin(areal), geometry::segments_end(areal), box, strategy.get_disjoint_segment_box_strategy()) ) { return false; } // If there is no intersection of any segment and box, // the box might be located inside areal geometry if ( point_on_border_covered_by(box, areal, strategy.template get_point_in_geometry_strategy()) ) { return false; } return true; } private: template static inline bool for_each_segment(SegIter first, SegIter last, Box const& box, Strategy const& strategy) { for ( ; first != last ; ++first) { if (! disjoint_segment_box::apply(*first, box, strategy)) { return false; } } return true; } }; }} // namespace detail::disjoint #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template struct disjoint : detail::disjoint::areal_areal {}; template struct disjoint : detail::disjoint::areal_box {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_DISJOINT_AREAL_AREAL_HPP