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
|
#include "routing/nearest_edge_finder.hpp"
#include "geometry/distance.hpp"
#include "indexer/feature.hpp"
#include "base/assert.hpp"
#include "std/limits.hpp"
namespace routing
{
NearestEdgeFinder::Candidate::Candidate() : m_dist(numeric_limits<double>::max()), m_segId(0) {}
NearestEdgeFinder::NearestEdgeFinder(m2::PointD const & point)
: m_point(point)
{
}
void NearestEdgeFinder::AddInformationSource(FeatureID const & featureId, IRoadGraph::RoadInfo const & roadInfo)
{
Candidate res;
size_t const count = roadInfo.m_junctions.size();
ASSERT_GREATER(count, 1, ());
for (size_t i = 1; i < count; ++i)
{
/// @todo Probably, we need to get exact projection distance in meters.
m2::ProjectionToSection<m2::PointD> segProj;
segProj.SetBounds(roadInfo.m_junctions[i - 1].GetPoint(), roadInfo.m_junctions[i].GetPoint());
m2::PointD const pt = segProj(m_point);
double const d = m_point.SquareLength(pt);
if (d < res.m_dist)
{
Junction const & segStart = roadInfo.m_junctions[i - 1];
Junction const & segEnd = roadInfo.m_junctions[i];
feature::TAltitude const startAlt = segStart.GetAltitude();
feature::TAltitude const endAlt = segEnd.GetAltitude();
double const segLenM = MercatorBounds::DistanceOnEarth(segStart.GetPoint(), segEnd.GetPoint());
feature::TAltitude projPointAlt = feature::kDefaultAltitudeMeters;
if (segLenM == 0.0)
{
LOG(LWARNING, ("Length of segment", i, " of feature", featureId, "is zero."));
projPointAlt = startAlt;
}
else
{
double const distFromStartM = MercatorBounds::DistanceOnEarth(segStart.GetPoint(), pt);
ASSERT_LESS_OR_EQUAL(distFromStartM, segLenM, (featureId));
projPointAlt = startAlt + static_cast<feature::TAltitude>((endAlt - startAlt) * distFromStartM / segLenM);
}
res.m_dist = d;
res.m_fid = featureId;
res.m_segId = static_cast<uint32_t>(i - 1);
res.m_segStart = segStart;
res.m_segEnd = segEnd;
ASSERT_NOT_EQUAL(res.m_segStart.GetAltitude() , feature::kInvalidAltitude, ());
ASSERT_NOT_EQUAL(res.m_segEnd.GetAltitude(), feature::kInvalidAltitude, ());
res.m_projPoint = Junction(pt, projPointAlt);
}
}
if (res.m_fid.IsValid())
m_candidates.push_back(res);
}
void NearestEdgeFinder::MakeResult(vector<pair<Edge, Junction>> & res,
size_t const maxCountFeatures)
{
sort(m_candidates.begin(), m_candidates.end(), [](Candidate const & r1, Candidate const & r2)
{
return (r1.m_dist < r2.m_dist);
});
res.clear();
res.reserve(maxCountFeatures);
size_t i = 0;
for (Candidate const & candidate : m_candidates)
{
res.emplace_back(Edge(candidate.m_fid, true /* forward */, candidate.m_segId,
candidate.m_segStart, candidate.m_segEnd),
candidate.m_projPoint);
++i;
if (i == maxCountFeatures)
break;
}
}
} // namespace routing
|
