Name	Size	Mode	Actions
detail/	-	0755	rm
gmp_override.hpp	3245	0644	editdlrm
gtl.hpp	696	0644	editdlrm
interval_concept.hpp	25993	0644	editdlrm
interval_data.hpp	2701	0644	editdlrm
interval_traits.hpp	1364	0644	editdlrm
isotropy.hpp	17571	0644	editdlrm
point_concept.hpp	12743	0644	editdlrm
point_data.hpp	3252	0644	editdlrm
point_traits.hpp	1328	0644	editdlrm
polygon.hpp	2418	0644	editdlrm
polygon_45_data.hpp	2330	0644	editdlrm
polygon_45_set_concept.hpp	19393	0644	editdlrm
polygon_45_set_data.hpp	78330	0644	editdlrm
polygon_45_set_traits.hpp	6216	0644	editdlrm
polygon_45_with_holes_data.hpp	3510	0644	editdlrm
polygon_90_data.hpp	2888	0644	editdlrm
polygon_90_set_concept.hpp	26923	0644	editdlrm
polygon_90_set_data.hpp	44501	0644	editdlrm
polygon_90_set_traits.hpp	16451	0644	editdlrm
polygon_90_with_holes_data.hpp	3994	0644	editdlrm
polygon_data.hpp	2218	0644	editdlrm
polygon_set_concept.hpp	26570	0644	editdlrm
polygon_set_data.hpp	40251	0644	editdlrm
polygon_set_traits.hpp	5385	0644	editdlrm
polygon_traits.hpp	74180	0644	editdlrm
polygon_with_holes_data.hpp	3458	0644	editdlrm
rectangle_concept.hpp	50898	0644	editdlrm
rectangle_data.hpp	2120	0644	editdlrm
rectangle_traits.hpp	1349	0644	editdlrm
segment_concept.hpp	20086	0644	editdlrm
segment_data.hpp	2772	0644	editdlrm
segment_traits.hpp	1463	0644	editdlrm
segment_utils.hpp	4963	0644	editdlrm
transform.hpp	15004	0644	editdlrm
voronoi.hpp	4511	0644	editdlrm
voronoi_builder.hpp	19672	0644	editdlrm
voronoi_diagram.hpp	19489	0644	editdlrm
voronoi_geometry_type.hpp	1407	0644	editdlrm

/* Copyright 2012 Lucanus Simonson Use, modification and distribution are 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_POLYGON_SEGMENT_UTILS_HPP #define BOOST_POLYGON_SEGMENT_UTILS_HPP #include #include #include #include "detail/scan_arbitrary.hpp" #include "isotropy.hpp" #include "rectangle_concept.hpp" #include "segment_concept.hpp" namespace boost { namespace polygon { template typename enable_if< typename gtl_and< typename gtl_if< typename is_segment_concept< typename geometry_concept< typename std::iterator_traits::value_type >::type >::type >::type, typename gtl_if< typename is_segment_concept< typename geometry_concept::type >::type >::type >::type, void >::type intersect_segments( std::vector >& result, SegmentIterator first, SegmentIterator last) { typedef typename segment_traits::coordinate_type Unit; typedef typename scanline_base::Point Point; typedef typename scanline_base::half_edge half_edge; typedef int segment_id; std::vector > half_edges; std::vector > half_edges_out; segment_id id_in = 0; half_edges.reserve(std::distance(first, last)); for (; first != last; ++first) { Point l, h; assign(l, low(*first)); assign(h, high(*first)); half_edges.push_back(std::make_pair(half_edge(l, h), id_in++)); } half_edges_out.reserve(half_edges.size()); // Apparently no need to pre-sort data when calling validate_scan. if (half_edges.size() != 0) { line_intersection::validate_scan( half_edges_out, half_edges.begin(), half_edges.end()); } result.reserve(result.size() + half_edges_out.size()); for (std::size_t i = 0; i < half_edges_out.size(); ++i) { std::size_t id = (std::size_t)(half_edges_out[i].second); Point l = half_edges_out[i].first.first; Point h = half_edges_out[i].first.second; result.push_back(std::make_pair(id, construct(l, h))); } } template typename enable_if< typename gtl_and< typename gtl_if< typename is_segment_concept< typename geometry_concept< typename std::iterator_traits::value_type >::type >::type >::type, typename gtl_if< typename is_segment_concept< typename geometry_concept< typename SegmentContainer::value_type >::type >::type >::type >::type, void >::type intersect_segments( SegmentContainer& result, SegmentIterator first, SegmentIterator last) { typedef typename SegmentContainer::value_type segment_type; typedef typename segment_traits::coordinate_type Unit; typedef typename scanline_base::Point Point; typedef typename scanline_base::half_edge half_edge; typedef int segment_id; std::vector > half_edges; std::vector > half_edges_out; segment_id id_in = 0; half_edges.reserve(std::distance(first, last)); for (; first != last; ++first) { Point l, h; assign(l, low(*first)); assign(h, high(*first)); half_edges.push_back(std::make_pair(half_edge(l, h), id_in++)); } half_edges_out.reserve(half_edges.size()); // Apparently no need to pre-sort data when calling validate_scan. if (half_edges.size() != 0) { line_intersection::validate_scan( half_edges_out, half_edges.begin(), half_edges.end()); } result.reserve(result.size() + half_edges_out.size()); for (std::size_t i = 0; i < half_edges_out.size(); ++i) { Point l = half_edges_out[i].first.first; Point h = half_edges_out[i].first.second; result.push_back(construct(l, h)); } } template typename enable_if< typename gtl_and< typename gtl_if< typename is_rectangle_concept< typename geometry_concept::type >::type >::type, typename gtl_if< typename is_segment_concept< typename geometry_concept< typename std::iterator_traits::value_type >::type >::type >::type >::type, bool >::type envelope_segments( Rectangle& rect, SegmentIterator first, SegmentIterator last) { for (SegmentIterator it = first; it != last; ++it) { if (it == first) { set_points(rect, low(*it), high(*it)); } else { encompass(rect, low(*it)); encompass(rect, high(*it)); } } return first != last; } } // polygon } // boost #endif // BOOST_POLYGON_SEGMENT_UTILS_HPP