Patent US6023655A successfully refreshed from Google Patents.
← Back to Patent Explorer
US6023655A Expired / Lapsed US ⏱️ 0.0 years remaining

Map database apparatus

Assignee: Faurecia Clarion Electronics Co Ltd
•
Filing: 1999-06-16
•
Granted: 2000-02-08
•
Expires: 2019-06-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a map database apparatus in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to the M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level: correspondence information between nodes at different levels when the low order level is viewed from the high order level is provided as level correspondence data that express corresponding relationships between roadmap data at the high order level at the small scale and roadmap data at the low order level at the large scale.

Inventors

  • 👤 Takashi Nomura

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 23:31
CPC Classifications
G; G09; G09B; G09B29/00; G09B29/10; G09B29/106; G01; G01C; G01C21/00; G01C21/38; G01C21/3863; G01C21/387; G01C21/3878

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 187 words
A map database apparatus in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.
Claim 2
Dependent Claim 187 words
A map database apparatus in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.
Claim 3
Dependent Claim 88 words
A map database apparatus according to claim 1, wherein: said level correspondence data is information in which 1) a number assigned to a high order node at said high order level, 2) a number assigned to a low order node at a low order level corresponding to said high order node, and 3) a number of said small area at said low order level where said low order node is present are provided so as to correspond with one another, at each level excluding a lowest order level.
Claim 4
Dependent Claim 51 words
A map database apparatus according to claim 1, wherein: said level correspondence data at each level are sorted in an order of numbers assigned to said small areas that contains said high order level node and also in an order of numbers assigned to nodes contained in a single small area.
Claim 5
Dependent Claim 80 words
A map database apparatus according to claim 1, wherein: said level correspondence data are route search data that are provided with a number assigned to a high order adjacent node that is adjacent to a current node at a high order level and a number assigned to a low order adjacent node that is adjacent to said current node at a low order level corresponding to said current node at said high order level made to correspond with each other.
Claim 6
Dependent Claim 88 words
A map database apparatus according to claim 1, wherein: said level correspondence data is information in which 1) an identification assigned to a high order node at said high order level, 2) an identification assigned to a low order node at a low order level corresponding to said high order node, and 3) an identification of said small area at said low order level where said low order node is present are provided so as to correspond with one another, at each level excluding a lowest order level.
Claim 7
Dependent Claim 40 words
A map database apparatus according to claim 2, wherein: said number of said small area at the low order level is a relative number of small area referring to said map area at the high order level as a reference.
Claim 8
Dependent Claim 48 words
A map database apparatus according to claim 2, wherein: a numbering system of said small areas at said low order level is a system so that a number of said map area at the high order level can be specified based upon said number of said small area.
Claim 9
Dependent Claim 48 words
A map database apparatus according to claim 5, wherein: an identification system of said small areas at said low order level is a system so that an identification of said map area at the high order level can be specified based upon said identification of said small area.
Claim 10
Dependent Claim 260 words
A map database apparatus in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: 1) a number assigned to a high order current node at said high order level and a number assigned to a low order current node at said low order level corresponding to said high order current node, made to correspond with each other; and 2) a number assigned to a high order adjacent node connected to said high order current node and a number assigned to a low order adjacent node connected to said low order current node, made to correspond with each other; are provided as level correspondence data that indicate corresponding relationships between roadmap data at said high order level at a small scale and roadmap data at said low order level at a large scale, for each level excluding a lowest order level.
Claim 11
Dependent Claim 260 words
A map database apparatus in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: 1) a number assigned to a high order current node at said high order level and a number assigned to a low order current node at said low order level corresponding to said high order current node, made to correspond with each other; and 2) a number assigned to a high order adjacent node connected to said high order current node and a number assigned to a low order adjacent node connected to said low order current node, made to correspond with each other; are provided as level correspondence data that indicate corresponding relationships between roadmap data at said high order level at a small scale and roadmap data at said low order level at a large scale, for each level excluding a lowest order level.
Claim 12
Dependent Claim 51 words
A map database apparatus according to claim 5, wherein: said level correspondence data at each level are sorted in an order of numbers assigned to said small areas that contains said high order level node and also in an order of numbers assigned to nodes contained in a single small area.
Claim 13
Dependent Claim 189 words
A recording medium recording map database in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.
Claim 14
Dependent Claim 189 words
A recording medium recording map database in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level, wherein: correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.
Claim 15
Dependent Claim 227 words
A navigation apparatus, comprising: a map database device in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level; and a control device that performs route searching and controls a monitor to display a road map and a result of route searching by using database in said map database device, wherein: in said map database device, correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.
Claim 16
Dependent Claim 227 words
A navigation apparatus, comprising: a map database device in which a road is expressed by using a plurality of sets of data related to links each of which links has nodes at a front end and at a rear end, data related to a plurality of links provided separately for maps at different scales are respectively stored as roadmap data from a highest order level at a smallest scale through a lowest order level at a largest scale, a map area at a high order level is divided into a plurality of M small areas, each of sets of detail information corresponding to said M small areas is stored as a set of roadmap data of a map area at a low order level, and M sets of roadmap data are stored at the low order level; and a control device that performs route searching and controls a monitor to display a road map and a result of route searching by using database in said map database device, wherein: in said map database device, correspondence information between nodes at different levels when said low order level is viewed from said high order level is provided as level correspondence data that express corresponding relationships between roadmap data at said high order level at the small scale and roadmap data at said low order level at the large scale.

References Cited (Backward Citations)

US5161886A Cited
US5161886C1 Cited
US5036471A Cited
US5204817A Cited
US5410485A Cited
US5523765A Cited
US5513110A Cited
JPH0737073A Cited
JPH0798799A Cited
JPH07243859A Cited
JPH08327386A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-02-07 2003-08-09 2004-02-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-02-07 2007-08-09 2008-02-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-02-07 2011-08-09 2012-02-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag