| 摘要 |
PROBLEM TO BE SOLVED: To make it possible to easily understand the correspondent relation between sets of link string data varying in the scale factors of maps, to enhance the reliability of data processing and to shorten the data processing time by providing a link of lower level of a large scale factor with a specific link identification information. SOLUTION: Only the min. necessary information, such as link number, is stored in the storage region of the data for route searching relating to a route for connecting its own node and an adjacent node N1. On the other hand, the route shape data K corresponding to the link number is stored in the storage region of the data for route display of the same level (the same scale factor). The road shape data K1 to K3 corresponding to the link number are stored in the storage region of the data for route display of the lower level (large scale factor). The same link number (a) is imparted to the three links of the lower level. The data for route display detects the route with the link number in the data for route searching as a clue and, therefore, data quantity of the data for route searching smaller than the conventional data for route searching is necessitated. |
