summaryrefslogtreecommitdiff log msg author committer range
 ```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 ``` ``````// 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. // This file was modified by Oracle on 2013-2014. // Modifications copyright (c) 2013-2014, Oracle and/or its affiliates. // 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_INTERSECTS_HPP #define BOOST_GEOMETRY_ALGORITHMS_INTERSECTS_HPP #include #include #include #include #include #include namespace boost { namespace geometry { /*! \brief \brief_check{has at least one intersection (crossing or self-tangency)} \note This function can be called for one geometry (self-intersection) and also for two geometries (intersection) \ingroup intersects \tparam Geometry \tparam_geometry \param geometry \param_geometry \return \return_check{is self-intersecting} \qbk{distinguish,one geometry} \qbk{[def __one_parameter__]} \qbk{[include reference/algorithms/intersects.qbk]} */ template inline bool intersects(Geometry const& geometry) { concepts::check(); typedef typename geometry::point_type::type point_type; typedef detail::no_rescale_policy rescale_policy_type; typedef detail::overlay::turn_info < point_type, typename segment_ratio_type::type > turn_info; std::deque turns; typedef detail::overlay::get_turn_info < detail::overlay::assign_null_policy > turn_policy; rescale_policy_type robust_policy; detail::disjoint::disjoint_interrupt_policy policy; detail::self_get_turn_points::get_turns < turn_policy >::apply(geometry, robust_policy, turns, policy); return policy.has_intersections; } /*! \brief \brief_check2{have at least one intersection} \ingroup intersects \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \param geometry1 \param_geometry \param geometry2 \param_geometry \return \return_check2{intersect each other} \qbk{distinguish,two geometries} \qbk{[include reference/algorithms/intersects.qbk]} */ template inline bool intersects(Geometry1 const& geometry1, Geometry2 const& geometry2) { concepts::check(); concepts::check(); return ! geometry::disjoint(geometry1, geometry2); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_INTERSECTS_HPP ``````