location reference extension

additional point or set of points, not belonging to the location reference core, available in a location reference under special conditions

additional point or set of points, not belonging to the location reference core, available in a location reference under special conditions

location reference, reference

data set assigned to a location
NOTE 1 to entry: A reference unambiguously defines one location in the location referencing system. The reference is the set of data which is passed between different implementations using the same location referencing

data set assigned to a location
NOTE 1 to entry: A reference unambiguously defines one location in the location referencing system. The reference is the set of data which is passed between different implementations using the same location referencing

location referencing method (LRM)

methodology of assigning location references to locations

methodology of assigning location references to locations

location referencing system (LRS)

complete system by which location references are generated, according to a location referencing method, and communicated, including standards, definitions, software, hardware, and databases

complete system by which location references are generated, according to a location referencing method, and communicated, including standards, definitions, software, hardware, and databases

LDO

Logical Data Organization

logical unit

collection of data that may be regarded as a logically undivided whole
EXAMPLE: One logical record.

collection of data that may be regarded as a logically undivided whole
EXAMPLE: One logical record.

loop

edge which is bounded at both ends by one and the same node

edge which is bounded at both ends by one and the same node

magnetic declination

angle between Magnetic North and True North

angle between Magnetic North and True North

manoeuvre (Network Restriction MODEL)

a specification of impossible move for a certain type of vehicle. It specifies from which INFRASTRUCTURE LINK to which other (adjacent) INFRASTRUCTURE LINK a certain VEHICLE TYPE cannot proceed, due to physical restrictions

a specification of impossible move for a certain type of vehicle. It specifies from which INFRASTRUCTURE LINK to which other (adjacent) INFRASTRUCTURE LINK a certain VEHICLE TYPE cannot proceed, due to physical restrictions

Map Data Background

data model entity that provides map database features for background display

data model entity that provides map database features for background display

map display (MD)

application category that deals with graphical information presentation
NOTE: Map display is one of the six application categories supported by the API.

application category that deals with graphical information presentation
NOTE: Map display is one of the six application categories supported by the API.

map projection

transformation method used to represent the curved earth surface on a plane

transformation method used to represent the curved earth surface on a plane

map provision system; ITS map provision system

support system that provides map databases used to support ITS services

support system that provides map databases used to support ITS services

matching

translating a location reference to a specific object in a given map database to attempt recognition of the same identified object in both the sender’s and the receiver’s map database
NOTE 1 to entry: Matching is seen as a subsequent part to the method of decoding a location reference adhering to the defined LRM.

translating a location reference to a specific object in a given map database to attempt recognition of the same identified object in both the sender’s and the receiver’s map database
NOTE 1 to entry: Matching is seen as a subsequent part to the method of decoding a location reference adhering to the defined LRM.

medium unit

object for data storage that can be considered as a physically undivided whole
EXAMPLE: One floppy disk, one magnetic tape, a CD, or a DVD.

object for data storage that can be considered as a physically undivided whole
EXAMPLE: One floppy disk, one magnetic tape, a CD, or a DVD.

multi-modal travel service

application category that provides information on a trip from an origin to a destination using alternative modes of transportation or a combination of transport modes for one trip
NOTE 1 to entry: This service may include navigation.

application category that provides information on a trip from an origin to a destination using alternative modes of transportation or a combination of transport modes for one trip
NOTE 1 to entry: This service may include navigation.

multi-modal travel support

application function for Multi-Modal Travel Service

application function for Multi-Modal Travel Service

multi-mode route guidance

multi-mode route guidance provides route guidance under the combined operation of the Interactive CDRG, LDRG and SRG systems

multi-mode route guidance provides route guidance under the combined operation of the Interactive CDRG, LDRG and SRG systems

multilink

ordered aggregation of links which are at the same level, connected in sequence, share the same functional classification, form of way, direction of travel, and perhaps additional PSF-builder-specified characteristics, such that each link is contained in exactly one Multilink

ordered aggregation of links which are at the same level, connected in sequence, share the same functional classification, form of way, direction of travel, and perhaps additional PSF-builder-specified characteristics, such that each link is contained in exactly one Multilink

navigable feature name

data model entity that represents the name for the transportation element, including GDF road element, GDF ferry connection, GDF junction, GDF intersection
NOTE: Navigable feature name is related to places, crossroads, junctions, and road sections.

data model entity that represents the name for the transportation element, including GDF road element, GDF ferry connection, GDF junction, GDF intersection
NOTE: Navigable feature name is related to places, crossroads, junctions, and road sections.

navigation service

next point

point that is directly (topologically) connected to a given point, in a direction that is defined by the defined direction of the location
NOTE 1 to entry: A point can have zero or more next points.

point that is directly (topologically) connected to a given point, in a direction that is defined by the defined direction of the location
NOTE 1 to entry: A point can have zero or more next points.

next point relation

ordered pair of points (A, B) for which a direct connection exists from A to B along the path of the referenced location
NOTE 1 to entry: In the road network, a direct connection between points A and B exists when point B can be reached from point A via part of the road network, without visiting intermediate points in the location reference.
This excludes points connected in a GDF graph…

ordered pair of points (A, B) for which a direct connection exists from A to B along the path of the referenced location
NOTE 1 to entry: In the road network, a direct connection between points A and B exists when point B can be reached from point A via part of the road network, without visiting intermediate points in the location reference.
This excludes points connected in a GDF graph via a node representing an intersection-not-at-grade. Such points are not considered to be directly connected.

node

zero-dimensional element that is a topological junction of two or more edges, or an end point of an edge
NOTE: A node is created for topologically significant points, such as simple intersections of roads or other linear features including boundaries but also for locations such as electric beacons, kilometre-posts or sensors detecting traffic flows, being significant points specified in a map.

zero-dimensional element that is a topological junction of two or more edges, or an end point of an edge
NOTE: A node is created for topologically significant points, such as simple intersections of roads or other linear features including boundaries but also for locations such as electric beacons, kilometre-posts or sensors detecting traffic flows, being significant points specified in a map.

node identifier

identifier assigned to a node
NOTE 1 to entry: A node identifier can be arbitrary, or can be assigned by convention, to ensure that multiple occurrences of the same identifier will not occur within one network or within the universe of similar networks or databases.

identifier assigned to a node
NOTE 1 to entry: A node identifier can be arbitrary, or can be assigned by convention, to ensure that multiple occurrences of the same identifier will not occur within one network or within the universe of similar networks or databases.

offset

pair of values subtracted from all coordinate values in order to shorten these coordinate values

pair of values subtracted from all coordinate values in order to shorten these coordinate values

outlined area

explicit area with an outline defined by segments being either polylines or linear locations

explicit area with an outline defined by segments being either polylines or linear locations

parallel carriageway indicator (PCI)

non-negative integer which indicates if a road segment contains more than one carriageway in parallel in the direction of interest, and how many

non-negative integer which indicates if a road segment contains more than one carriageway in parallel in the direction of interest, and how many

parcel

database partitioning unit, corresponding to a certain coverage area and associated with one level and containing data of one or more layers
NOTE 1 to entry: A parcel contains (at least) all nodes with positions enclosed by or located on the outline of its coverage area plus (parts of) all links attached to these nodes.
NOTE 2 to entry: It can be partitioned such that the amount of data…

database partitioning unit, corresponding to a certain coverage area and associated with one level and containing data of one or more layers
NOTE 1 to entry: A parcel contains (at least) all nodes with positions enclosed by or located on the outline of its coverage area plus (parts of) all links attached to these nodes.
NOTE 2 to entry: It can be partitioned such that the amount of data of one parcel is nearly the same as that of another.

path

finite, alternating sequence of nodes and edges, such that every arc is immediately preceded and succeeded by the two vertices with which it is incident and in which no vertex is repeated, except (possibly) the first and the last one

finite, alternating sequence of nodes and edges, such that every arc is immediately preceded and succeeded by the two vertices with which it is incident and in which no vertex is repeated, except (possibly) the first and the last one