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
213
214
215
216
217
218
219
220
221
222
223
224
225
|
#include "followed_polyline.hpp"
#include <algorithm>
#include <limits>
namespace routing
{
using namespace std;
using Iter = routing::FollowedPolyline::Iter;
Iter FollowedPolyline::Begin() const
{
ASSERT(IsValid(), ());
return Iter(m_poly.Front(), 0);
}
Iter FollowedPolyline::End() const
{
ASSERT(IsValid(), ());
return Iter(m_poly.Back(), m_poly.GetSize() - 1);
}
Iter FollowedPolyline::GetIterToIndex(size_t index) const
{
ASSERT(IsValid(), ());
ASSERT_LESS(index, m_poly.GetSize(), ());
return Iter(m_poly.GetPoint(index), index);
}
double FollowedPolyline::GetDistanceM(Iter const & it1, Iter const & it2) const
{
ASSERT(IsValid(), ());
ASSERT(it1.IsValid() && it2.IsValid(), ());
ASSERT_LESS_OR_EQUAL(it1.m_ind, it2.m_ind, ());
ASSERT_LESS(it1.m_ind, m_poly.GetSize(), ());
ASSERT_LESS(it2.m_ind, m_poly.GetSize(), ());
if (it1.m_ind == it2.m_ind)
return MercatorBounds::DistanceOnEarth(it1.m_pt, it2.m_pt);
return (MercatorBounds::DistanceOnEarth(it1.m_pt, m_poly.GetPoint(it1.m_ind + 1)) +
m_segDistance[it2.m_ind - 1] - m_segDistance[it1.m_ind] +
MercatorBounds::DistanceOnEarth(m_poly.GetPoint(it2.m_ind), it2.m_pt));
}
double FollowedPolyline::GetTotalDistanceMeters() const
{
if (!IsValid())
{
ASSERT(IsValid(), ());
return 0;
}
return m_segDistance.back();
}
double FollowedPolyline::GetDistanceFromStartMeters() const
{
if (!IsValid() || !m_current.IsValid())
{
ASSERT(IsValid(), ());
ASSERT(m_current.IsValid(), ());
return 0;
}
return (m_current.m_ind > 0 ? m_segDistance[m_current.m_ind - 1] : 0.0) +
MercatorBounds::DistanceOnEarth(m_current.m_pt, m_poly.GetPoint(m_current.m_ind));
}
double FollowedPolyline::GetDistanceToEndMeters() const
{
return GetTotalDistanceMeters() - GetDistanceFromStartMeters();
}
void FollowedPolyline::Swap(FollowedPolyline & rhs)
{
m_poly.Swap(rhs.m_poly);
m_segDistance.swap(rhs.m_segDistance);
m_segProj.swap(rhs.m_segProj);
swap(m_current, rhs.m_current);
swap(m_nextCheckpointIndex, rhs.m_nextCheckpointIndex);
}
void FollowedPolyline::Update()
{
size_t n = m_poly.GetSize();
ASSERT_GREATER(n, 1, ());
--n;
m_segDistance.resize(n);
m_segProj.resize(n);
double dist = 0.0;
for (size_t i = 0; i < n; ++i)
{
m2::PointD const & p1 = m_poly.GetPoint(i);
m2::PointD const & p2 = m_poly.GetPoint(i + 1);
dist += MercatorBounds::DistanceOnEarth(p1, p2);
m_segDistance[i] = dist;
m_segProj[i].SetBounds(p1, p2);
}
m_current = Iter(m_poly.Front(), 0);
}
template <class DistanceFn>
Iter FollowedPolyline::GetClosestProjectionInInterval(m2::RectD const & posRect,
DistanceFn const & distFn, size_t startIdx,
size_t endIdx) const
{
CHECK_LESS_OR_EQUAL(endIdx, m_segProj.size(), ());
CHECK_LESS_OR_EQUAL(startIdx, endIdx, ());
Iter res;
double minDist = numeric_limits<double>::max();
m2::PointD const currPos = posRect.Center();
for (size_t i = startIdx; i < endIdx; ++i)
{
m2::PointD const pt = m_segProj[i](currPos);
if (!posRect.IsPointInside(pt))
continue;
Iter it(pt, i);
double const dp = distFn(it);
if (dp < minDist)
{
res = it;
minDist = dp;
}
}
return res;
}
template <class DistanceFn>
Iter FollowedPolyline::GetBestProjection(m2::RectD const & posRect,
DistanceFn const & distFn) const
{
CHECK_EQUAL(m_segProj.size() + 1, m_poly.GetSize(), ());
// At first trying to find a projection to two closest route segments of route which is close
// enough to |posRect| center. If m_current is right before intermediate point we can get closestIter
// right after intermediate point (in next subroute).
size_t const hoppingBorderIdx = min(m_segProj.size(), m_current.m_ind + 2);
Iter const closestIter =
GetClosestProjectionInInterval(posRect, distFn, m_current.m_ind, hoppingBorderIdx);
if (closestIter.IsValid())
return closestIter;
// If a projection to the two closest route segments is not found tries to find projection to other route
// segments of current subroute.
return GetClosestProjectionInInterval(posRect, distFn, hoppingBorderIdx, m_nextCheckpointIndex);
}
Iter FollowedPolyline::UpdateProjectionByPrediction(m2::RectD const & posRect,
double predictDistance)
{
ASSERT(m_current.IsValid(), ());
ASSERT_LESS(m_current.m_ind, m_poly.GetSize() - 1, ());
if (predictDistance <= 0.0)
return UpdateProjection(posRect);
Iter res;
res = GetBestProjection(posRect, [&](Iter const & it)
{
return fabs(GetDistanceM(m_current, it) - predictDistance);
});
if (res.IsValid())
m_current = res;
return res;
}
Iter FollowedPolyline::UpdateProjection(m2::RectD const & posRect)
{
ASSERT(m_current.IsValid(), ());
ASSERT_LESS(m_current.m_ind, m_poly.GetSize() - 1, ());
Iter res;
m2::PointD const currPos = posRect.Center();
res = GetBestProjection(posRect, [&](Iter const & it)
{
return MercatorBounds::DistanceOnEarth(it.m_pt, currPos);
});
if (res.IsValid())
m_current = res;
return res;
}
double FollowedPolyline::GetDistFromCurPointToRoutePointMerc() const
{
if (!m_current.IsValid())
return 0.0;
return m_poly.GetPoint(m_current.m_ind).Length(m_current.m_pt);
}
double FollowedPolyline::GetDistFromCurPointToRoutePointMeters() const
{
if (!m_current.IsValid())
return 0.0;
return MercatorBounds::DistanceOnEarth(m_poly.GetPoint(m_current.m_ind), m_current.m_pt);
}
void FollowedPolyline::GetCurrentDirectionPoint(m2::PointD & pt, double toleranceM) const
{
ASSERT(IsValid(), ());
size_t currentIndex = min(m_current.m_ind + 1, m_poly.GetSize() - 1);
m2::PointD point = m_poly.GetPoint(currentIndex);
for (; currentIndex < m_poly.GetSize() - 1; point = m_poly.GetPoint(++currentIndex))
{
if (MercatorBounds::DistanceOnEarth(point, m_current.m_pt) > toleranceM)
break;
}
pt = point;
}
} // namespace routing
|
