1354 lines
41 KiB
C++
1354 lines
41 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library)
|
|
|
|
// Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
|
|
|
|
// This file was modified by Oracle on 2014, 2015, 2017.
|
|
// Modifications copyright (c) 2014-2017 Oracle and/or its affiliates.
|
|
|
|
// Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
|
|
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
|
|
|
// 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_OVERLAY_INTERSECTION_INSERT_HPP
|
|
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_INTERSECTION_INSERT_HPP
|
|
|
|
|
|
#include <cstddef>
|
|
|
|
#include <boost/mpl/if.hpp>
|
|
#include <boost/mpl/assert.hpp>
|
|
#include <boost/range/metafunctions.hpp>
|
|
|
|
|
|
#include <boost/geometry/core/is_areal.hpp>
|
|
#include <boost/geometry/core/point_order.hpp>
|
|
#include <boost/geometry/core/reverse_dispatch.hpp>
|
|
#include <boost/geometry/geometries/concepts/check.hpp>
|
|
#include <boost/geometry/algorithms/convert.hpp>
|
|
#include <boost/geometry/algorithms/detail/point_on_border.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/clip_linestring.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/follow.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/get_intersection_points.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/overlay.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/overlay_type.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/range_in_geometry.hpp>
|
|
|
|
#include <boost/geometry/policies/robustness/robust_point_type.hpp>
|
|
#include <boost/geometry/policies/robustness/segment_ratio_type.hpp>
|
|
#include <boost/geometry/policies/robustness/get_rescale_policy.hpp>
|
|
|
|
#include <boost/geometry/views/segment_view.hpp>
|
|
#include <boost/geometry/views/detail/boundary_view.hpp>
|
|
|
|
#include <boost/geometry/algorithms/detail/check_iterator_range.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/linear_linear.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/pointlike_pointlike.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/pointlike_linear.hpp>
|
|
|
|
#if defined(BOOST_GEOMETRY_DEBUG_FOLLOW)
|
|
#include <boost/geometry/algorithms/detail/overlay/debug_turn_info.hpp>
|
|
#include <boost/geometry/io/wkt/wkt.hpp>
|
|
#endif
|
|
|
|
namespace boost { namespace geometry
|
|
{
|
|
|
|
#ifndef DOXYGEN_NO_DETAIL
|
|
namespace detail { namespace intersection
|
|
{
|
|
|
|
template <typename PointOut>
|
|
struct intersection_segment_segment_point
|
|
{
|
|
template
|
|
<
|
|
typename Segment1, typename Segment2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator, typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Segment1 const& segment1,
|
|
Segment2 const& segment2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
typedef typename point_type<PointOut>::type point_type;
|
|
|
|
typedef typename geometry::robust_point_type
|
|
<
|
|
typename geometry::point_type<Segment1>::type,
|
|
RobustPolicy
|
|
>::type robust_point_type;
|
|
|
|
// TODO: rescale segment -> robust points
|
|
robust_point_type pi_rob, pj_rob, qi_rob, qj_rob;
|
|
{
|
|
// Workaround:
|
|
point_type pi, pj, qi, qj;
|
|
assign_point_from_index<0>(segment1, pi);
|
|
assign_point_from_index<1>(segment1, pj);
|
|
assign_point_from_index<0>(segment2, qi);
|
|
assign_point_from_index<1>(segment2, qj);
|
|
geometry::recalculate(pi_rob, pi, robust_policy);
|
|
geometry::recalculate(pj_rob, pj, robust_policy);
|
|
geometry::recalculate(qi_rob, qi, robust_policy);
|
|
geometry::recalculate(qj_rob, qj, robust_policy);
|
|
}
|
|
|
|
// Get the intersection point (or two points)
|
|
typedef segment_intersection_points
|
|
<
|
|
point_type,
|
|
typename segment_ratio_type
|
|
<
|
|
point_type, RobustPolicy
|
|
>::type
|
|
> intersection_return_type;
|
|
|
|
typedef policies::relate::segments_intersection_points
|
|
<
|
|
intersection_return_type
|
|
> policy_type;
|
|
|
|
intersection_return_type
|
|
is = strategy.apply(segment1, segment2,
|
|
policy_type(), robust_policy,
|
|
pi_rob, pj_rob, qi_rob, qj_rob);
|
|
|
|
for (std::size_t i = 0; i < is.count; i++)
|
|
{
|
|
PointOut p;
|
|
geometry::convert(is.intersections[i], p);
|
|
*out++ = p;
|
|
}
|
|
return out;
|
|
}
|
|
};
|
|
|
|
template <typename PointOut>
|
|
struct intersection_linestring_linestring_point
|
|
{
|
|
template
|
|
<
|
|
typename Linestring1, typename Linestring2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Linestring1 const& linestring1,
|
|
Linestring2 const& linestring2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
typedef typename point_type<PointOut>::type point_type;
|
|
|
|
typedef detail::overlay::turn_info
|
|
<
|
|
point_type,
|
|
typename segment_ratio_type<point_type, RobustPolicy>::type
|
|
> turn_info;
|
|
std::deque<turn_info> turns;
|
|
|
|
geometry::get_intersection_points(linestring1, linestring2,
|
|
robust_policy, turns, strategy);
|
|
|
|
for (typename boost::range_iterator<std::deque<turn_info> const>::type
|
|
it = boost::begin(turns); it != boost::end(turns); ++it)
|
|
{
|
|
PointOut p;
|
|
geometry::convert(it->point, p);
|
|
*out++ = p;
|
|
}
|
|
return out;
|
|
}
|
|
};
|
|
|
|
/*!
|
|
\brief Version of linestring with an areal feature (polygon or multipolygon)
|
|
*/
|
|
template
|
|
<
|
|
bool ReverseAreal,
|
|
typename LineStringOut,
|
|
overlay_type OverlayType
|
|
>
|
|
struct intersection_of_linestring_with_areal
|
|
{
|
|
#if defined(BOOST_GEOMETRY_DEBUG_FOLLOW)
|
|
template <typename Turn, typename Operation>
|
|
static inline void debug_follow(Turn const& turn, Operation op,
|
|
int index)
|
|
{
|
|
std::cout << index
|
|
<< " at " << op.seg_id
|
|
<< " meth: " << method_char(turn.method)
|
|
<< " op: " << operation_char(op.operation)
|
|
<< " vis: " << visited_char(op.visited)
|
|
<< " of: " << operation_char(turn.operations[0].operation)
|
|
<< operation_char(turn.operations[1].operation)
|
|
<< " " << geometry::wkt(turn.point)
|
|
<< std::endl;
|
|
}
|
|
|
|
template <typename Turn>
|
|
static inline void debug_turn(Turn const& t, bool non_crossing)
|
|
{
|
|
std::cout << "checking turn @"
|
|
<< geometry::wkt(t.point)
|
|
<< "; " << method_char(t.method)
|
|
<< ":" << operation_char(t.operations[0].operation)
|
|
<< "/" << operation_char(t.operations[1].operation)
|
|
<< "; non-crossing? "
|
|
<< std::boolalpha << non_crossing << std::noboolalpha
|
|
<< std::endl;
|
|
}
|
|
#endif
|
|
|
|
#ifdef BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
class is_crossing_turn
|
|
{
|
|
// return true is the operation is intersection or blocked
|
|
template <std::size_t Index, typename Turn>
|
|
static inline bool has_op_i_or_b(Turn const& t)
|
|
{
|
|
return
|
|
t.operations[Index].operation == overlay::operation_intersection
|
|
||
|
|
t.operations[Index].operation == overlay::operation_blocked;
|
|
}
|
|
|
|
template <typename Turn>
|
|
static inline bool has_method_crosses(Turn const& t)
|
|
{
|
|
return t.method == overlay::method_crosses;
|
|
}
|
|
|
|
template <typename Turn>
|
|
static inline bool is_cc(Turn const& t)
|
|
{
|
|
return
|
|
(t.method == overlay::method_touch_interior
|
|
||
|
|
t.method == overlay::method_equal
|
|
||
|
|
t.method == overlay::method_collinear)
|
|
&&
|
|
t.operations[0].operation == t.operations[1].operation
|
|
&&
|
|
t.operations[0].operation == overlay::operation_continue
|
|
;
|
|
}
|
|
|
|
template <typename Turn>
|
|
static inline bool has_i_or_b_ops(Turn const& t)
|
|
{
|
|
return
|
|
(t.method == overlay::method_touch
|
|
||
|
|
t.method == overlay::method_touch_interior
|
|
||
|
|
t.method == overlay::method_collinear)
|
|
&&
|
|
t.operations[1].operation != t.operations[0].operation
|
|
&&
|
|
(has_op_i_or_b<0>(t) || has_op_i_or_b<1>(t));
|
|
}
|
|
|
|
public:
|
|
template <typename Turn>
|
|
static inline bool apply(Turn const& t)
|
|
{
|
|
bool const is_crossing
|
|
= has_method_crosses(t) || is_cc(t) || has_i_or_b_ops(t);
|
|
#if defined(BOOST_GEOMETRY_DEBUG_FOLLOW)
|
|
debug_turn(t, ! is_crossing);
|
|
#endif
|
|
return is_crossing;
|
|
}
|
|
};
|
|
|
|
struct is_non_crossing_turn
|
|
{
|
|
template <typename Turn>
|
|
static inline bool apply(Turn const& t)
|
|
{
|
|
return ! is_crossing_turn::apply(t);
|
|
}
|
|
};
|
|
|
|
template <typename Turns>
|
|
static inline bool no_crossing_turns_or_empty(Turns const& turns)
|
|
{
|
|
return detail::check_iterator_range
|
|
<
|
|
is_non_crossing_turn,
|
|
true // allow an empty turns range
|
|
>::apply(boost::begin(turns), boost::end(turns));
|
|
}
|
|
|
|
template <typename Turns>
|
|
static inline int inside_or_outside_turn(Turns const& turns)
|
|
{
|
|
using namespace overlay;
|
|
for (typename Turns::const_iterator it = turns.begin();
|
|
it != turns.end(); ++it)
|
|
{
|
|
operation_type op0 = it->operations[0].operation;
|
|
operation_type op1 = it->operations[1].operation;
|
|
if (op0 == operation_intersection && op1 == operation_intersection)
|
|
{
|
|
return 1; // inside
|
|
}
|
|
else if (op0 == operation_union && op1 == operation_union)
|
|
{
|
|
return -1; // outside
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
#else // BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
template <typename Linestring, typename Areal, typename Strategy, typename Turns>
|
|
static inline bool simple_turns_analysis(Linestring const& linestring,
|
|
Areal const& areal,
|
|
Strategy const& strategy,
|
|
Turns const& turns,
|
|
int & inside_value)
|
|
{
|
|
using namespace overlay;
|
|
|
|
bool found_continue = false;
|
|
bool found_intersection = false;
|
|
bool found_union = false;
|
|
bool found_front = false;
|
|
|
|
for (typename Turns::const_iterator it = turns.begin();
|
|
it != turns.end(); ++it)
|
|
{
|
|
method_type const method = it->method;
|
|
operation_type const op = it->operations[0].operation;
|
|
|
|
if (method == method_crosses)
|
|
{
|
|
return false;
|
|
}
|
|
else if (op == operation_intersection)
|
|
{
|
|
found_intersection = true;
|
|
}
|
|
else if (op == operation_union)
|
|
{
|
|
found_union = true;
|
|
}
|
|
else if (op == operation_continue)
|
|
{
|
|
found_continue = true;
|
|
}
|
|
|
|
if ((found_intersection || found_continue) && found_union)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
if (it->operations[0].position == position_front)
|
|
{
|
|
found_front = true;
|
|
}
|
|
}
|
|
|
|
if (found_front)
|
|
{
|
|
if (found_intersection)
|
|
{
|
|
inside_value = 1; // inside
|
|
}
|
|
else if (found_union)
|
|
{
|
|
inside_value = -1; // outside
|
|
}
|
|
else // continue and blocked
|
|
{
|
|
inside_value = 0;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
// if needed analyse points of a linestring
|
|
// NOTE: range_in_geometry checks points of a linestring
|
|
// until a point inside/outside areal is found
|
|
// TODO: Could be replaced with point_in_geometry() because found_front is false
|
|
inside_value = range_in_geometry(linestring, areal, strategy);
|
|
|
|
if ( (found_intersection && inside_value == -1) // going in from outside
|
|
|| (found_continue && inside_value == -1) // going on boundary from outside
|
|
|| (found_union && inside_value == 1) ) // going out from inside
|
|
{
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#endif // BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
template
|
|
<
|
|
typename LineString, typename Areal,
|
|
typename RobustPolicy,
|
|
typename OutputIterator, typename Strategy
|
|
>
|
|
static inline OutputIterator apply(LineString const& linestring, Areal const& areal,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
if (boost::size(linestring) == 0)
|
|
{
|
|
return out;
|
|
}
|
|
|
|
typedef detail::overlay::follow
|
|
<
|
|
LineStringOut,
|
|
LineString,
|
|
Areal,
|
|
OverlayType,
|
|
false // do not remove spikes for linear geometries
|
|
> follower;
|
|
|
|
typedef typename point_type<LineStringOut>::type point_type;
|
|
#ifdef BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
typedef detail::overlay::traversal_turn_info
|
|
<
|
|
point_type,
|
|
typename geometry::segment_ratio_type<point_type, RobustPolicy>::type
|
|
> turn_info;
|
|
#else
|
|
typedef detail::overlay::turn_info
|
|
<
|
|
point_type,
|
|
typename geometry::segment_ratio_type<point_type, RobustPolicy>::type,
|
|
detail::overlay::turn_operation_linear
|
|
<
|
|
point_type,
|
|
typename geometry::segment_ratio_type<point_type, RobustPolicy>::type
|
|
>
|
|
> turn_info;
|
|
#endif
|
|
std::deque<turn_info> turns;
|
|
|
|
detail::get_turns::no_interrupt_policy policy;
|
|
|
|
#ifdef BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
geometry::get_turns
|
|
<
|
|
false,
|
|
(OverlayType == overlay_intersection ? ReverseAreal : !ReverseAreal),
|
|
detail::overlay::assign_null_policy
|
|
>(linestring, areal, strategy, robust_policy, turns, policy);
|
|
|
|
if (no_crossing_turns_or_empty(turns))
|
|
{
|
|
// No intersection points, it is either
|
|
// inside (interior + borders)
|
|
// or outside (exterior + borders)
|
|
|
|
// analyse the turns
|
|
int inside_value = inside_or_outside_turn(turns);
|
|
if (inside_value == 0)
|
|
{
|
|
// if needed analyse points of a linestring
|
|
// NOTE: range_in_geometry checks points of a linestring
|
|
// until a point inside/outside areal is found
|
|
inside_value = overlay::range_in_geometry(linestring, areal, strategy);
|
|
}
|
|
// add linestring to the output if conditions are met
|
|
if (inside_value != 0 && follower::included(inside_value))
|
|
{
|
|
LineStringOut copy;
|
|
geometry::convert(linestring, copy);
|
|
*out++ = copy;
|
|
}
|
|
return out;
|
|
}
|
|
|
|
#else // BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
typedef detail::overlay::get_turn_info_linear_areal
|
|
<
|
|
detail::overlay::assign_null_policy
|
|
> turn_policy;
|
|
|
|
dispatch::get_turns
|
|
<
|
|
typename geometry::tag<LineString>::type,
|
|
typename geometry::tag<Areal>::type,
|
|
LineString,
|
|
Areal,
|
|
false,
|
|
(OverlayType == overlay_intersection ? ReverseAreal : !ReverseAreal),
|
|
turn_policy
|
|
>::apply(0, linestring, 1, areal,
|
|
strategy, robust_policy,
|
|
turns, policy);
|
|
|
|
int inside_value = 0;
|
|
if (simple_turns_analysis(linestring, areal, strategy, turns, inside_value))
|
|
{
|
|
// No crossing the boundary, it is either
|
|
// inside (interior + borders)
|
|
// or outside (exterior + borders)
|
|
// or on boundary
|
|
|
|
// add linestring to the output if conditions are met
|
|
if (follower::included(inside_value))
|
|
{
|
|
LineStringOut copy;
|
|
geometry::convert(linestring, copy);
|
|
*out++ = copy;
|
|
}
|
|
|
|
return out;
|
|
}
|
|
|
|
#endif // BOOST_GEOMETRY_SETOPS_LA_OLD_BEHAVIOR
|
|
|
|
#if defined(BOOST_GEOMETRY_DEBUG_FOLLOW)
|
|
int index = 0;
|
|
for(typename std::deque<turn_info>::const_iterator
|
|
it = turns.begin(); it != turns.end(); ++it)
|
|
{
|
|
debug_follow(*it, it->operations[0], index++);
|
|
}
|
|
#endif
|
|
|
|
return follower::apply
|
|
(
|
|
linestring, areal,
|
|
geometry::detail::overlay::operation_intersection,
|
|
turns, robust_policy, out, strategy
|
|
);
|
|
}
|
|
};
|
|
|
|
|
|
template <typename Turns, typename OutputIterator>
|
|
inline OutputIterator intersection_output_turn_points(Turns const& turns,
|
|
OutputIterator out)
|
|
{
|
|
for (typename Turns::const_iterator
|
|
it = turns.begin(); it != turns.end(); ++it)
|
|
{
|
|
*out++ = it->point;
|
|
}
|
|
|
|
return out;
|
|
}
|
|
|
|
template <typename PointOut>
|
|
struct intersection_areal_areal_point
|
|
{
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
typedef detail::overlay::turn_info
|
|
<
|
|
PointOut,
|
|
typename segment_ratio_type<PointOut, RobustPolicy>::type
|
|
> turn_info;
|
|
std::vector<turn_info> turns;
|
|
|
|
detail::get_turns::no_interrupt_policy policy;
|
|
|
|
geometry::get_turns
|
|
<
|
|
false, false, detail::overlay::assign_null_policy
|
|
>(geometry1, geometry2, strategy, robust_policy, turns, policy);
|
|
|
|
return intersection_output_turn_points(turns, out);
|
|
}
|
|
};
|
|
|
|
template <typename PointOut>
|
|
struct intersection_linear_areal_point
|
|
{
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
typedef typename geometry::segment_ratio_type
|
|
<
|
|
PointOut, RobustPolicy
|
|
>::type segment_ratio_type;
|
|
|
|
typedef detail::overlay::turn_info
|
|
<
|
|
PointOut,
|
|
segment_ratio_type,
|
|
detail::overlay::turn_operation_linear
|
|
<
|
|
PointOut,
|
|
segment_ratio_type
|
|
>
|
|
> turn_info;
|
|
|
|
typedef detail::overlay::get_turn_info_linear_areal
|
|
<
|
|
detail::overlay::assign_null_policy
|
|
> turn_policy;
|
|
|
|
std::vector<turn_info> turns;
|
|
|
|
detail::get_turns::no_interrupt_policy interrupt_policy;
|
|
|
|
dispatch::get_turns
|
|
<
|
|
typename geometry::tag<Geometry1>::type,
|
|
typename geometry::tag<Geometry2>::type,
|
|
Geometry1,
|
|
Geometry2,
|
|
false,
|
|
false,
|
|
turn_policy
|
|
>::apply(0, geometry1, 1, geometry2,
|
|
strategy, robust_policy,
|
|
turns, interrupt_policy);
|
|
|
|
return intersection_output_turn_points(turns, out);
|
|
}
|
|
};
|
|
|
|
template <typename PointOut>
|
|
struct intersection_areal_linear_point
|
|
{
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
return intersection_linear_areal_point
|
|
<
|
|
PointOut
|
|
>::apply(geometry2, geometry1, robust_policy, out, strategy);
|
|
}
|
|
};
|
|
|
|
|
|
}} // namespace detail::intersection
|
|
#endif // DOXYGEN_NO_DETAIL
|
|
|
|
|
|
|
|
#ifndef DOXYGEN_NO_DISPATCH
|
|
namespace dispatch
|
|
{
|
|
|
|
template
|
|
<
|
|
// real types
|
|
typename Geometry1,
|
|
typename Geometry2,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
// orientation
|
|
bool Reverse1 = detail::overlay::do_reverse<geometry::point_order<Geometry1>::value>::value,
|
|
bool Reverse2 = detail::overlay::do_reverse<geometry::point_order<Geometry2>::value>::value,
|
|
bool ReverseOut = detail::overlay::do_reverse<geometry::point_order<GeometryOut>::value>::value,
|
|
// tag dispatching:
|
|
typename TagIn1 = typename geometry::tag<Geometry1>::type,
|
|
typename TagIn2 = typename geometry::tag<Geometry2>::type,
|
|
typename TagOut = typename geometry::tag<GeometryOut>::type,
|
|
// metafunction finetuning helpers:
|
|
typename CastedTagIn1 = typename geometry::tag_cast<TagIn1, areal_tag, linear_tag, pointlike_tag>::type,
|
|
typename CastedTagIn2 = typename geometry::tag_cast<TagIn2, areal_tag, linear_tag, pointlike_tag>::type,
|
|
typename CastedTagOut = typename geometry::tag_cast<TagOut, areal_tag, linear_tag, pointlike_tag>::type
|
|
>
|
|
struct intersection_insert
|
|
{
|
|
BOOST_MPL_ASSERT_MSG
|
|
(
|
|
false, NOT_OR_NOT_YET_IMPLEMENTED_FOR_THIS_GEOMETRY_TYPES_OR_ORIENTATIONS
|
|
, (types<Geometry1, Geometry2, GeometryOut>)
|
|
);
|
|
};
|
|
|
|
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename TagIn1, typename TagIn2, typename TagOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
GeometryOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
TagIn1, TagIn2, TagOut,
|
|
areal_tag, areal_tag, areal_tag
|
|
> : detail::overlay::overlay
|
|
<Geometry1, Geometry2, Reverse1, Reverse2, ReverseOut, GeometryOut, OverlayType>
|
|
{};
|
|
|
|
|
|
// Any areal type with box:
|
|
template
|
|
<
|
|
typename Geometry, typename Box,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename TagIn, typename TagOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry, Box,
|
|
GeometryOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
TagIn, box_tag, TagOut,
|
|
areal_tag, areal_tag, areal_tag
|
|
> : detail::overlay::overlay
|
|
<Geometry, Box, Reverse1, Reverse2, ReverseOut, GeometryOut, OverlayType>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Segment1, typename Segment2,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Segment1, Segment2,
|
|
GeometryOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
segment_tag, segment_tag, point_tag,
|
|
linear_tag, linear_tag, pointlike_tag
|
|
> : detail::intersection::intersection_segment_segment_point<GeometryOut>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Linestring1, typename Linestring2,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linestring1, Linestring2,
|
|
GeometryOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
linestring_tag, linestring_tag, point_tag,
|
|
linear_tag, linear_tag, pointlike_tag
|
|
> : detail::intersection::intersection_linestring_linestring_point<GeometryOut>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Linestring, typename Box,
|
|
typename GeometryOut,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linestring, Box,
|
|
GeometryOut,
|
|
overlay_intersection,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
linestring_tag, box_tag, linestring_tag,
|
|
linear_tag, areal_tag, linear_tag
|
|
>
|
|
{
|
|
template <typename RobustPolicy, typename OutputIterator, typename Strategy>
|
|
static inline OutputIterator apply(Linestring const& linestring,
|
|
Box const& box,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out, Strategy const& )
|
|
{
|
|
typedef typename point_type<GeometryOut>::type point_type;
|
|
strategy::intersection::liang_barsky<Box, point_type> lb_strategy;
|
|
return detail::intersection::clip_range_with_box
|
|
<GeometryOut>(box, linestring, robust_policy, out, lb_strategy);
|
|
}
|
|
};
|
|
|
|
|
|
template
|
|
<
|
|
typename Linestring, typename Polygon,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool ReverseLinestring, bool ReversePolygon, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linestring, Polygon,
|
|
GeometryOut,
|
|
OverlayType,
|
|
ReverseLinestring, ReversePolygon, ReverseOut,
|
|
linestring_tag, polygon_tag, linestring_tag,
|
|
linear_tag, areal_tag, linear_tag
|
|
> : detail::intersection::intersection_of_linestring_with_areal
|
|
<
|
|
ReversePolygon,
|
|
GeometryOut,
|
|
OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Linestring, typename Ring,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool ReverseLinestring, bool ReverseRing, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linestring, Ring,
|
|
GeometryOut,
|
|
OverlayType,
|
|
ReverseLinestring, ReverseRing, ReverseOut,
|
|
linestring_tag, ring_tag, linestring_tag,
|
|
linear_tag, areal_tag, linear_tag
|
|
> : detail::intersection::intersection_of_linestring_with_areal
|
|
<
|
|
ReverseRing,
|
|
GeometryOut,
|
|
OverlayType
|
|
>
|
|
{};
|
|
|
|
template
|
|
<
|
|
typename Segment, typename Box,
|
|
typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Segment, Box,
|
|
GeometryOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
segment_tag, box_tag, linestring_tag,
|
|
linear_tag, areal_tag, linear_tag
|
|
>
|
|
{
|
|
template <typename RobustPolicy, typename OutputIterator, typename Strategy>
|
|
static inline OutputIterator apply(Segment const& segment,
|
|
Box const& box,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out, Strategy const& )
|
|
{
|
|
geometry::segment_view<Segment> range(segment);
|
|
|
|
typedef typename point_type<GeometryOut>::type point_type;
|
|
strategy::intersection::liang_barsky<Box, point_type> lb_strategy;
|
|
return detail::intersection::clip_range_with_box
|
|
<GeometryOut>(box, range, robust_policy, out, lb_strategy);
|
|
}
|
|
};
|
|
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag1, typename Tag2
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
PointOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
Tag1, Tag2, point_tag,
|
|
areal_tag, areal_tag, pointlike_tag
|
|
>
|
|
: public detail::intersection::intersection_areal_areal_point
|
|
<
|
|
PointOut
|
|
>
|
|
{};
|
|
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag1, typename Tag2
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
PointOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
Tag1, Tag2, point_tag,
|
|
linear_tag, areal_tag, pointlike_tag
|
|
>
|
|
: public detail::intersection::intersection_linear_areal_point
|
|
<
|
|
PointOut
|
|
>
|
|
{};
|
|
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag1, typename Tag2
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
PointOut,
|
|
OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
Tag1, Tag2, point_tag,
|
|
areal_tag, linear_tag, pointlike_tag
|
|
>
|
|
: public detail::intersection::intersection_areal_linear_point
|
|
<
|
|
PointOut
|
|
>
|
|
{};
|
|
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2, typename GeometryOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert_reversed
|
|
{
|
|
template <typename RobustPolicy, typename OutputIterator, typename Strategy>
|
|
static inline OutputIterator apply(Geometry1 const& g1,
|
|
Geometry2 const& g2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
return intersection_insert
|
|
<
|
|
Geometry2, Geometry1, GeometryOut,
|
|
OverlayType,
|
|
Reverse2, Reverse1, ReverseOut
|
|
>::apply(g2, g1, robust_policy, out, strategy);
|
|
}
|
|
};
|
|
|
|
|
|
// dispatch for intersection(areal, areal, linear)
|
|
template
|
|
<
|
|
typename Geometry1, typename Geometry2,
|
|
typename LinestringOut,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag1, typename Tag2
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
LinestringOut,
|
|
overlay_intersection,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
Tag1, Tag2, linestring_tag,
|
|
areal_tag, areal_tag, linear_tag
|
|
>
|
|
{
|
|
template
|
|
<
|
|
typename RobustPolicy, typename OutputIterator, typename Strategy
|
|
>
|
|
static inline OutputIterator apply(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator oit,
|
|
Strategy const& strategy)
|
|
{
|
|
detail::boundary_view<Geometry1 const> view1(geometry1);
|
|
detail::boundary_view<Geometry2 const> view2(geometry2);
|
|
|
|
return detail::overlay::linear_linear_linestring
|
|
<
|
|
detail::boundary_view<Geometry1 const>,
|
|
detail::boundary_view<Geometry2 const>,
|
|
LinestringOut,
|
|
overlay_intersection
|
|
>::apply(view1, view2, robust_policy, oit, strategy);
|
|
}
|
|
};
|
|
|
|
// dispatch for difference/intersection of linear geometries
|
|
template
|
|
<
|
|
typename Linear1, typename Linear2, typename LineStringOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename TagIn1, typename TagIn2
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linear1, Linear2, LineStringOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
TagIn1, TagIn2, linestring_tag,
|
|
linear_tag, linear_tag, linear_tag
|
|
> : detail::overlay::linear_linear_linestring
|
|
<
|
|
Linear1, Linear2, LineStringOut, OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
// dispatch for difference/intersection of point-like geometries
|
|
|
|
template
|
|
<
|
|
typename Point1, typename Point2, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Point1, Point2, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
point_tag, point_tag, point_tag,
|
|
pointlike_tag, pointlike_tag, pointlike_tag
|
|
> : detail::overlay::point_point_point
|
|
<
|
|
Point1, Point2, PointOut, OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename MultiPoint, typename Point, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
MultiPoint, Point, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
multi_point_tag, point_tag, point_tag,
|
|
pointlike_tag, pointlike_tag, pointlike_tag
|
|
> : detail::overlay::multipoint_point_point
|
|
<
|
|
MultiPoint, Point, PointOut, OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Point, typename MultiPoint, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Point, MultiPoint, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
point_tag, multi_point_tag, point_tag,
|
|
pointlike_tag, pointlike_tag, pointlike_tag
|
|
> : detail::overlay::point_multipoint_point
|
|
<
|
|
Point, MultiPoint, PointOut, OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename MultiPoint1, typename MultiPoint2, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
MultiPoint1, MultiPoint2, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
multi_point_tag, multi_point_tag, point_tag,
|
|
pointlike_tag, pointlike_tag, pointlike_tag
|
|
> : detail::overlay::multipoint_multipoint_point
|
|
<
|
|
MultiPoint1, MultiPoint2, PointOut, OverlayType
|
|
>
|
|
{};
|
|
|
|
|
|
// dispatch for difference/intersection of pointlike-linear geometries
|
|
template
|
|
<
|
|
typename Point, typename Linear, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Point, Linear, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
point_tag, Tag, point_tag,
|
|
pointlike_tag, linear_tag, pointlike_tag
|
|
> : detail_dispatch::overlay::pointlike_linear_point
|
|
<
|
|
Point, Linear, PointOut, OverlayType,
|
|
point_tag, typename tag_cast<Tag, segment_tag, linear_tag>::type
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename MultiPoint, typename Linear, typename PointOut,
|
|
overlay_type OverlayType,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut,
|
|
typename Tag
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
MultiPoint, Linear, PointOut, OverlayType,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
multi_point_tag, Tag, point_tag,
|
|
pointlike_tag, linear_tag, pointlike_tag
|
|
> : detail_dispatch::overlay::pointlike_linear_point
|
|
<
|
|
MultiPoint, Linear, PointOut, OverlayType,
|
|
multi_point_tag,
|
|
typename tag_cast<Tag, segment_tag, linear_tag>::type
|
|
>
|
|
{};
|
|
|
|
|
|
template
|
|
<
|
|
typename Linestring, typename MultiPoint, typename PointOut,
|
|
bool Reverse1, bool Reverse2, bool ReverseOut
|
|
>
|
|
struct intersection_insert
|
|
<
|
|
Linestring, MultiPoint, PointOut, overlay_intersection,
|
|
Reverse1, Reverse2, ReverseOut,
|
|
linestring_tag, multi_point_tag, point_tag,
|
|
linear_tag, pointlike_tag, pointlike_tag
|
|
>
|
|
{
|
|
template <typename RobustPolicy, typename OutputIterator, typename Strategy>
|
|
static inline OutputIterator apply(Linestring const& linestring,
|
|
MultiPoint const& multipoint,
|
|
RobustPolicy const& robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
return detail_dispatch::overlay::pointlike_linear_point
|
|
<
|
|
MultiPoint, Linestring, PointOut, overlay_intersection,
|
|
multi_point_tag, linear_tag
|
|
>::apply(multipoint, linestring, robust_policy, out, strategy);
|
|
}
|
|
};
|
|
|
|
|
|
} // namespace dispatch
|
|
#endif // DOXYGEN_NO_DISPATCH
|
|
|
|
|
|
#ifndef DOXYGEN_NO_DETAIL
|
|
namespace detail { namespace intersection
|
|
{
|
|
|
|
|
|
template
|
|
<
|
|
typename GeometryOut,
|
|
bool ReverseSecond,
|
|
overlay_type OverlayType,
|
|
typename Geometry1, typename Geometry2,
|
|
typename RobustPolicy,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
inline OutputIterator insert(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
RobustPolicy robust_policy,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
return boost::mpl::if_c
|
|
<
|
|
geometry::reverse_dispatch<Geometry1, Geometry2>::type::value,
|
|
geometry::dispatch::intersection_insert_reversed
|
|
<
|
|
Geometry1, Geometry2,
|
|
GeometryOut,
|
|
OverlayType,
|
|
overlay::do_reverse<geometry::point_order<Geometry1>::value>::value,
|
|
overlay::do_reverse<geometry::point_order<Geometry2>::value, ReverseSecond>::value,
|
|
overlay::do_reverse<geometry::point_order<GeometryOut>::value>::value
|
|
>,
|
|
geometry::dispatch::intersection_insert
|
|
<
|
|
Geometry1, Geometry2,
|
|
GeometryOut,
|
|
OverlayType,
|
|
geometry::detail::overlay::do_reverse<geometry::point_order<Geometry1>::value>::value,
|
|
geometry::detail::overlay::do_reverse<geometry::point_order<Geometry2>::value, ReverseSecond>::value
|
|
>
|
|
>::type::apply(geometry1, geometry2, robust_policy, out, strategy);
|
|
}
|
|
|
|
|
|
/*!
|
|
\brief \brief_calc2{intersection} \brief_strategy
|
|
\ingroup intersection
|
|
\details \details_calc2{intersection_insert, spatial set theoretic intersection}
|
|
\brief_strategy. \details_insert{intersection}
|
|
\tparam GeometryOut \tparam_geometry{\p_l_or_c}
|
|
\tparam Geometry1 \tparam_geometry
|
|
\tparam Geometry2 \tparam_geometry
|
|
\tparam OutputIterator \tparam_out{\p_l_or_c}
|
|
\tparam Strategy \tparam_strategy_overlay
|
|
\param geometry1 \param_geometry
|
|
\param geometry2 \param_geometry
|
|
\param out \param_out{intersection}
|
|
\param strategy \param_strategy{intersection}
|
|
\return \return_out
|
|
|
|
\qbk{distinguish,with strategy}
|
|
\qbk{[include reference/algorithms/intersection.qbk]}
|
|
*/
|
|
template
|
|
<
|
|
typename GeometryOut,
|
|
typename Geometry1,
|
|
typename Geometry2,
|
|
typename OutputIterator,
|
|
typename Strategy
|
|
>
|
|
inline OutputIterator intersection_insert(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
OutputIterator out,
|
|
Strategy const& strategy)
|
|
{
|
|
concepts::check<Geometry1 const>();
|
|
concepts::check<Geometry2 const>();
|
|
|
|
typedef typename geometry::rescale_policy_type
|
|
<
|
|
typename geometry::point_type<Geometry1>::type // TODO from both
|
|
>::type rescale_policy_type;
|
|
|
|
rescale_policy_type robust_policy
|
|
= geometry::get_rescale_policy<rescale_policy_type>(geometry1, geometry2);
|
|
|
|
return detail::intersection::insert
|
|
<
|
|
GeometryOut, false, overlay_intersection
|
|
>(geometry1, geometry2, robust_policy, out, strategy);
|
|
}
|
|
|
|
|
|
/*!
|
|
\brief \brief_calc2{intersection}
|
|
\ingroup intersection
|
|
\details \details_calc2{intersection_insert, spatial set theoretic intersection}.
|
|
\details_insert{intersection}
|
|
\tparam GeometryOut \tparam_geometry{\p_l_or_c}
|
|
\tparam Geometry1 \tparam_geometry
|
|
\tparam Geometry2 \tparam_geometry
|
|
\tparam OutputIterator \tparam_out{\p_l_or_c}
|
|
\param geometry1 \param_geometry
|
|
\param geometry2 \param_geometry
|
|
\param out \param_out{intersection}
|
|
\return \return_out
|
|
|
|
\qbk{[include reference/algorithms/intersection.qbk]}
|
|
*/
|
|
template
|
|
<
|
|
typename GeometryOut,
|
|
typename Geometry1,
|
|
typename Geometry2,
|
|
typename OutputIterator
|
|
>
|
|
inline OutputIterator intersection_insert(Geometry1 const& geometry1,
|
|
Geometry2 const& geometry2,
|
|
OutputIterator out)
|
|
{
|
|
concepts::check<Geometry1 const>();
|
|
concepts::check<Geometry2 const>();
|
|
|
|
typedef typename strategy::intersection::services::default_strategy
|
|
<
|
|
typename cs_tag<GeometryOut>::type
|
|
>::type strategy_type;
|
|
|
|
return intersection_insert<GeometryOut>(geometry1, geometry2, out,
|
|
strategy_type());
|
|
}
|
|
|
|
}} // namespace detail::intersection
|
|
#endif // DOXYGEN_NO_DETAIL
|
|
|
|
|
|
|
|
}} // namespace boost::geometry
|
|
|
|
|
|
#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_INTERSECTION_INSERT_HPP
|