Matching Geo-Coded Graphs
Michael Balmer, Bernard, Michael, Kay Werner Axhausen · Repository for Publications and Research Data (ETH Zurich) · 2005
In transportation planning and modelling feasible transportation networks are crucial. To be useful, the networks have to fulfil certain requirements: first, the geographical locations of network elements (typically nodes and links) have to be accurate; second, the given attributes (i.e. number of lanes, length, allowed speed, and so on) of the network elements should hold correct information; and—particularly for traffic path finding algorithms—any given network should be constructed such, that every node is accessible by any other node via at least one path. Unfortunately, in practice there is no guarantee that these three requirements are fulfilled. At the same time often many different networks are available for the same geographical region. These networks often can differ in their emphasis, resulting in differences such as the resolution of the network, the correctness of the geographical locations and the correctness / completeness of the given attributes. To deal with this problem, one is required to match different networks of the same region so that attributes can be easily shared between the given networks. In this paper some approaches for network matching are described and compared. Unlike other approaches attributes of the nodes and links are not used as part of the matching algorithm, since they are unreliable. The problem is thus reduced to two directed graph with the addition of spatial information–a geo-coded digraph.