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
|
#pragma once
#include "indexer/cell_id.hpp"
#include "std/queue.hpp"
#include "std/vector.hpp"
// TODO: Move neccessary functions to geometry/covering_utils.hpp and delete this file.
template <typename BoundsT, typename CellIdT>
inline void SplitRectCell(CellIdT id,
double minX, double minY,
double maxX, double maxY,
vector<CellIdT> & result)
{
for (int8_t i = 0; i < 4; ++i)
{
CellIdT child = id.Child(i);
double minCellX, minCellY, maxCellX, maxCellY;
CellIdConverter<BoundsT, CellIdT>::GetCellBounds(child, minCellX, minCellY, maxCellX, maxCellY);
if (!((maxX < minCellX) || (minX > maxCellX) || (maxY < minCellY) || (minY > maxCellY)))
result.push_back(child);
}
}
template <typename BoundsT, typename CellIdT>
inline void CoverRect(double minX, double minY,
double maxX, double maxY,
size_t cells_count, int maxDepth,
vector<CellIdT> & cells)
{
if (minX < BoundsT::minX) minX = BoundsT::minX;
if (minY < BoundsT::minY) minY = BoundsT::minY;
if (maxX > BoundsT::maxX) maxX = BoundsT::maxX;
if (maxY > BoundsT::maxY) maxY = BoundsT::maxY;
if (minX >= maxX || minY >= maxY)
return;
CellIdT commonCell =
CellIdConverter<BoundsT, CellIdT>::Cover2PointsWithCell(minX, minY, maxX, maxY);
vector<CellIdT> result;
queue<CellIdT> cellQueue;
cellQueue.push(commonCell);
maxDepth -= 1;
while (!cellQueue.empty() && cellQueue.size() + result.size() < cells_count)
{
CellIdT id = cellQueue.front();
cellQueue.pop();
while (id.Level() > maxDepth)
id = id.Parent();
if (id.Level() == maxDepth)
{
result.push_back(id);
break;
}
vector<CellIdT> children;
SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);
// Children shouldn't be empty, but if it is, ignore this cellid in release.
ASSERT(!children.empty(), (id, minX, minY, maxX, maxY));
if (children.empty())
{
result.push_back(id);
continue;
}
if (cellQueue.size() + result.size() + children.size() <= cells_count)
{
for (size_t i = 0; i < children.size(); ++i)
cellQueue.push(children[i]);
}
else
result.push_back(id);
}
for (; !cellQueue.empty(); cellQueue.pop())
result.push_back(cellQueue.front());
for (size_t i = 0; i < result.size(); ++i)
{
CellIdT id = result[i];
while (id.Level() < maxDepth)
{
vector<CellIdT> children;
SplitRectCell<BoundsT>(id, minX, minY, maxX, maxY, children);
if (children.size() == 1)
id = children[0];
else
break;
}
result[i] = id;
}
ASSERT_LESS_OR_EQUAL(result.size(), cells_count, (minX, minY, maxX, maxY));
cells.insert(cells.end(), result.begin(), result.end());
}
|
