Glossary¶

General¶

farthest navigation route¶

The farthest route is a valid navigation route with its last sampling point index as high as possible.

route¶

A route usually is the result of a map matching process and is snapped to the geometry of the streets on a street map.

sampling point¶

A track point, which at least has one candidate on a street segment.

sampling point candidate¶

A track point projected on a street segment. The projection has to meet specific requirements in order to be considered a candidate.

Candidates are ordered according to several criteria (see Candidate search).

street graph¶

A simple directed graph representing the street map. The nodes and edges of the street graph are tightly coupled to the street map data. Makes the street map applicable to routing algorithms.

street map¶

Refers to a data source with street map data or to the map itself as described by the data. A street map consist at least of a set of street segment geometries, connected by node points.

street segment¶

A minimal street segment without intersections (nodes) inbetween. May consist of more than two point. The corresponding linestring of the street map may have been cutted to satisfy this requirement.

track¶

Refers to a data source with track data or to the track itself as described by the data. A track consists at least of an ordered list of geo points (track points). The track might consist of additional data like velocity, heading, timestamp etc.

valid navigation route¶

A valid navigation route is a consecutive route which you could navigate.

Currently the following constraints are considered:

Allowed travel direction
Existing street intersections
Self intersections (optional)
Velocity difference (optional; for street matching)
Angular deviation (optional; for street matching)

Glossary¶

General¶

Operational data details¶