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
|
#include "routing/index_graph_starter.hpp"
#include "routing/routing_exceptions.hpp"
namespace routing
{
IndexGraphStarter::IndexGraphStarter(IndexGraph & graph, RoadPoint const & startPoint,
RoadPoint const & finishPoint)
: m_graph(graph)
, m_start(graph, startPoint, graph.GetNumJoints())
, m_finish(graph, finishPoint, graph.GetNumJoints() + 1)
{
m_start.SetupJointId(graph);
if (startPoint == finishPoint)
m_finish.m_jointId = m_start.m_jointId;
else
m_finish.SetupJointId(graph);
}
m2::PointD const & IndexGraphStarter::GetPoint(Joint::Id jointId)
{
if (jointId == m_start.m_fakeId)
return m_graph.GetGeometry().GetPoint(m_start.m_point);
if (jointId == m_finish.m_fakeId)
return m_graph.GetGeometry().GetPoint(m_finish.m_point);
return m_graph.GetPoint(jointId);
}
void IndexGraphStarter::RedressRoute(vector<Joint::Id> const & route,
vector<RoutePoint> & routePoints)
{
if (route.size() < 2)
{
if (route.size() == 1)
routePoints.emplace_back(m_start.m_point, 0.0 /* time */);
return;
}
routePoints.reserve(route.size() * 2);
EdgeEstimator const & estimator = m_graph.GetEstimator();
double routeTime = 0.0;
for (size_t i = 0; i < route.size() - 1; ++i)
{
Joint::Id const prevJoint = route[i];
Joint::Id const nextJoint = route[i + 1];
RoadPoint rp0;
RoadPoint rp1;
FindPointsWithCommonFeature(prevJoint, nextJoint, rp0, rp1);
if (i == 0)
routePoints.emplace_back(rp0, 0.0 /* time */);
uint32_t const featureId = rp0.GetFeatureId();
uint32_t const pointFrom = rp0.GetPointId();
uint32_t const pointTo = rp1.GetPointId();
RoadGeometry const roadGeometry = m_graph.GetGeometry().GetRoad(featureId);
CHECK_NOT_EQUAL(pointFrom, pointTo, ("featureId =", featureId));
uint32_t const step = pointFrom < pointTo ? 1 : -1;
for (uint32_t prevPointId = pointFrom; prevPointId != pointTo; prevPointId += step)
{
uint32_t const pointId = prevPointId + step;
routeTime += estimator.CalcEdgesWeight(featureId, roadGeometry, prevPointId, pointId);
routePoints.emplace_back(featureId, pointId, routeTime);
}
}
}
void IndexGraphStarter::GetEdgesList(Joint::Id jointId, bool isOutgoing, vector<JointEdge> & edges)
{
edges.clear();
if (jointId == m_start.m_fakeId)
{
GetFakeEdges(m_start, m_finish, isOutgoing, edges);
return;
}
if (jointId == m_finish.m_fakeId)
{
GetFakeEdges(m_finish, m_start, isOutgoing, edges);
return;
}
m_graph.GetEdgeList(jointId, isOutgoing, edges);
GetArrivalFakeEdges(jointId, m_start, isOutgoing, edges);
GetArrivalFakeEdges(jointId, m_finish, isOutgoing, edges);
}
void IndexGraphStarter::GetFakeEdges(IndexGraphStarter::FakeJoint const & from,
IndexGraphStarter::FakeJoint const & to, bool isOutgoing,
vector<JointEdge> & edges)
{
m_graph.GetNeighboringEdges(from.m_point, isOutgoing, edges);
if (!to.BelongsToGraph() && from.m_point.GetFeatureId() == to.m_point.GetFeatureId())
{
m_graph.GetDirectedEdge(from.m_point.GetFeatureId(), from.m_point.GetPointId(),
to.m_point.GetPointId(), to.m_jointId, isOutgoing, edges);
}
}
void IndexGraphStarter::GetArrivalFakeEdges(Joint::Id jointId,
IndexGraphStarter::FakeJoint const & fakeJoint,
bool isOutgoing, vector<JointEdge> & edges)
{
if (fakeJoint.BelongsToGraph())
return;
if (!m_graph.JointLiesOnRoad(jointId, fakeJoint.m_point.GetFeatureId()))
return;
vector<JointEdge> startEdges;
m_graph.GetNeighboringEdges(fakeJoint.m_point, !isOutgoing, startEdges);
for (JointEdge const & edge : startEdges)
{
if (edge.GetTarget() == jointId)
edges.emplace_back(fakeJoint.m_jointId, edge.GetWeight());
}
}
void IndexGraphStarter::FindPointsWithCommonFeature(Joint::Id jointId0, Joint::Id jointId1,
RoadPoint & result0, RoadPoint & result1)
{
bool found = false;
double minWeight = -1.0;
ForEachPoint(jointId0, [&](RoadPoint const & rp0) {
ForEachPoint(jointId1, [&](RoadPoint const & rp1) {
if (rp0.GetFeatureId() != rp1.GetFeatureId())
return;
RoadGeometry const & road = m_graph.GetGeometry().GetRoad(rp0.GetFeatureId());
if (road.IsOneWay() && rp0.GetPointId() > rp1.GetPointId())
return;
if (found)
{
if (minWeight < 0.0)
{
// CalcEdgesWeight is very expensive.
// So calculate it only if second common feature found.
RoadGeometry const & prevRoad = m_graph.GetGeometry().GetRoad(result0.GetFeatureId());
minWeight = m_graph.GetEstimator().CalcEdgesWeight(
rp0.GetFeatureId(), prevRoad, result0.GetPointId(), result1.GetPointId());
}
double const weight = m_graph.GetEstimator().CalcEdgesWeight(
rp0.GetFeatureId(), road, rp0.GetPointId(), rp1.GetPointId());
if (weight < minWeight)
{
minWeight = weight;
result0 = rp0;
result1 = rp1;
}
}
else
{
result0 = rp0;
result1 = rp1;
found = true;
}
});
});
CHECK(found, ("Can't find common feature for joints", jointId0, jointId1));
}
// IndexGraphStarter::FakeJoint --------------------------------------------------------------------
IndexGraphStarter::FakeJoint::FakeJoint(IndexGraph const & graph, RoadPoint const & point,
Joint::Id fakeId)
: m_point(point), m_fakeId(fakeId), m_jointId(Joint::kInvalidId)
{
}
void IndexGraphStarter::FakeJoint::SetupJointId(IndexGraph const & graph)
{
m_jointId = graph.GetJointId(m_point);
if (m_jointId == Joint::kInvalidId)
m_jointId = m_fakeId;
}
} // namespace routing
|
