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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
#pragma once
#include "indexer/cell_id.hpp"
#include "indexer/cell_value_pair.hpp"
#include "indexer/classificator.hpp"
#include "indexer/drawing_rules.hpp"
#include "indexer/feature_data.hpp"
#include "indexer/feature_visibility.hpp"
#include "indexer/scales.hpp"
#include "geometry/point2d.hpp"
#include "geometry/rect2d.hpp"
#include "geometry/screenbase.hpp"
#include "geometry/tree4d.hpp"
#include "std/map.hpp"
#include "std/queue.hpp"
#include "std/target_os.hpp"
#include "std/vector.hpp"
namespace
{
double constexpr kPOIDisplacementRadiusPixels = 80.;
// Displacement radius in pixels * half of the world in degrees / meaned graphics tile size.
// So average displacement radius will be: this / tiles in row count.
double constexpr kPOIDisplacementRadiusMultiplier = kPOIDisplacementRadiusPixels * 180. / 512.;
} // namespace
namespace covering
{
class CellFeatureBucketTuple
{
public:
using CellFeaturePair = CellValuePair<uint32_t>;
CellFeatureBucketTuple() : m_bucket(0) {}
CellFeatureBucketTuple(CellFeaturePair const & p, uint32_t bucket) : m_pair(p), m_bucket(bucket)
{
}
bool operator<(CellFeatureBucketTuple const & rhs) const
{
if (m_bucket != rhs.m_bucket)
return m_bucket < rhs.m_bucket;
return m_pair < rhs.m_pair;
}
CellFeaturePair const & GetCellFeaturePair() const { return m_pair; }
uint32_t GetBucket() const { return m_bucket; }
private:
CellFeaturePair m_pair;
uint32_t m_bucket;
};
static_assert(sizeof(CellFeatureBucketTuple) == 16, "");
#ifndef OMIM_OS_LINUX
static_assert(std::is_trivially_copyable<CellFeatureBucketTuple>::value, "");
#endif
/// Displacement manager filters incoming single-point features to simplify runtime
/// feature visibility displacement.
template <class TSorter>
class DisplacementManager
{
public:
using CellFeaturePair = CellFeatureBucketTuple::CellFeaturePair;
DisplacementManager(TSorter & sorter) : m_sorter(sorter) {}
/// Add feature at bucket (zoom) to displaceable queue if possible. Pass to bucket otherwise.
template <class TFeature>
void Add(vector<int64_t> const & cells, uint32_t bucket, TFeature const & ft, uint32_t index)
{
// Add to displaceable storage if we need to displace POI.
if (bucket != scales::GetUpperScale() && IsDisplaceable(ft))
{
m_storage.emplace_back(cells, ft, index, bucket);
return;
}
// Pass feature to the index otherwise.
for (auto const & cell : cells)
m_sorter.Add(CellFeatureBucketTuple(CellFeaturePair(cell, index), bucket));
}
/// Check features intersection and supress drawing of intersected features.
/// As a result some features may have bigger scale parameter than style describes.
/// But every feature has MaxScale at least.
/// After all features passed to sorter.
void Displace()
{
m4::Tree<DisplaceableNode> acceptedNodes;
// Sort in priority descend mode.
sort(m_storage.begin(), m_storage.end(), greater<DisplaceableNode>());
for (auto const & node : m_storage)
{
auto scale = node.m_minScale;
// Do not filter high level objects. Including metro and country names.
static auto const maximumIgnoredZoom = feature::GetDrawableScaleRange(
classif().GetTypeByPath({"railway", "station", "subway"})).first;
if (maximumIgnoredZoom < 0 || scale <= maximumIgnoredZoom)
{
AddNodeToSorter(node, static_cast<uint32_t>(scale));
acceptedNodes.Add(node);
continue;
}
for (; scale < scales::GetUpperScale(); ++scale)
{
float const delta = CalculateDeltaForZoom(scale);
float const squaredDelta = delta * delta;
m2::RectD const displacementRect(node.m_center, node.m_center);
bool isDisplaced = false;
acceptedNodes.ForEachInRect(m2::Inflate(displacementRect, {delta, delta}),
[&isDisplaced, &node, &squaredDelta, &scale](DisplaceableNode const & rhs)
{
if (node.m_center.SquareLength(rhs.m_center) < squaredDelta && rhs.m_maxScale > scale)
isDisplaced = true;
});
if (isDisplaced)
continue;
// Add feature to index otherwise.
AddNodeToSorter(node, scale);
acceptedNodes.Add(node);
break;
}
if (scale == scales::GetUpperScale())
AddNodeToSorter(node, scale);
}
}
private:
struct DisplaceableNode
{
uint32_t m_index;
FeatureID m_fID;
m2::PointD m_center;
vector<int64_t> m_cells;
int m_minScale;
int m_maxScale;
uint32_t m_priority;
DisplaceableNode() : m_index(0), m_minScale(0), m_maxScale(0), m_priority(0) {}
template <class TFeature>
DisplaceableNode(vector<int64_t> const & cells, TFeature const & ft, uint32_t index,
int zoomLevel)
: m_index(index), m_fID(ft.GetID()), m_center(ft.GetCenter()), m_cells(cells), m_minScale(zoomLevel)
{
feature::TypesHolder const types(ft);
auto scaleRange = feature::GetDrawableScaleRange(types);
m_maxScale = scaleRange.second;
// Calculate depth field
drule::KeysT keys;
feature::GetDrawRule(ft, zoomLevel, keys);
// While the function has "runtime" in its name, it merely filters by metadata-based rules.
feature::FilterRulesByRuntimeSelector(ft, zoomLevel, keys);
drule::MakeUnique(keys);
float depth = 0;
for (size_t i = 0, count = keys.size(); i < count; ++i)
{
if (depth < keys[i].m_priority)
depth = keys[i].m_priority;
}
float const kMinDepth = -100000.0f;
float const kMaxDepth = 100000.0f;
float const d = my::clamp(depth, kMinDepth, kMaxDepth) - kMinDepth;
uint8_t rank = ft.GetRank();
m_priority = (static_cast<uint32_t>(d) << 8) | rank;
}
// Same to dynamic displacement behaviour.
bool operator>(DisplaceableNode const & rhs) const
{
if (m_priority > rhs.m_priority)
return true;
return (m_priority == rhs.m_priority && m_fID < rhs.m_fID);
}
m2::RectD const GetLimitRect() const { return m2::RectD(m_center, m_center); }
};
template <class TFeature>
static bool IsDisplaceable(TFeature const & ft)
{
feature::TypesHolder const types(ft);
return types.GetGeoType() == feature::GEOM_POINT;
}
float CalculateDeltaForZoom(int32_t zoom) const
{
// zoom - 1 is similar to drape.
double const worldSizeDivisor = 1 << (zoom - 1);
return kPOIDisplacementRadiusMultiplier / worldSizeDivisor;
}
void AddNodeToSorter(DisplaceableNode const & node, uint32_t scale)
{
for (auto const & cell : node.m_cells)
m_sorter.Add(CellFeatureBucketTuple(CellFeaturePair(cell, node.m_index), scale));
}
TSorter & m_sorter;
vector<DisplaceableNode> m_storage;
};
} // namespace indexer
|
