561b7cc58e
Changes the processing order in the edge based graph factory. Instead of iterating over all outgoing edges in order, we compute the edge expanded graph in the order of intersections. This allows to remember intersection shapes and re-use them for all possible ingoing edges. Also: use low accuracry mode for intersections degree 2 intersections We can use lower accuracy here, since the `bearing` after the turn is not as relevant for off-route detection. Getting lost is near impossible here.
39 lines
1.1 KiB
C++
39 lines
1.1 KiB
C++
#ifndef OSRM_EXTRACTOR_GUIDANCE_TURN_DISCOVERY_HPP_
|
|
#define OSRM_EXTRACTOR_GUIDANCE_TURN_DISCOVERY_HPP_
|
|
|
|
#include "extractor/guidance/intersection.hpp"
|
|
#include "extractor/guidance/intersection_generator.hpp"
|
|
#include "util/typedefs.hpp"
|
|
|
|
#include <string>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace extractor
|
|
{
|
|
namespace guidance
|
|
{
|
|
namespace lanes
|
|
{
|
|
|
|
// OSRM processes edges by looking at a via_edge, coming into an intersection. For turn lanes, we
|
|
// might require to actually look back a turn. We do so in the hope that the turn lanes match up at
|
|
// the previous intersection for all incoming lanes.
|
|
bool findPreviousIntersection(
|
|
const NodeID node,
|
|
const EdgeID via_edge,
|
|
const Intersection &intersection,
|
|
const IntersectionGenerator &intersection_generator,
|
|
const util::NodeBasedDynamicGraph &node_based_graph, // query edge data
|
|
// output parameters, will be in an arbitrary state on failure
|
|
NodeID &result_node,
|
|
EdgeID &result_via_edge,
|
|
IntersectionView &result_intersection);
|
|
|
|
} // namespace lanes
|
|
} // namespace guidance
|
|
} // namespace extractor
|
|
} // namespace osrm
|
|
|
|
#endif /*OSRM_EXTRACTOR_GUIDANCE_TURN_DISCOVERY_HPP_*/
|