// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2008-2012 Bruno Lalande, Paris, France. // Copyright (c) 2009-2012 Mateusz Loskot, London, UK. // 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_OVERLAPS_HPP #define BOOST_GEOMETRY_ALGORITHMS_OVERLAPS_HPP #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace overlaps { template < typename Box1, typename Box2, std::size_t Dimension, std::size_t DimensionCount > struct box_box_loop { static inline void apply(Box1 const& b1, Box2 const& b2, bool& overlaps, bool& one_in_two, bool& two_in_one) { assert_dimension_equal(); typedef typename coordinate_type::type coordinate_type1; typedef typename coordinate_type::type coordinate_type2; coordinate_type1 const& min1 = get(b1); coordinate_type1 const& max1 = get(b1); coordinate_type2 const& min2 = get(b2); coordinate_type2 const& max2 = get(b2); // We might use the (not yet accepted) Boost.Interval // submission in the future // If: // B1: |-------| // B2: |------| // in any dimension -> no overlap if (max1 <= min2 || min1 >= max2) { overlaps = false; return; } // If: // B1: |--------------------| // B2: |-------------| // in all dimensions -> within, then no overlap // B1: |--------------------| // B2: |-------------| // this is "within-touch" -> then no overlap. So use < and > if (min1 < min2 || max1 > max2) { one_in_two = false; } // Same other way round if (min2 < min1 || max2 > max1) { two_in_one = false; } box_box_loop < Box1, Box2, Dimension + 1, DimensionCount >::apply(b1, b2, overlaps, one_in_two, two_in_one); } }; template < typename Box1, typename Box2, std::size_t DimensionCount > struct box_box_loop { static inline void apply(Box1 const& , Box2 const&, bool&, bool&, bool&) { } }; template < typename Box1, typename Box2 > struct box_box { static inline bool apply(Box1 const& b1, Box2 const& b2) { bool overlaps = true; bool within1 = true; bool within2 = true; box_box_loop < Box1, Box2, 0, dimension::type::value >::apply(b1, b2, overlaps, within1, within2); /* \see http://docs.codehaus.org/display/GEOTDOC/02+Geometry+Relationships#02GeometryRelationships-Overlaps where is stated that "inside" is not an "overlap", this is true and is implemented as such. */ return overlaps && ! within1 && ! within2; } }; }} // namespace detail::overlaps #endif // DOXYGEN_NO_DETAIL //struct not_implemented_for_this_geometry_type : public boost::false_type {}; #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template < typename Tag1, typename Tag2, typename Geometry1, typename Geometry2 > struct overlaps { BOOST_MPL_ASSERT_MSG ( false, NOT_OR_NOT_YET_IMPLEMENTED_FOR_THIS_GEOMETRY_TYPE , (types) ); }; template struct overlaps : detail::overlaps::box_box {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH /*! \brief \brief_check2{overlap} \ingroup overlaps \return \return_check2{overlap} \qbk{[include reference/algorithms/overlaps.qbk]} */ template inline bool overlaps(Geometry1 const& geometry1, Geometry2 const& geometry2) { concept::check(); concept::check(); return dispatch::overlaps < typename tag::type, typename tag::type, Geometry1, Geometry2 >::apply(geometry1, geometry2); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_OVERLAPS_HPP