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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
#include "indexer/feature_covering.hpp"
#include "indexer/feature.hpp"
#include "geometry/covering_utils.hpp"
using namespace std;
namespace
{
// This class should only be used with covering::CoverObject()!
template <int DEPTH_LEVELS>
class FeatureIntersector
{
public:
struct Trg
{
m2::PointD m_a, m_b, m_c;
Trg(m2::PointD const & a, m2::PointD const & b, m2::PointD const & c)
: m_a(a), m_b(b), m_c(c) {}
};
vector<m2::PointD> m_polyline;
vector<Trg> m_trg;
m2::RectD m_rect;
// Note:
// 1. Here we don't need to differentiate between CELL_OBJECT_INTERSECT and OBJECT_INSIDE_CELL.
// 2. We can return CELL_OBJECT_INTERSECT instead of CELL_INSIDE_OBJECT - it's just
// a performance penalty.
covering::CellObjectIntersection operator()(m2::CellId<DEPTH_LEVELS> const & cell) const
{
using namespace covering;
m2::RectD cellRect;
{
// Check for limit rect intersection.
pair<uint32_t, uint32_t> const xy = cell.XY();
uint32_t const r = cell.Radius();
ASSERT_GREATER_OR_EQUAL(xy.first, r, ());
ASSERT_GREATER_OR_EQUAL(xy.second, r, ());
cellRect = m2::RectD(xy.first - r, xy.second - r, xy.first + r, xy.second + r);
if (!cellRect.IsIntersect(m_rect))
return CELL_OBJECT_NO_INTERSECTION;
}
for (size_t i = 0; i < m_trg.size(); ++i)
{
m2::RectD r;
r.Add(m_trg[i].m_a);
r.Add(m_trg[i].m_b);
r.Add(m_trg[i].m_c);
if (!cellRect.IsIntersect(r))
continue;
CellObjectIntersection const res =
IntersectCellWithTriangle(cell, m_trg[i].m_a, m_trg[i].m_b, m_trg[i].m_c);
switch (res)
{
case CELL_OBJECT_NO_INTERSECTION:
break;
case CELL_INSIDE_OBJECT:
return CELL_INSIDE_OBJECT;
case CELL_OBJECT_INTERSECT:
case OBJECT_INSIDE_CELL:
return CELL_OBJECT_INTERSECT;
}
}
for (size_t i = 1; i < m_polyline.size(); ++i)
{
CellObjectIntersection const res =
IntersectCellWithLine(cell, m_polyline[i], m_polyline[i-1]);
switch (res)
{
case CELL_OBJECT_NO_INTERSECTION:
break;
case CELL_INSIDE_OBJECT:
ASSERT(false, (cell, i, m_polyline));
return CELL_OBJECT_INTERSECT;
case CELL_OBJECT_INTERSECT:
case OBJECT_INSIDE_CELL:
return CELL_OBJECT_INTERSECT;
}
}
return CELL_OBJECT_NO_INTERSECTION;
}
using Converter = CellIdConverter<mercator::Bounds, m2::CellId<DEPTH_LEVELS>>;
m2::PointD ConvertPoint(m2::PointD const & p)
{
m2::PointD const pt(Converter::XToCellIdX(p.x), Converter::YToCellIdY(p.y));
m_rect.Add(pt);
return pt;
}
void operator() (m2::PointD const & pt)
{
m_polyline.push_back(ConvertPoint(pt));
}
void operator() (m2::PointD const & a, m2::PointD const & b, m2::PointD const & c)
{
m_trg.emplace_back(ConvertPoint(a), ConvertPoint(b), ConvertPoint(c));
}
};
template <int DEPTH_LEVELS>
void GetIntersection(FeatureType & f, FeatureIntersector<DEPTH_LEVELS> & fIsect)
{
// We need to cover feature for the best geometry, because it's indexed once for the
// first top level scale. Do reset current cached geometry first.
f.ResetGeometry();
int const scale = FeatureType::BEST_GEOMETRY;
f.ForEachPoint(fIsect, scale);
f.ForEachTriangle(fIsect, scale);
CHECK(!(fIsect.m_trg.empty() && fIsect.m_polyline.empty()) &&
f.GetLimitRect(scale).IsValid(), (f.DebugString(scale)));
}
template <int DEPTH_LEVELS>
vector<int64_t> CoverIntersection(FeatureIntersector<DEPTH_LEVELS> const & fIsect, int cellDepth,
uint64_t cellPenaltyArea)
{
if (fIsect.m_trg.empty() && fIsect.m_polyline.size() == 1)
{
m2::PointD const pt = fIsect.m_polyline[0];
return vector<int64_t>(
1, m2::CellId<DEPTH_LEVELS>::FromXY(static_cast<uint32_t>(pt.x),
static_cast<uint32_t>(pt.y), DEPTH_LEVELS - 1)
.ToInt64(cellDepth));
}
vector<m2::CellId<DEPTH_LEVELS>> cells;
covering::CoverObject(fIsect, cellPenaltyArea, cells, cellDepth,
m2::CellId<DEPTH_LEVELS>::Root());
vector<int64_t> res(cells.size());
for (size_t i = 0; i < cells.size(); ++i)
res[i] = cells[i].ToInt64(cellDepth);
return res;
}
} // namespace
namespace covering
{
vector<int64_t> CoverFeature(FeatureType & f, int cellDepth, uint64_t cellPenaltyArea)
{
FeatureIntersector<RectId::DEPTH_LEVELS> fIsect;
GetIntersection(f, fIsect);
return CoverIntersection(fIsect, cellDepth, cellPenaltyArea);
}
void SortAndMergeIntervals(Intervals v, Intervals & res)
{
#ifdef DEBUG
ASSERT ( res.empty(), () );
for (size_t i = 0; i < v.size(); ++i)
ASSERT_LESS(v[i].first, v[i].second, (i));
#endif
sort(v.begin(), v.end());
res.reserve(v.size());
for (size_t i = 0; i < v.size(); ++i)
{
if (i == 0 || res.back().second < v[i].first)
res.push_back(v[i]);
else
res.back().second = max(res.back().second, v[i].second);
}
}
Intervals SortAndMergeIntervals(Intervals const & v)
{
Intervals res;
SortAndMergeIntervals(v, res);
return res;
}
}
|
