inline bool has_self_intersections(Geometry const& geometry, bool throw_on_self_intersection = true) { typedef typename geometry::point_type<Geometry>::type point_type; typedef typename geometry::rescale_policy_type<point_type>::type rescale_policy_type; rescale_policy_type robust_policy = geometry::get_rescale_policy<rescale_policy_type>(geometry); return has_self_intersections(geometry, robust_policy, throw_on_self_intersection); }
static inline bool apply(Linestring const& linestring) { simplicity_failure_policy policy; return ! detail::is_valid::has_duplicates < Linestring, closed >::apply(linestring, policy) && ! detail::is_valid::has_spikes < Linestring, closed >::apply(linestring, policy) && ! (CheckSelfIntersections && has_self_intersections(linestring)); }
static inline bool apply(MultiLinestring const& multilinestring) { // check each of the linestrings for simplicity // but do not compute self-intersections yet; these will be // computed for the entire multilinestring if ( ! detail::check_iterator_range < is_simple_linestring < typename boost::range_value<MultiLinestring>::type, false // do not compute self-intersections >, true // allow empty multilinestring >::apply(boost::begin(multilinestring), boost::end(multilinestring)) ) { return false; } return ! has_self_intersections(multilinestring); }
static inline OutputIterator apply( Geometry1 const& geometry1, Geometry2 const& geometry2, OutputIterator out, Strategy const& ) { if (geometry::num_points(geometry1) == 0 && geometry::num_points(geometry2) == 0) { return out; } typedef typename geometry::point_type<GeometryOut>::type point_type; typedef detail::overlay::traversal_turn_info<point_type> turn_info; typedef std::deque<turn_info> container_type; typedef std::deque < typename geometry::ring_type<GeometryOut>::type > ring_container_type; if (geometry::num_points(geometry1) == 0 || geometry::num_points(geometry2) == 0) { return return_if_one_input_is_empty < GeometryOut, Direction, ReverseOut >(geometry1, geometry2, out); } has_self_intersections(geometry1); has_self_intersections(geometry2); container_type turn_points; #ifdef BOOST_GEOMETRY_TIME_OVERLAY boost::timer timer; #endif #ifdef BOOST_GEOMETRY_DEBUG_ASSEMBLE std::cout << "get turns" << std::endl; #endif detail::get_turns::no_interrupt_policy policy; geometry::get_turns < Reverse1, Reverse2, detail::overlay::calculate_distance_policy >(geometry1, geometry2, turn_points, policy); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "get_turns: " << timer.elapsed() << std::endl; #endif #ifdef BOOST_GEOMETRY_DEBUG_ASSEMBLE std::cout << "enrich" << std::endl; #endif typename Strategy::side_strategy_type side_strategy; geometry::enrich_intersection_points<Reverse1, Reverse2>(turn_points, Direction == overlay_union ? geometry::detail::overlay::operation_union : geometry::detail::overlay::operation_intersection, geometry1, geometry2, side_strategy); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "enrich_intersection_points: " << timer.elapsed() << std::endl; #endif #ifdef BOOST_GEOMETRY_DEBUG_ASSEMBLE std::cout << "traverse" << std::endl; #endif // Traverse through intersection/turn points and create rings of them. // Note that these rings are always in clockwise order, even in CCW polygons, // and are marked as "to be reversed" below ring_container_type rings; geometry::traverse<Reverse1, Reverse2>(geometry1, geometry2, Direction == overlay_union ? geometry::detail::overlay::operation_union : geometry::detail::overlay::operation_intersection, turn_points, rings); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "traverse: " << timer.elapsed() << std::endl; #endif std::map<ring_identifier, int> map; map_turns(map, turn_points); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "map_turns: " << timer.elapsed() << std::endl; #endif typedef ring_properties<typename geometry::point_type<Geometry1>::type> properties; std::map<ring_identifier, properties> selected; select_rings<Direction>(geometry1, geometry2, map, selected, ! turn_points.empty()); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "select_rings: " << timer.elapsed() << std::endl; #endif // Add rings created during traversal { ring_identifier id(2, 0, -1); for (typename boost::range_iterator<ring_container_type>::type it = boost::begin(rings); it != boost::end(rings); ++it) { selected[id] = properties(*it, true); selected[id].reversed = ReverseOut; id.multi_index++; } } #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "add traversal rings: " << timer.elapsed() << std::endl; #endif assign_parents(geometry1, geometry2, rings, selected); #ifdef BOOST_GEOMETRY_TIME_OVERLAY std::cout << "assign_parents: " << timer.elapsed() << std::endl; #endif return add_rings<GeometryOut>(selected, geometry1, geometry2, rings, out); }