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
|
#include "openlr/candidate_points_getter.hpp"
#include "openlr/helpers.hpp"
#include "routing/road_graph.hpp"
#include "storage/country_info_getter.hpp"
#include "geometry/point_with_altitude.hpp"
#include "base/stl_helpers.hpp"
#include <algorithm>
#include <utility>
#include <vector>
using namespace routing;
namespace openlr
{
void CandidatePointsGetter::FillJunctionPointCandidates(m2::PointD const & p,
std::vector<m2::PointD> & candidates)
{
// TODO(mgsergio): Get optimal value using experiments on a sample.
// Or start with small radius and scale it up when there are too few points.
size_t const kRectSideMeters = 110;
auto const rect = mercator::RectByCenterXYAndSizeInMeters(p, kRectSideMeters);
auto const selectCandidates = [&rect, &candidates](FeatureType & ft) {
ft.ParseGeometry(FeatureType::BEST_GEOMETRY);
ft.ForEachPoint(
[&rect, &candidates](m2::PointD const & candidate) {
if (rect.IsPointInside(candidate))
candidates.emplace_back(candidate);
},
scales::GetUpperScale());
};
m_dataSource.ForEachInRect(selectCandidates, rect, scales::GetUpperScale());
// TODO: Move this to a separate stage.
// 1030292476 Does not match. Some problem occur with points.
// Either points duplicate or something alike. Check this
// later. The idea to fix this was to move SortUnique to the stage
// after enriching with projections.
base::SortUnique(candidates,
[&p](m2::PointD const & a, m2::PointD const & b) {
return mercator::DistanceOnEarth(a, p) < mercator::DistanceOnEarth(b, p);
},
[](m2::PointD const & a, m2::PointD const & b) { return a == b; });
candidates.resize(std::min(m_maxJunctionCandidates, candidates.size()));
}
void CandidatePointsGetter::EnrichWithProjectionPoints(m2::PointD const & p,
std::vector<m2::PointD> & candidates)
{
m_graph.ResetFakes();
std::vector<std::pair<Graph::Edge, geometry::PointWithAltitude>> vicinities;
m_graph.FindClosestEdges(p, static_cast<uint32_t>(m_maxProjectionCandidates), vicinities);
for (auto const & v : vicinities)
{
auto const & edge = v.first;
auto const & junction = v.second;
ASSERT(edge.HasRealPart() && !edge.IsFake(), ());
if (PointsAreClose(edge.GetStartPoint(), junction.GetPoint()) ||
PointsAreClose(edge.GetEndPoint(), junction.GetPoint()))
{
continue;
}
auto const firstHalf = Edge::MakeFake(edge.GetStartJunction(), junction, edge);
auto const secondHalf = Edge::MakeFake(junction, edge.GetEndJunction(), edge);
m_graph.AddOutgoingFakeEdge(firstHalf);
m_graph.AddIngoingFakeEdge(firstHalf);
m_graph.AddOutgoingFakeEdge(secondHalf);
m_graph.AddIngoingFakeEdge(secondHalf);
candidates.push_back(junction.GetPoint());
}
}
} // namespace openlr
|
