GROUPING THE NODES OF A DIGITAL ROAD MAP FOR MATCHING A ROUGH NETWORK

Manually made networks often do not have accurate coordinates. However, the need to obtain accurate coordinates has increased in recent years to integrate with other data. We are studying network matching of a manually made traffic assignment network with a digital road map (DRM) to adjust its coordinates. However, since their levels of detail largely differ, we need to generate suitable node groups in such detailed DRM as the matching counterparts of the nodes in such rough manual network before performing the actual matching. The objective of this paper is to report a method for grouping the nodes of a DRM. Since there are a lot of possible combinations, the method generates various groups for each node in question that are possible to be grouped. The realistic limit of the grouping range can be determined as a trade-off between recall and efficiency.