Map database apparatus
First Claim
Patent Images
1. A map database apparatus, in which:
- a road is represented as a link string in which a plurality of links, each of which has nodes at both ends thereof, are connected; and
a plurality of link string data, each of which includes node information relating to said node and is respectively provided for each of plural levels which correspond to different scale maps with regard to an identical link string, are stored, wherein;
a link of a lower level which has a larger scale, said link being common to a link of an upper level which has a smaller scale, has a link identifying data which is different from information that identifies said node, and is common to a link identifying data of said common link of said upper level.
2 Assignments
0 Petitions
Accused Products
Abstract
The present invention is applied to a map database apparatus, where: a road is represented as a link string in which a plurality of links, each of which has nodes at both ends thereof, are connected; and a plurality of link string data, each of which includes node information relating to the node and is respectively provided for each of levels which correspond to different scale maps with regard to an identical link string, are stored. And a link of a lower level which has a larger scale, the link being common to a link of a upper level which has a smaller scale, has a link identifying data which is common to a link identifying data of the common link of the upper level.
38 Citations
6 Claims
-
1. A map database apparatus, in which:
- a road is represented as a link string in which a plurality of links, each of which has nodes at both ends thereof, are connected; and
a plurality of link string data, each of which includes node information relating to said node and is respectively provided for each of plural levels which correspond to different scale maps with regard to an identical link string, are stored, wherein;a link of a lower level which has a larger scale, said link being common to a link of an upper level which has a smaller scale, has a link identifying data which is different from information that identifies said node, and is common to a link identifying data of said common link of said upper level. - View Dependent Claims (2, 3, 4, 5, 6)
- a road is represented as a link string in which a plurality of links, each of which has nodes at both ends thereof, are connected; and
Specification