Currently OSRM only supports turn restrictions with a single via-node or one via-way. OSM allows for multiple via-ways to represent longer and more complex restrictions. This PR extends the use of duplicate nodes for representng via-way turn restrictions to also support multi via-way restrictions. Effectively, this increases the edge-based graph size by the number of edges in multi via-way restrictions. However, given the low number of these restrictions it has little effect on total graph size. In addition, we add a new step in the extraction phase that constructs a restriction graph to support more complex relationships between restrictions, such as nested restrictions and overlapping restrictions.
188 lines
7.4 KiB
C++
188 lines
7.4 KiB
C++
#ifndef OSRM_EXTRACTOR_GUIDANCE_MERGEABLE_ROADS
|
||
#define OSRM_EXTRACTOR_GUIDANCE_MERGEABLE_ROADS
|
||
|
||
#include "extractor/compressed_edge_container.hpp"
|
||
#include "extractor/intersection/coordinate_extractor.hpp"
|
||
#include "extractor/intersection/have_identical_names.hpp"
|
||
#include "extractor/name_table.hpp"
|
||
#include "extractor/node_restriction_map.hpp"
|
||
#include "extractor/turn_lane_types.hpp"
|
||
|
||
#include "guidance/intersection.hpp"
|
||
|
||
#include "util/coordinate.hpp"
|
||
#include "util/node_based_graph.hpp"
|
||
#include "util/typedefs.hpp"
|
||
|
||
#include <cstdint>
|
||
#include <functional>
|
||
#include <limits>
|
||
#include <unordered_set>
|
||
#include <vector>
|
||
|
||
namespace osrm
|
||
{
|
||
|
||
// FWD declarations
|
||
namespace util
|
||
{
|
||
class NameTable;
|
||
} // namespace util
|
||
|
||
namespace extractor
|
||
{
|
||
|
||
class SuffixTable;
|
||
|
||
namespace intersection
|
||
{
|
||
class IntersectionGenerator;
|
||
class CoordinateExtractor;
|
||
|
||
class MergableRoadDetector
|
||
{
|
||
public:
|
||
// in case we have to change the mode we are operating on
|
||
using MergableRoadData = IntersectionEdgeGeometry;
|
||
|
||
MergableRoadDetector(const util::NodeBasedDynamicGraph &node_based_graph,
|
||
const EdgeBasedNodeDataContainer &node_data_container,
|
||
const std::vector<util::Coordinate> &node_coordinates,
|
||
const extractor::CompressedEdgeContainer &compressed_geometries,
|
||
const RestrictionMap &node_restriction_map,
|
||
const std::unordered_set<NodeID> &barrier_nodes,
|
||
const TurnLanesIndexedArray &turn_lanes_data,
|
||
const extractor::NameTable &name_table,
|
||
const SuffixTable &street_name_suffix_table);
|
||
|
||
// OSM ways tend to be modelled as separate ways for different directions. This is often due to
|
||
// small gras strips in the middle between the two directions or due to pedestrian islands at
|
||
// intersections.
|
||
//
|
||
// To reduce unnecessary information due to these artificial intersections (which are not
|
||
// actually perceived as such) we try and merge these for our internal representation to both
|
||
// get better perceived turn angles and get a better reprsentation of our intersections in
|
||
// general.
|
||
//
|
||
// i h i,h
|
||
// | | |
|
||
// | | |
|
||
// b - - - v - - - g |
|
||
// > a < is transformed into: b,c - - - a - - - g,f
|
||
// c - - - ^ - - - f |
|
||
// | | |
|
||
// | | |
|
||
// d e d,e
|
||
bool CanMergeRoad(const NodeID intersection_node,
|
||
const MergableRoadData &lhs,
|
||
const MergableRoadData &rhs) const;
|
||
|
||
// check if a road cannot influence the merging of the other. This is necessary to prevent
|
||
// situations with more than two roads that could participate in a merge
|
||
bool IsDistinctFrom(const MergableRoadData &lhs, const MergableRoadData &rhs) const;
|
||
|
||
private:
|
||
// When it comes to merging roads, we need to find out if two ways actually represent the
|
||
// same road. This check tries to identify roads which are the same road in opposite directions
|
||
bool EdgeDataSupportsMerge(const NodeBasedEdgeClassification &lhs_flags,
|
||
const NodeBasedEdgeClassification &rhs_flags,
|
||
const NodeBasedEdgeAnnotation &lhs_edge_annotation,
|
||
const NodeBasedEdgeAnnotation &rhs_edge_annotation) const;
|
||
|
||
// Detect traffic loops.
|
||
// Since OSRM cannot handle loop edges, we cannot directly see a connection between a node and
|
||
// itself. We need to skip at least a single node in between.
|
||
bool IsTrafficLoop(const NodeID intersection_node, const MergableRoadData &road) const;
|
||
|
||
// Detector to check if we are looking at roads splitting up just prior to entering an
|
||
// intersection:
|
||
//
|
||
// c
|
||
// / |
|
||
// a -< |
|
||
// \ |
|
||
// b
|
||
//
|
||
// A common scheme in OSRM is that roads spit up in separate ways when approaching an
|
||
// intersection. This detector tries to detect these narrow triangles which usually just offer a
|
||
// small island for pedestrians in the middle.
|
||
bool IsNarrowTriangle(const NodeID intersection_node,
|
||
const MergableRoadData &lhs,
|
||
const MergableRoadData &rhs) const;
|
||
|
||
// Detector to check for whether two roads are following the same direction.
|
||
// If roads don't end up right at a connected intersection, we could look at a situation like
|
||
//
|
||
// __________________________
|
||
// /
|
||
// ---
|
||
// \__________________________
|
||
//
|
||
// This detector tries to find out about whether two roads are parallel after the separation
|
||
bool HaveSameDirection(const NodeID intersection_node,
|
||
const MergableRoadData &lhs,
|
||
const MergableRoadData &rhs) const;
|
||
|
||
// Detector for small traffic islands. If a road is splitting up, just to connect again later,
|
||
// we don't wan't to have this information within our list of intersections/possible turn
|
||
// locations.
|
||
//
|
||
// ___________
|
||
// ---<___________>-----
|
||
//
|
||
//
|
||
// Would feel just like a single straight road to a driver and should be represented as such in
|
||
// our engine
|
||
bool IsTrafficIsland(const NodeID intersection_node,
|
||
const MergableRoadData &lhs,
|
||
const MergableRoadData &rhs) const;
|
||
|
||
// A negative detector, preventing a merge, trying to detect link roads between two main roads.
|
||
//
|
||
// d - - - - - - - - e - f
|
||
// . / '
|
||
// a - - - b - - - - - - c
|
||
//
|
||
// The detector wants to prevent merges that are connected to `b-e`
|
||
bool IsLinkRoad(const NodeID intersection_node, const MergableRoadData &road) const;
|
||
|
||
// The condition suppresses roads merging for intersections like
|
||
// . .
|
||
// . .
|
||
// ---- ----
|
||
// . .
|
||
// . .
|
||
// but will allow roads merging for intersections like
|
||
// -------
|
||
// / \
|
||
// ---- ----
|
||
// \ /
|
||
// -------
|
||
bool IsCircularShape(const NodeID intersection_node,
|
||
const MergableRoadData &lhs,
|
||
const MergableRoadData &rhs) const;
|
||
|
||
const util::NodeBasedDynamicGraph &node_based_graph;
|
||
const EdgeBasedNodeDataContainer &node_data_container;
|
||
const std::vector<util::Coordinate> &node_coordinates;
|
||
const extractor::CompressedEdgeContainer &compressed_geometries;
|
||
const RestrictionMap &node_restriction_map;
|
||
const std::unordered_set<NodeID> &barrier_nodes;
|
||
const TurnLanesIndexedArray &turn_lanes_data;
|
||
|
||
// name detection
|
||
const extractor::NameTable &name_table;
|
||
const SuffixTable &street_name_suffix_table;
|
||
|
||
const CoordinateExtractor coordinate_extractor;
|
||
|
||
// limit for detecting circles / parallel roads
|
||
const static double constexpr distance_to_extract = 120;
|
||
};
|
||
|
||
} // namespace intersection
|
||
} // namespace extractor
|
||
} // namespace osrm
|
||
|
||
#endif
|