1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
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 <iterator>
#include <set>
#include <vector>
#include "detail/scan_arbitrary.hpp"
#include "isotropy.hpp"
#include "rectangle_concept.hpp"
#include "segment_concept.hpp"
namespace boost {
namespace polygon {
template <typename Segment, typename SegmentIterator>
typename enable_if<
typename gtl_and<
typename gtl_if<
typename is_segment_concept<
typename geometry_concept<
typename std::iterator_traits<SegmentIterator>::value_type
>::type
>::type
>::type,
typename gtl_if<
typename is_segment_concept<
typename geometry_concept<Segment>::type
>::type
>::type
>::type,
void
>::type
intersect_segments(
std::vector<std::pair<std::size_t, Segment> >& result,
SegmentIterator first, SegmentIterator last) {
typedef typename segment_traits<Segment>::coordinate_type Unit;
typedef typename scanline_base<Unit>::Point Point;
typedef typename scanline_base<Unit>::half_edge half_edge;
typedef int segment_id;
std::vector<std::pair<half_edge, segment_id> > half_edges;
std::vector<std::pair<half_edge, segment_id> > 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<Unit>::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<Segment>(l, h)));
}
}
template <typename SegmentContainer, typename SegmentIterator>
typename enable_if<
typename gtl_and<
typename gtl_if<
typename is_segment_concept<
typename geometry_concept<
typename std::iterator_traits<SegmentIterator>::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<segment_type>::coordinate_type Unit;
typedef typename scanline_base<Unit>::Point Point;
typedef typename scanline_base<Unit>::half_edge half_edge;
typedef int segment_id;
std::vector<std::pair<half_edge, segment_id> > half_edges;
std::vector<std::pair<half_edge, segment_id> > 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<Unit>::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<segment_type>(l, h));
}
}
template <typename Rectangle, typename SegmentIterator>
typename enable_if<
typename gtl_and<
typename gtl_if<
typename is_rectangle_concept<
typename geometry_concept<Rectangle>::type
>::type
>::type,
typename gtl_if<
typename is_segment_concept<
typename geometry_concept<
typename std::iterator_traits<SegmentIterator>::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
|
