911 lines
31 KiB
C++
911 lines
31 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library)
|
|
|
|
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
|
|
|
|
// This file was modified by Oracle on 2017.
|
|
// Modifications copyright (c) 2017 Oracle and/or its affiliates.
|
|
|
|
// 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_TRAVERSAL_HPP
|
|
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_TRAVERSAL_HPP
|
|
|
|
#include <cstddef>
|
|
|
|
#include <boost/range.hpp>
|
|
|
|
#include <boost/geometry/algorithms/detail/overlay/aggregate_operations.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/is_self_turn.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/sort_by_side.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/traversal_intersection_patterns.hpp>
|
|
#include <boost/geometry/algorithms/detail/overlay/turn_info.hpp>
|
|
#include <boost/geometry/core/access.hpp>
|
|
#include <boost/geometry/core/assert.hpp>
|
|
|
|
#if defined(BOOST_GEOMETRY_DEBUG_INTERSECTION) \
|
|
|| defined(BOOST_GEOMETRY_OVERLAY_REPORT_WKT) \
|
|
|| defined(BOOST_GEOMETRY_DEBUG_TRAVERSE)
|
|
# include <string>
|
|
# 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 overlay
|
|
{
|
|
|
|
template <typename Turn, typename Operation>
|
|
#ifdef BOOST_GEOMETRY_DEBUG_TRAVERSE
|
|
inline void debug_traverse(Turn const& turn, Operation op,
|
|
std::string const& header, bool condition = true)
|
|
{
|
|
if (! condition)
|
|
{
|
|
return;
|
|
}
|
|
std::cout << " " << header
|
|
<< " 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;
|
|
|
|
if (boost::contains(header, "Finished"))
|
|
{
|
|
std::cout << std::endl;
|
|
}
|
|
}
|
|
#else
|
|
inline void debug_traverse(Turn const& , Operation, const char*, bool = true)
|
|
{
|
|
}
|
|
#endif
|
|
|
|
|
|
//! Metafunction to define side_order (clockwise, ccw) by operation_type
|
|
template <operation_type OpType>
|
|
struct side_compare {};
|
|
|
|
template <>
|
|
struct side_compare<operation_union>
|
|
{
|
|
typedef std::greater<int> type;
|
|
};
|
|
|
|
template <>
|
|
struct side_compare<operation_intersection>
|
|
{
|
|
typedef std::less<int> type;
|
|
};
|
|
|
|
|
|
template
|
|
<
|
|
bool Reverse1,
|
|
bool Reverse2,
|
|
overlay_type OverlayType,
|
|
typename Geometry1,
|
|
typename Geometry2,
|
|
typename Turns,
|
|
typename Clusters,
|
|
typename RobustPolicy,
|
|
typename SideStrategy,
|
|
typename Visitor
|
|
>
|
|
struct traversal
|
|
{
|
|
static const operation_type target_operation = operation_from_overlay<OverlayType>::value;
|
|
|
|
typedef typename side_compare<target_operation>::type side_compare_type;
|
|
typedef typename boost::range_value<Turns>::type turn_type;
|
|
typedef typename turn_type::turn_operation_type turn_operation_type;
|
|
|
|
typedef typename geometry::point_type<Geometry1>::type point_type;
|
|
typedef sort_by_side::side_sorter
|
|
<
|
|
Reverse1, Reverse2, OverlayType,
|
|
point_type, SideStrategy, side_compare_type
|
|
> sbs_type;
|
|
|
|
inline traversal(Geometry1 const& geometry1, Geometry2 const& geometry2,
|
|
Turns& turns, Clusters const& clusters,
|
|
RobustPolicy const& robust_policy, SideStrategy const& strategy,
|
|
Visitor& visitor)
|
|
: m_geometry1(geometry1)
|
|
, m_geometry2(geometry2)
|
|
, m_turns(turns)
|
|
, m_clusters(clusters)
|
|
, m_robust_policy(robust_policy)
|
|
, m_strategy(strategy)
|
|
, m_visitor(visitor)
|
|
{
|
|
}
|
|
|
|
template <typename TurnInfoMap>
|
|
inline void finalize_visit_info(TurnInfoMap& turn_info_map)
|
|
{
|
|
for (typename boost::range_iterator<Turns>::type
|
|
it = boost::begin(m_turns);
|
|
it != boost::end(m_turns);
|
|
++it)
|
|
{
|
|
turn_type& turn = *it;
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
turn_operation_type& op = turn.operations[i];
|
|
if (op.visited.visited()
|
|
|| op.visited.started()
|
|
|| op.visited.finished() )
|
|
{
|
|
ring_identifier const ring_id
|
|
(
|
|
op.seg_id.source_index,
|
|
op.seg_id.multi_index,
|
|
op.seg_id.ring_index
|
|
);
|
|
turn_info_map[ring_id].has_traversed_turn = true;
|
|
|
|
if (op.operation == operation_continue)
|
|
{
|
|
// Continue operations should mark the other operation
|
|
// as traversed too
|
|
turn_operation_type& other_op = turn.operations[1 - i];
|
|
ring_identifier const other_ring_id
|
|
(
|
|
other_op.seg_id.source_index,
|
|
other_op.seg_id.multi_index,
|
|
other_op.seg_id.ring_index
|
|
);
|
|
turn_info_map[other_ring_id].has_traversed_turn = true;
|
|
}
|
|
}
|
|
op.visited.finalize();
|
|
}
|
|
}
|
|
}
|
|
|
|
//! Sets visited for ALL turns traveling to the same turn
|
|
inline void set_visited_in_cluster(signed_size_type cluster_id,
|
|
signed_size_type rank)
|
|
{
|
|
typename Clusters::const_iterator mit = m_clusters.find(cluster_id);
|
|
BOOST_ASSERT(mit != m_clusters.end());
|
|
|
|
cluster_info const& cinfo = mit->second;
|
|
std::set<signed_size_type> const& ids = cinfo.turn_indices;
|
|
|
|
for (typename std::set<signed_size_type>::const_iterator it = ids.begin();
|
|
it != ids.end(); ++it)
|
|
{
|
|
signed_size_type const turn_index = *it;
|
|
turn_type& turn = m_turns[turn_index];
|
|
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
turn_operation_type& op = turn.operations[i];
|
|
if (op.visited.none()
|
|
&& op.enriched.rank == rank)
|
|
{
|
|
op.visited.set_visited();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
inline void set_visited(turn_type& turn, turn_operation_type& op)
|
|
{
|
|
if (op.operation == detail::overlay::operation_continue)
|
|
{
|
|
// On "continue", all go in same direction so set "visited" for ALL
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
turn_operation_type& turn_op = turn.operations[i];
|
|
if (turn_op.visited.none())
|
|
{
|
|
turn_op.visited.set_visited();
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
op.visited.set_visited();
|
|
}
|
|
if (turn.is_clustered())
|
|
{
|
|
set_visited_in_cluster(turn.cluster_id, op.enriched.rank);
|
|
}
|
|
}
|
|
|
|
inline bool is_visited(turn_type const& , turn_operation_type const& op,
|
|
signed_size_type , int) const
|
|
{
|
|
return op.visited.visited();
|
|
}
|
|
|
|
template <signed_size_type segment_identifier::*Member>
|
|
inline bool select_source_generic(bool switch_source,
|
|
segment_identifier const& current,
|
|
segment_identifier const& previous) const
|
|
{
|
|
return switch_source
|
|
? current.*Member != previous.*Member
|
|
: current.*Member == previous.*Member;
|
|
}
|
|
|
|
inline bool select_source(signed_size_type turn_index,
|
|
segment_identifier const& candidate_seg_id,
|
|
segment_identifier const& previous_seg_id) const
|
|
{
|
|
// For uu/ii, only switch sources if indicated
|
|
turn_type const& turn = m_turns[turn_index];
|
|
|
|
#if defined(BOOST_GEOMETRY_DEBUG_TRAVERSAL_SWITCH_DETECTOR)
|
|
if (turn.switch_source)
|
|
{
|
|
std::cout << "Switch source at " << turn_index << std::endl;
|
|
}
|
|
else
|
|
{
|
|
std::cout << "DON'T SWITCH SOURCES at " << turn_index << std::endl;
|
|
}
|
|
#endif
|
|
if (OverlayType == overlay_buffer
|
|
|| OverlayType == overlay_dissolve_union)
|
|
{
|
|
// Buffer does not use source_index (always 0).
|
|
return select_source_generic<&segment_identifier::multi_index>(
|
|
turn.switch_source, candidate_seg_id, previous_seg_id);
|
|
}
|
|
|
|
if (is_self_turn<OverlayType>(turn))
|
|
{
|
|
// Also, if it is a self-turn, stay on same ring (multi/ring)
|
|
return select_source_generic<&segment_identifier::multi_index>(
|
|
turn.switch_source, candidate_seg_id, previous_seg_id);
|
|
}
|
|
|
|
// Use source_index
|
|
return select_source_generic<&segment_identifier::source_index>(
|
|
turn.switch_source, candidate_seg_id, previous_seg_id);
|
|
}
|
|
|
|
inline bool traverse_possible(signed_size_type turn_index) const
|
|
{
|
|
if (turn_index == -1)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
turn_type const& turn = m_turns[turn_index];
|
|
|
|
// It is not a dead end if there is an operation to continue, or of
|
|
// there is a cluster (assuming for now we can get out of the cluster)
|
|
return turn.is_clustered()
|
|
|| turn.has(target_operation)
|
|
|| turn.has(operation_continue);
|
|
}
|
|
|
|
inline
|
|
bool select_cc_operation(turn_type const& turn,
|
|
signed_size_type start_turn_index,
|
|
int& selected_op_index) const
|
|
{
|
|
// For "cc", take either one, but if there is a starting one,
|
|
// take that one. If next is dead end, skip that one.
|
|
// If both are valid candidates, take the one with minimal remaining
|
|
// distance (important for #mysql_23023665 in buffer).
|
|
|
|
// Initialize with 0, automatically assigned on first result
|
|
typename turn_operation_type::comparable_distance_type
|
|
min_remaining_distance = 0;
|
|
|
|
bool result = false;
|
|
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
turn_operation_type const& op = turn.operations[i];
|
|
|
|
signed_size_type const next_turn_index = op.enriched.get_next_turn_index();
|
|
|
|
if (! traverse_possible(next_turn_index))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
if (! result
|
|
|| next_turn_index == start_turn_index
|
|
|| op.remaining_distance < min_remaining_distance)
|
|
{
|
|
debug_traverse(turn, op, "First candidate cc", ! result);
|
|
debug_traverse(turn, op, "Candidate cc override (start)",
|
|
result && next_turn_index == start_turn_index);
|
|
debug_traverse(turn, op, "Candidate cc override (remaining)",
|
|
result && op.remaining_distance < min_remaining_distance);
|
|
|
|
selected_op_index = i;
|
|
min_remaining_distance = op.remaining_distance;
|
|
result = true;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
inline
|
|
bool select_noncc_operation(turn_type const& turn,
|
|
signed_size_type turn_index,
|
|
segment_identifier const& previous_seg_id,
|
|
int& selected_op_index) const
|
|
{
|
|
bool result = false;
|
|
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
turn_operation_type const& op = turn.operations[i];
|
|
|
|
if (op.operation == target_operation
|
|
&& ! op.visited.finished()
|
|
&& ! op.visited.visited()
|
|
&& (! result || select_source(turn_index, op.seg_id, previous_seg_id)))
|
|
{
|
|
selected_op_index = i;
|
|
debug_traverse(turn, op, "Candidate");
|
|
result = true;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
inline
|
|
bool select_operation(const turn_type& turn,
|
|
signed_size_type turn_index,
|
|
signed_size_type start_turn_index,
|
|
segment_identifier const& previous_seg_id,
|
|
int& selected_op_index) const
|
|
{
|
|
bool result = false;
|
|
selected_op_index = -1;
|
|
if (turn.both(operation_continue))
|
|
{
|
|
result = select_cc_operation(turn, start_turn_index,
|
|
selected_op_index);
|
|
}
|
|
else
|
|
{
|
|
result = select_noncc_operation(turn, turn_index,
|
|
previous_seg_id, selected_op_index);
|
|
}
|
|
if (result)
|
|
{
|
|
debug_traverse(turn, turn.operations[selected_op_index], "Accepted");
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
inline int starting_operation_index(const turn_type& turn) const
|
|
{
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
if (turn.operations[i].visited.started())
|
|
{
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
inline bool both_finished(const turn_type& turn) const
|
|
{
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
if (! turn.operations[i].visited.finished())
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
inline int select_turn_in_cluster_union(std::size_t selected_rank,
|
|
typename sbs_type::rp const& ranked_point,
|
|
signed_size_type start_turn_index, int start_op_index) const
|
|
{
|
|
// Returns 0 if it not OK
|
|
// Returns 1 if it OK
|
|
// Returns 2 if it OK and start turn matches
|
|
// Returns 3 if it OK and start turn and start op both match
|
|
if (ranked_point.rank != selected_rank
|
|
|| ranked_point.direction != sort_by_side::dir_to)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
turn_type const& turn = m_turns[ranked_point.turn_index];
|
|
turn_operation_type const& op = turn.operations[ranked_point.operation_index];
|
|
|
|
// Check finalized: TODO: this should be finetuned, it is not necessary
|
|
if (op.visited.finalized())
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (OverlayType != overlay_dissolve_union
|
|
&& (op.enriched.count_left != 0 || op.enriched.count_right == 0))
|
|
{
|
|
// Check counts: in some cases interior rings might be generated with
|
|
// polygons on both sides. For dissolve it can be anything.
|
|
return 0;
|
|
}
|
|
|
|
return ranked_point.turn_index == start_turn_index
|
|
&& ranked_point.operation_index == start_op_index ? 3
|
|
: ranked_point.turn_index == start_turn_index ? 2
|
|
: 1
|
|
;
|
|
}
|
|
|
|
inline bool select_from_cluster_union(signed_size_type& turn_index,
|
|
int& op_index, sbs_type& sbs,
|
|
signed_size_type start_turn_index, int start_op_index) const
|
|
{
|
|
std::vector<sort_by_side::rank_with_rings> aggregation;
|
|
sort_by_side::aggregate_operations(sbs, aggregation, m_turns, operation_union);
|
|
|
|
sort_by_side::rank_with_rings const& incoming = aggregation.front();
|
|
|
|
// Take the first one outgoing for the incoming region
|
|
std::size_t selected_rank = 0;
|
|
for (std::size_t i = 1; i < aggregation.size(); i++)
|
|
{
|
|
sort_by_side::rank_with_rings const& rwr = aggregation[i];
|
|
if (rwr.all_to()
|
|
&& rwr.region_id() == incoming.region_id())
|
|
{
|
|
selected_rank = rwr.rank;
|
|
break;
|
|
}
|
|
}
|
|
|
|
int best_code = 0;
|
|
bool result = false;
|
|
for (std::size_t i = 1; i < sbs.m_ranked_points.size(); i++)
|
|
{
|
|
typename sbs_type::rp const& ranked_point = sbs.m_ranked_points[i];
|
|
|
|
if (ranked_point.rank > selected_rank)
|
|
{
|
|
// Sorted on rank, so it makes no sense to continue
|
|
break;
|
|
}
|
|
|
|
int const code
|
|
= select_turn_in_cluster_union(selected_rank, ranked_point,
|
|
start_turn_index, start_op_index);
|
|
|
|
if (code > best_code)
|
|
{
|
|
// It is 1 or higher and matching better than previous
|
|
best_code = code;
|
|
turn_index = ranked_point.turn_index;
|
|
op_index = ranked_point.operation_index;
|
|
result = true;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
inline bool analyze_cluster_intersection(signed_size_type& turn_index,
|
|
int& op_index, sbs_type const& sbs) const
|
|
{
|
|
std::vector<sort_by_side::rank_with_rings> aggregation;
|
|
sort_by_side::aggregate_operations(sbs, aggregation, m_turns, operation_intersection);
|
|
|
|
std::size_t selected_rank = 0;
|
|
|
|
|
|
// Detect specific pattern(s)
|
|
bool const detected
|
|
= intersection_pattern_common_interior1(selected_rank, aggregation)
|
|
|| intersection_pattern_common_interior2(selected_rank, aggregation)
|
|
|| intersection_pattern_common_interior3(selected_rank, aggregation)
|
|
|| intersection_pattern_common_interior4(selected_rank, aggregation)
|
|
|| intersection_pattern_common_interior5(selected_rank, aggregation)
|
|
|| intersection_pattern_common_interior6(selected_rank, aggregation)
|
|
;
|
|
|
|
if (! detected)
|
|
{
|
|
signed_size_type incoming_region_id = 0;
|
|
std::set<signed_size_type> outgoing_region_ids;
|
|
|
|
for (std::size_t i = 0; i < aggregation.size(); i++)
|
|
{
|
|
sort_by_side::rank_with_rings const& rwr = aggregation[i];
|
|
|
|
if (rwr.all_to()
|
|
&& rwr.traversable(m_turns)
|
|
&& selected_rank == 0)
|
|
{
|
|
// Take the first (= right) where segments leave,
|
|
// having the polygon on the right side
|
|
selected_rank = rwr.rank;
|
|
}
|
|
|
|
if (rwr.all_from()
|
|
&& selected_rank > 0
|
|
&& outgoing_region_ids.empty())
|
|
{
|
|
// Incoming
|
|
break;
|
|
}
|
|
|
|
if (incoming_region_id == 0)
|
|
{
|
|
sort_by_side::ring_with_direction const& rwd = *rwr.rings.begin();
|
|
turn_type const& turn = m_turns[rwd.turn_index];
|
|
incoming_region_id = turn.operations[rwd.operation_index].enriched.region_id;
|
|
}
|
|
else
|
|
{
|
|
if (rwr.rings.size() == 1)
|
|
{
|
|
sort_by_side::ring_with_direction const& rwd = *rwr.rings.begin();
|
|
turn_type const& turn = m_turns[rwd.turn_index];
|
|
if (rwd.direction == sort_by_side::dir_to
|
|
&& turn.both(operation_intersection))
|
|
{
|
|
|
|
turn_operation_type const& op = turn.operations[rwd.operation_index];
|
|
if (op.enriched.region_id != incoming_region_id
|
|
&& op.enriched.isolated)
|
|
{
|
|
outgoing_region_ids.insert(op.enriched.region_id);
|
|
}
|
|
}
|
|
else if (! outgoing_region_ids.empty())
|
|
{
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
signed_size_type const region_id = turn.operations[i].enriched.region_id;
|
|
if (outgoing_region_ids.count(region_id) == 1)
|
|
{
|
|
selected_rank = 0;
|
|
outgoing_region_ids.erase(region_id);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (selected_rank > 0)
|
|
{
|
|
typename turn_operation_type::comparable_distance_type
|
|
min_remaining_distance = 0;
|
|
|
|
std::size_t selected_index = sbs.m_ranked_points.size();
|
|
for (std::size_t i = 0; i < sbs.m_ranked_points.size(); i++)
|
|
{
|
|
typename sbs_type::rp const& ranked_point = sbs.m_ranked_points[i];
|
|
|
|
if (ranked_point.rank == selected_rank)
|
|
{
|
|
turn_type const& ranked_turn = m_turns[ranked_point.turn_index];
|
|
turn_operation_type const& ranked_op = ranked_turn.operations[ranked_point.operation_index];
|
|
|
|
if (ranked_op.visited.finalized())
|
|
{
|
|
// This direction is already traveled before, the same
|
|
// cannot be traveled again
|
|
continue;
|
|
}
|
|
|
|
// Take turn with the smallest remaining distance
|
|
if (selected_index == sbs.m_ranked_points.size()
|
|
|| ranked_op.remaining_distance < min_remaining_distance)
|
|
{
|
|
selected_index = i;
|
|
min_remaining_distance = ranked_op.remaining_distance;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (selected_index < sbs.m_ranked_points.size())
|
|
{
|
|
typename sbs_type::rp const& ranked_point = sbs.m_ranked_points[selected_index];
|
|
turn_index = ranked_point.turn_index;
|
|
op_index = ranked_point.operation_index;
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
inline bool select_turn_from_cluster(signed_size_type& turn_index,
|
|
int& op_index,
|
|
signed_size_type start_turn_index, int start_op_index,
|
|
segment_identifier const& previous_seg_id) const
|
|
{
|
|
bool const is_union = target_operation == operation_union;
|
|
|
|
turn_type const& turn = m_turns[turn_index];
|
|
BOOST_ASSERT(turn.is_clustered());
|
|
|
|
typename Clusters::const_iterator mit = m_clusters.find(turn.cluster_id);
|
|
BOOST_ASSERT(mit != m_clusters.end());
|
|
|
|
cluster_info const& cinfo = mit->second;
|
|
std::set<signed_size_type> const& ids = cinfo.turn_indices;
|
|
|
|
sbs_type sbs(m_strategy);
|
|
|
|
for (typename std::set<signed_size_type>::const_iterator sit = ids.begin();
|
|
sit != ids.end(); ++sit)
|
|
{
|
|
signed_size_type cluster_turn_index = *sit;
|
|
turn_type const& cluster_turn = m_turns[cluster_turn_index];
|
|
bool const departure_turn = cluster_turn_index == turn_index;
|
|
if (cluster_turn.discarded)
|
|
{
|
|
// Defensive check, discarded turns should not be in cluster
|
|
continue;
|
|
}
|
|
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
sbs.add(cluster_turn.operations[i],
|
|
cluster_turn_index, i, previous_seg_id,
|
|
m_geometry1, m_geometry2,
|
|
departure_turn);
|
|
}
|
|
}
|
|
|
|
if (! sbs.has_origin())
|
|
{
|
|
return false;
|
|
}
|
|
sbs.apply(turn.point);
|
|
|
|
bool result = false;
|
|
|
|
if (is_union)
|
|
{
|
|
result = select_from_cluster_union(turn_index, op_index, sbs,
|
|
start_turn_index, start_op_index);
|
|
}
|
|
else
|
|
{
|
|
result = analyze_cluster_intersection(turn_index, op_index, sbs);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
inline bool analyze_ii_intersection(signed_size_type& turn_index, int& op_index,
|
|
turn_type const& current_turn,
|
|
segment_identifier const& previous_seg_id)
|
|
{
|
|
sbs_type sbs(m_strategy);
|
|
|
|
// Add this turn to the sort-by-side sorter
|
|
for (int i = 0; i < 2; i++)
|
|
{
|
|
sbs.add(current_turn.operations[i],
|
|
turn_index, i, previous_seg_id,
|
|
m_geometry1, m_geometry2,
|
|
true);
|
|
}
|
|
|
|
if (! sbs.has_origin())
|
|
{
|
|
return false;
|
|
}
|
|
|
|
sbs.apply(current_turn.point);
|
|
|
|
bool result = analyze_cluster_intersection(turn_index, op_index, sbs);
|
|
|
|
return result;
|
|
}
|
|
|
|
inline void change_index_for_self_turn(signed_size_type& to_vertex_index,
|
|
turn_type const& start_turn,
|
|
turn_operation_type const& start_op,
|
|
int start_op_index) const
|
|
{
|
|
if (OverlayType != overlay_buffer
|
|
&& OverlayType != overlay_dissolve_union
|
|
&& OverlayType != overlay_dissolve_intersection)
|
|
{
|
|
return;
|
|
}
|
|
|
|
const bool allow_uu = OverlayType != overlay_buffer;
|
|
|
|
// It travels to itself, can happen. If this is a buffer, it can
|
|
// sometimes travel to itself in the following configuration:
|
|
//
|
|
// +---->--+
|
|
// | |
|
|
// | +---*----+ *: one turn, with segment index 2/7
|
|
// | | | |
|
|
// | +---C | C: closing point (start/end)
|
|
// | |
|
|
// +------------+
|
|
//
|
|
// If it starts on segment 2 and travels to itself on segment 2, that
|
|
// should be corrected to 7 because that is the shortest path
|
|
//
|
|
// Also a uu turn (touching with another buffered ring) might have this
|
|
// apparent configuration, but there it should
|
|
// always travel the whole ring
|
|
|
|
turn_operation_type const& other_op
|
|
= start_turn.operations[1 - start_op_index];
|
|
|
|
bool const correct
|
|
= (allow_uu || ! start_turn.both(operation_union))
|
|
&& start_op.seg_id.source_index == other_op.seg_id.source_index
|
|
&& start_op.seg_id.multi_index == other_op.seg_id.multi_index
|
|
&& start_op.seg_id.ring_index == other_op.seg_id.ring_index
|
|
&& start_op.seg_id.segment_index == to_vertex_index;
|
|
|
|
#if defined(BOOST_GEOMETRY_DEBUG_TRAVERSE)
|
|
std::cout << " WARNING: self-buffer "
|
|
<< " correct=" << correct
|
|
<< " turn=" << operation_char(start_turn.operations[0].operation)
|
|
<< operation_char(start_turn.operations[1].operation)
|
|
<< " start=" << start_op.seg_id.segment_index
|
|
<< " from=" << to_vertex_index
|
|
<< " to=" << other_op.enriched.travels_to_vertex_index
|
|
<< std::endl;
|
|
#endif
|
|
|
|
if (correct)
|
|
{
|
|
to_vertex_index = other_op.enriched.travels_to_vertex_index;
|
|
}
|
|
}
|
|
|
|
bool select_turn_from_enriched(signed_size_type& turn_index,
|
|
segment_identifier& previous_seg_id,
|
|
signed_size_type& to_vertex_index,
|
|
signed_size_type start_turn_index,
|
|
int start_op_index,
|
|
turn_type const& previous_turn,
|
|
turn_operation_type const& previous_op,
|
|
bool is_start) const
|
|
{
|
|
to_vertex_index = -1;
|
|
|
|
if (previous_op.enriched.next_ip_index < 0)
|
|
{
|
|
// There is no next IP on this segment
|
|
if (previous_op.enriched.travels_to_vertex_index < 0
|
|
|| previous_op.enriched.travels_to_ip_index < 0)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
to_vertex_index = previous_op.enriched.travels_to_vertex_index;
|
|
|
|
if (is_start &&
|
|
previous_op.enriched.travels_to_ip_index == start_turn_index)
|
|
{
|
|
change_index_for_self_turn(to_vertex_index, previous_turn,
|
|
previous_op, start_op_index);
|
|
}
|
|
|
|
turn_index = previous_op.enriched.travels_to_ip_index;
|
|
previous_seg_id = previous_op.seg_id;
|
|
}
|
|
else
|
|
{
|
|
// Take the next IP on this segment
|
|
turn_index = previous_op.enriched.next_ip_index;
|
|
previous_seg_id = previous_op.seg_id;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool select_turn(signed_size_type start_turn_index, int start_op_index,
|
|
signed_size_type& turn_index,
|
|
int& op_index,
|
|
int previous_op_index,
|
|
signed_size_type previous_turn_index,
|
|
segment_identifier const& previous_seg_id,
|
|
bool is_start)
|
|
{
|
|
turn_type const& current_turn = m_turns[turn_index];
|
|
|
|
if (target_operation == operation_intersection)
|
|
{
|
|
bool const back_at_start_cluster
|
|
= current_turn.is_clustered()
|
|
&& m_turns[start_turn_index].cluster_id == current_turn.cluster_id;
|
|
|
|
if (turn_index == start_turn_index || back_at_start_cluster)
|
|
{
|
|
// Intersection can always be finished if returning
|
|
turn_index = start_turn_index;
|
|
op_index = start_op_index;
|
|
return true;
|
|
}
|
|
|
|
if (! current_turn.is_clustered()
|
|
&& current_turn.both(operation_intersection))
|
|
{
|
|
if (analyze_ii_intersection(turn_index, op_index,
|
|
current_turn, previous_seg_id))
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (current_turn.is_clustered())
|
|
{
|
|
if (! select_turn_from_cluster(turn_index, op_index,
|
|
start_turn_index, start_op_index, previous_seg_id))
|
|
{
|
|
return false;
|
|
}
|
|
|
|
if (is_start && turn_index == previous_turn_index)
|
|
{
|
|
op_index = previous_op_index;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
op_index = starting_operation_index(current_turn);
|
|
if (op_index == -1)
|
|
{
|
|
if (both_finished(current_turn))
|
|
{
|
|
return false;
|
|
}
|
|
|
|
if (! select_operation(current_turn, turn_index,
|
|
start_turn_index,
|
|
previous_seg_id,
|
|
op_index))
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
private :
|
|
Geometry1 const& m_geometry1;
|
|
Geometry2 const& m_geometry2;
|
|
Turns& m_turns;
|
|
Clusters const& m_clusters;
|
|
RobustPolicy const& m_robust_policy;
|
|
SideStrategy m_strategy;
|
|
Visitor& m_visitor;
|
|
};
|
|
|
|
|
|
|
|
}} // namespace detail::overlay
|
|
#endif // DOXYGEN_NO_DETAIL
|
|
|
|
}} // namespace boost::geometry
|
|
|
|
#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_TRAVERSAL_HPP
|