/usr/include/boost/geometry/algorithms/detail/touches
Edit: /usr/include/boost/geometry/algorithms/detail/touches/implementation.hpp (14155B)
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2008-2015 Bruno Lalande, Paris, France.
// Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
// Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
// This file was modified by Oracle on 2013, 2014, 2015, 2017, 2019.
// Modifications copyright (c) 2013-2019, Oracle and/or its affiliates.
// Contributed and/or modified by Adam Wulkiewicz, 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_TOUCHES_IMPLEMENTATION_HPP
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_TOUCHES_IMPLEMENTATION_HPP
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace geometry
{
#ifndef DOXYGEN_NO_DETAIL
namespace detail { namespace touches
{
// Box/Box
template
<
std::size_t Dimension,
std::size_t DimensionCount
>
struct box_box_loop
{
template
static inline bool apply(Box1 const& b1, Box2 const& b2, bool & touch)
{
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);
// TODO assert or exception?
//BOOST_GEOMETRY_ASSERT(min1 <= max1 && min2 <= max2);
if (max1 < min2 || max2 < min1)
{
return false;
}
if (max1 == min2 || max2 == min1)
{
touch = true;
}
return box_box_loop
<
Dimension + 1,
DimensionCount
>::apply(b1, b2, touch);
}
};
template
<
std::size_t DimensionCount
>
struct box_box_loop
{
template
static inline bool apply(Box1 const& , Box2 const&, bool &)
{
return true;
}
};
struct box_box
{
template
static inline bool apply(Box1 const& b1, Box2 const& b2, Strategy const& /*strategy*/)
{
BOOST_STATIC_ASSERT((boost::is_same
<
typename geometry::coordinate_system::type,
typename geometry::coordinate_system::type
>::value
));
assert_dimension_equal();
bool touches = false;
bool ok = box_box_loop
<
0,
dimension::type::value
>::apply(b1, b2, touches);
return ok && touches;
}
};
// Areal/Areal
struct areal_interrupt_policy
{
static bool const enabled = true;
bool found_touch;
bool found_not_touch;
// dummy variable required by self_get_turn_points::get_turns
static bool const has_intersections = false;
inline bool result()
{
return found_touch && !found_not_touch;
}
inline areal_interrupt_policy()
: found_touch(false), found_not_touch(false)
{}
template
inline bool apply(Range const& range)
{
// if already rejected (temp workaround?)
if ( found_not_touch )
return true;
typedef typename boost::range_iterator::type iterator;
for ( iterator it = boost::begin(range) ; it != boost::end(range) ; ++it )
{
if ( it->has(overlay::operation_intersection) )
{
found_not_touch = true;
return true;
}
switch(it->method)
{
case overlay::method_crosses:
found_not_touch = true;
return true;
case overlay::method_equal:
// Segment spatially equal means: at the right side
// the polygon internally overlaps. So return false.
found_not_touch = true;
return true;
case overlay::method_touch:
case overlay::method_touch_interior:
case overlay::method_collinear:
if ( ok_for_touch(*it) )
{
found_touch = true;
}
else
{
found_not_touch = true;
return true;
}
break;
case overlay::method_none :
case overlay::method_disjoint :
case overlay::method_error :
break;
}
}
return false;
}
template
inline bool ok_for_touch(Turn const& turn)
{
return turn.both(overlay::operation_union)
|| turn.both(overlay::operation_blocked)
|| turn.combination(overlay::operation_union, overlay::operation_blocked)
;
}
};
template
struct check_each_ring_for_within
{
bool has_within;
Geometry const& m_geometry;
PointInRingStrategy const& m_strategy;
inline check_each_ring_for_within(Geometry const& g, PointInRingStrategy const& strategy)
: has_within(false)
, m_geometry(g)
, m_strategy(strategy)
{}
template
inline void apply(Range const& range)
{
typename geometry::point_type::type p;
geometry::point_on_border(p, range);
if ( !has_within && geometry::within(p, m_geometry, m_strategy) )
{
has_within = true;
}
}
};
template
inline bool rings_containing(FirstGeometry const& geometry1,
SecondGeometry const& geometry2,
IntersectionStrategy const& strategy)
{
// NOTE: This strategy could be defined inside IntersectionStrategy
typedef typename IntersectionStrategy::template point_in_geometry_strategy
<
FirstGeometry, SecondGeometry
>::type point_in_ring_strategy_type;
point_in_ring_strategy_type point_in_ring_strategy
= strategy.template get_point_in_geometry_strategy();
check_each_ring_for_within
<
FirstGeometry, point_in_ring_strategy_type
> checker(geometry1, point_in_ring_strategy);
geometry::detail::for_each_range(geometry2, checker);
return checker.has_within;
}
template
struct areal_areal
{
template
static inline bool apply(Geometry1 const& geometry1,
Geometry2 const& geometry2,
IntersectionStrategy const& strategy)
{
typedef typename geometry::point_type::type point_type;
typedef detail::overlay::turn_info turn_info;
std::deque turns;
detail::touches::areal_interrupt_policy policy;
boost::geometry::get_turns
<
detail::overlay::do_reverse::value>::value,
detail::overlay::do_reverse::value>::value,
detail::overlay::assign_null_policy
>(geometry1, geometry2, strategy, detail::no_rescale_policy(), turns, policy);
return policy.result()
&& ! geometry::detail::touches::rings_containing(geometry1, geometry2, strategy)
&& ! geometry::detail::touches::rings_containing(geometry2, geometry1, strategy);
}
};
// P/*
struct use_point_in_geometry
{
template
static inline bool apply(Point const& point, Geometry const& geometry, Strategy const& strategy)
{
return detail::within::point_in_geometry(point, geometry, strategy) == 0;
}
};
}}
#endif // DOXYGEN_NO_DETAIL
#ifndef DOXYGEN_NO_DISPATCH
namespace dispatch {
// P/P
template
struct touches
{
template
static inline bool apply(Geometry1 const& , Geometry2 const& , Strategy const&)
{
return false;
}
};
template
struct touches
{
template
static inline bool apply(Geometry1 const& , Geometry2 const& , Strategy const&)
{
return false;
}
};
template
struct touches
{
template
static inline bool apply(Geometry1 const&, Geometry2 const&, Strategy const&)
{
return false;
}
};
// P/L P/A
template
struct touches
: detail::touches::use_point_in_geometry
{};
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
MultiPoint,
MultiGeometry
>
{};
// L/P A/P
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
Geometry,
MultiPoint
>
{};
// Box/Box
template
struct touches
: detail::touches::box_box
{};
template
struct touches
: detail::touches::box_box
{};
// L/L
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
Linear1,
Linear2
>
{};
// L/A
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
Linear,
Areal
>
{};
// A/L
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
Areal,
Linear
>
{};
// A/A
template
struct touches
: detail::relate::relate_impl
<
detail::de9im::static_mask_touches_type,
Areal1,
Areal2
>
{};
template
struct touches
: detail::touches::areal_areal
{};
} // namespace dispatch
#endif // DOXYGEN_NO_DISPATCH
namespace resolve_variant
{
template
struct self_touches
{
static bool apply(Geometry const& geometry)
{
concepts::check();
typedef typename strategy::relate::services::default_strategy
<
Geometry, Geometry
>::type strategy_type;
typedef typename geometry::point_type::type point_type;
typedef detail::overlay::turn_info turn_info;
typedef detail::overlay::get_turn_info
<
detail::overlay::assign_null_policy
> policy_type;
std::deque turns;
detail::touches::areal_interrupt_policy policy;
strategy_type strategy;
// TODO: skip_adjacent should be set to false
detail::self_get_turn_points::get_turns
<
false, policy_type
>::apply(geometry, strategy, detail::no_rescale_policy(), turns, policy, 0, true);
return policy.result();
}
};
}
}} // namespace boost::geometry
#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_TOUCHES_IMPLEMENTATION_HPP