WO2008119585A2 - VERFAHREN ZUM ERSTELLEN EINES VERZEICHNISSES VON STRAßENABSCHNITTEN, VERFAHREN ZUM ERMITTELN ALLER STRAßENABSCHNITTE INNERHALB EINES SUCHGEBIETS UND COMPUTERPROGRAMM - Google Patents
VERFAHREN ZUM ERSTELLEN EINES VERZEICHNISSES VON STRAßENABSCHNITTEN, VERFAHREN ZUM ERMITTELN ALLER STRAßENABSCHNITTE INNERHALB EINES SUCHGEBIETS UND COMPUTERPROGRAMM Download PDFInfo
- Publication number
- WO2008119585A2 WO2008119585A2 PCT/EP2008/051532 EP2008051532W WO2008119585A2 WO 2008119585 A2 WO2008119585 A2 WO 2008119585A2 EP 2008051532 W EP2008051532 W EP 2008051532W WO 2008119585 A2 WO2008119585 A2 WO 2008119585A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- road
- road section
- sub
- levels
- search
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
- G01C21/3863—Structures of map data
- G01C21/387—Organisation of map data, e.g. version management or database structures
- G01C21/3874—Structures specially adapted for data searching and retrieval
Definitions
- a method for creating a directory of road sections methods for determining all road sections within a search area and computer program
- the invention relates to a method for creating a directory of road sections of a digital road map for a navigation system.
- the invention further relates to a method for determining all road sections within a search area.
- the invention further relates to a computer program for carrying out a method for creating a directory of road sections and a method for determining all road sections within a search area.
- Navigation systems for vehicles require a digital map of the road network for the basic functions of location, destination selection, route calculation and route guidance.
- This digital road map is usually on a digital storage medium, such as a CD, DVD or SD card.
- the data representing the digital road map is uninhabited in files. The data is present in a linear sequence in the file.
- the navigation system needs this data, for example, to display the map of a road network on a screen or to project the current position on a nearest road of the road network.
- the current position can be determined, for example, by means of GPS (Global Positioning System) or Galileo and / or further inertial sensors, such as, for example, odometers, yaw rate sensors or accelerometers.
- GPS Global Positioning System
- Galileo Galileo
- further inertial sensors such as, for example, odometers, yaw rate sensors or accelerometers.
- large parts of the entire road network stored on the storage medium play no or only a minor role. For example, a specific destination route may be limited to a regional area even though the road network of an entire country is stored. It is also conceivable that the user an enlarged section of his current
- the roads contained in the digital road maps are structured.
- cluster It is known to combine adjacent streets in an information unit, a so-called cluster. In doing so, it orients itself to urban areas, city boundaries, county boundaries or similar geographical boundaries. Neighboring clusters are grouped into hierarchically higher clusters. This process continues for higher levels. The result is a relatively well-balanced, hierarchical tree. So that the tree does not become too large, roads are laid down linearly in geometric sorting on the lowest level. Typical numbers at this level are about 1000 streets.
- the digitized road network is covered with a uniform grid, for example, from a variety of equal size
- Rectangles the so-called tiles. All roads that lie in a tile are stored together. An index is created on the storage medium, which assigns geographic coordinates to the tiles so that the index can be accessed quickly from a coordinate on the tile.
- the Tiles are very differently covered with streets; some tiles have a lot of streets, others have little or no roads. This makes the storage ineffective and the time required for a search very dependent on the location of the search area.
- the invention therefore provides a method according to claim 1.
- the road sections are arranged in an ordered N-tree without the additional structural information required in the prior art being required.
- the method according to the invention uses in each case a road section of the road map as the starting point for the division of the road map, ie as "spatial divider" of the road map Shapepoints are already available in the map, there is no need for additional data for the division of the road map, which reduces the required storage space and relieves the search in the tree according to the invention to consider additional information, such as the POI, for a given search time.
- the method according to the invention can be applied to an entire road map as well as in combination with an already known method.
- the method according to the invention is advantageously used at the lowest level, where a plurality of roads, typically the
- the search at this level can be limited from the search of the approximately 1000 streets to the search of approximately 10 to 20 streets, whereby a considerable saving of time is achieved.
- the tree according to the invention is compatible with the previously used data structures.
- the list of road sections is arranged in this case in a tri-tree.
- Each road section divides the road maps into three sub-levels.
- the three sub-levels can be arranged as follows:
- a straight line is defined by the start and end points of a road segment. Then two are parallel to this first straight line
- N 5
- the list of road sections is structured in this case a so-called 5-tree.
- the five sub-levels can be arranged as follows:
- a rectangle is placed over the considered road section.
- the start and end points of the road section may form the endpoints of a diagonal of the rectangle, and the rectangle may be chosen to be large enough to have all shapepoints within the rectangle. It may be advisable to choose the rectangle as small as possible.
- the sides of the rectangle are supplemented to half-lines, each with the same mathematical sense of direction, for example clockwise or in the Counterclockwise, have.
- the rectangle and the four half-lines clearly partition the road map into five sub-levels.
- the sub-levels can be described as "left", "center” (rectangle), "right”, “before” and “afterwards”.
- the search within the inventively generated N-tree can be performed very quickly if pointers are stored in each node to directly following nodes. In this way, the addresses of the direct successors are immediately available in each node, so that it is possible to enter a sub-tree of the node without a time delay.
- the search duration for a road section is proportional to the number of road sections stored in the list in a conventional linear list.
- the search time increases only with log (N) when N is the number of road sections stored in the N-tree or the node of the N-tree. Especially with a large number of stored road sections, the advantage of the method according to the invention is clearly evident.
- the N-tree is expediently generated offline. Thus, a lot of time can be invested in the balance of the N-tree, which can significantly reduce the search time online, that is in a navigation system.
- the inventive method for determining all road sections within a search area is characterized by a rectangular search area.
- a rectangular search area needs very little data to uniquely define it.
- it is very easy to process, which reduces the search time compared to more complicated geometric search areas.
- FIG. 1 shows a detail of a first digital road map
- FIG. 2 shows a detail of a second digital road map
- FIG. 1 shows a section of a first digital road map 1.
- the digital road map 1 contains a road section 2.
- the road section 2 has a starting point 3a, subsequently two shapepoints 3b, 3c and one
- the road section 2 stores the geographical coordinates such as the longitude and the latitude. Other information may be stored, such as altitude above
- the road section 2 is assigned an orientation.
- the orientation is indicated by the arrow 4, which is directed from the starting point 3 a to the end point 3d.
- FIG 1 two mutually parallel straight lines 5a, 5b are shown.
- the two straight lines 5a, 5b include a middle part plane 6a between them.
- the road section 2 runs completely in the middle part plane 6a.
- a left part plane 6b is located to the left of the road section 2 or the middle part plane 6a.
- a right part plane 6c lies to the right of the road section 2 or the middle part plane 6a. This oriented at the Orientierang of the road section 2 arrangement of the sub-levels 6a, 6b, 6c is unique.
- the three sub-levels 6a, 6b, 6c form a clear decomposition and thus one
- FIG. 2 shows the decomposition of a second digital road map 7 by a road section 8 in 5 sub-levels 9a, 9b, 9c, 9d, 9e.
- the orientation of the road section 8 is represented by an arrow 10.
- the road section 8 has a starting point I Ia, an end point I Ib and two shapepoints 11c, Hd.
- the entire road section with start, end and shapepoints I Ia, I Ib, 11c, Hd lies within a rectangle that represents one of the sub-levels 9a, 9b, 9c, 9d, 9e.
- the sides of the rectangle have been supplemented to four half-lines 12a, 12b, 12c, 12d. Addition of sides of a rectangle to half-lines
- the digital road map 7 is divided into the 5 sub-levels 9a, 9b, 9c, 9d, 9e.
- the sub-levels 9a, 9b, 9c, 9d, 9e can be in the
- FIG. 3 shows a section of a third digital road map 13.
- the digital road map 13 includes 10 road sections 14 a to j whose orientation is indicated by an arrow 15, respectively.
- the arrow 15 is shown only for the road section 14f.
- a search area 16 is shown in FIG. The search area 16 at least partially detects the road sections 14a, 14b, 14c.
- the directory will receive the structure of a tri-tree 17 as shown in FIG.
- the road map 13 is partitioned into three sub-levels, of which exactly one contains the road section 14e.
- the sub-levels are arranged depending on the orientation of the road section 14e to each other. All other road sections 14a to d can be exactly one of the sub-levels and thus one
- the left part level is split further. This will be one of
- Road sections 14a to d which lie in this sub-level selected. In this example, this is the road section 14c.
- the road section 14c divides the left sub-level now again in three sub-levels, one of which is on the left with respect to the orientation of the road 14c, another in the
- the not yet selected road sections 14a, b, d are now assigned to these sub-levels.
- the road section 14a lies in the left partial plane of the road section 14c, the middle part plane is empty and in the right part plane are the
- the road section 14d is selected as the next node. Now only the road section 14b remains. This is relative to the road section 14d in the left part plane. There are no road sections in the middle and right part levels. Thus, with respect to the road section 14e, the root of the tri-tree, all road sections 14a to d are inserted in the left sub-tree.
- Tree 17 and the search area 16 explained.
- the entry for the search in the tri-tree 17 is always about the root, in this case
- the search area 16 is completely in the left
- a subtree 18 is now to be determined, which is assigned to the left partial plane.
- the subtree 18 includes the road sections 14a to d.
- Subtree 18 is noted after method step i).
- process steps b) to i) are to be repeated, wherein the selection is limited to the subtrees noted in step i) until all the noted subtrees have been selected exactly once.
- the root node of this subtree 18 is the node with the road section 14c.
- the search area 16 is both in the left, right and middle part levels. After method step f), the road section 14c comes into consideration as a possible search result and is noted.
- subtrees 19a, b are attached to the node of the road section 14c.
- the one subtree 19a consists only of the node with the
- the second sub-tree 19b consists of the nodes to the road sections 14d as the root node of this sub-tree 19b and the road section 14b.
- the search area 16 is located in both the left, right, and middle parts planes. Since the node to the road section 14a is a leaf of the tri-tree 17, no further subtrees need to be noted. Only the road section 14a is to be noted as a possible search result.
- the examination of the subtree with the road section 14d as the root causes the search area 16 to lie completely in the left partial plane.
- the road section 14b is obtained.
- the search area 16 lies in the middle part plane.
- the road section 14b comes as a search result in question and is noted.
- the road sections 14a, b, c are eliminated, those with which the search area 16 actually has no overlap. It is present no road section
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Automation & Control Theory (AREA)
- Mathematical Physics (AREA)
- Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Educational Technology (AREA)
- Databases & Information Systems (AREA)
- Navigation (AREA)
- Instructional Devices (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/305,542 US9214097B2 (en) | 2007-04-03 | 2008-02-08 | Method for creating a directory of road sections, method for ascertaining all road sections within a search area, and computer program |
JP2010501454A JP2010523951A (ja) | 2007-04-03 | 2008-02-08 | 道路セグメントのディレクトリの作成方法、探索領域内のすべての道路セグメントの検出方法、およびコンピュータプログラム |
EP08716773A EP2143096A1 (de) | 2007-04-03 | 2008-02-08 | VERFAHREN ZUM ERSTELLEN EINES VERZEICHNISSES VON STRAßENABSCHNITTEN, VERFAHREN ZUM ERMITTELN ALLER STRAßENABSCHNITTE INNERHALB EINES SUCHGEBIETS UND COMPUTERPROGRAMM |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102007016002.1 | 2007-04-03 | ||
DE102007016002A DE102007016002A1 (de) | 2007-04-03 | 2007-04-03 | Verfahren zum Erstellen eines Verzeichnisses von Straßenabschnitten, Verfahren zum Ermitteln aller Straßenabschnitte innerhalb eines Suchgebiets und Computerprogramm |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2008119585A2 true WO2008119585A2 (de) | 2008-10-09 |
Family
ID=39420829
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2008/051532 WO2008119585A2 (de) | 2007-04-03 | 2008-02-08 | VERFAHREN ZUM ERSTELLEN EINES VERZEICHNISSES VON STRAßENABSCHNITTEN, VERFAHREN ZUM ERMITTELN ALLER STRAßENABSCHNITTE INNERHALB EINES SUCHGEBIETS UND COMPUTERPROGRAMM |
Country Status (5)
Country | Link |
---|---|
US (1) | US9214097B2 (de) |
EP (1) | EP2143096A1 (de) |
JP (1) | JP2010523951A (de) |
DE (1) | DE102007016002A1 (de) |
WO (1) | WO2008119585A2 (de) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130132427A1 (en) * | 2009-05-15 | 2013-05-23 | Hyundai Motor Company | Apparatus for searching for information within space of interest |
US9002880B2 (en) * | 2009-05-15 | 2015-04-07 | Hyundai Motor Company | Apparatus for searching for information within space of interest |
CN109297480B (zh) * | 2017-07-24 | 2022-06-14 | 神州优车(平潭)电子商务有限公司 | 用于管理设备的位置的方法和系统 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
NL8802833A (nl) * | 1988-11-17 | 1990-06-18 | Koninkl Philips Electronics Nv | Werkwijze voor kavel-georienteerde route-planning, alsmede navigatiesysteem met een route-planner voor het uitvoeren van een dergelijke werkwijze. |
US5170353A (en) * | 1988-11-17 | 1992-12-08 | U.S. Philips Corporation | Bucket-oriented route planning method, and navigation system comprising a route planner for carrying out such a method |
JPH0472513A (ja) * | 1990-04-04 | 1992-03-06 | Sumitomo Electric Ind Ltd | 経路誘導装置 |
JP3223782B2 (ja) * | 1996-02-08 | 2001-10-29 | 三菱電機株式会社 | 車両経路算出装置 |
US6192314B1 (en) * | 1998-03-25 | 2001-02-20 | Navigation Technologies Corp. | Method and system for route calculation in a navigation application |
US7079946B2 (en) * | 2003-08-29 | 2006-07-18 | Denso Corporation | Iterative logical renewal of navigable map database |
-
2007
- 2007-04-03 DE DE102007016002A patent/DE102007016002A1/de not_active Ceased
-
2008
- 2008-02-08 WO PCT/EP2008/051532 patent/WO2008119585A2/de active Application Filing
- 2008-02-08 JP JP2010501454A patent/JP2010523951A/ja active Pending
- 2008-02-08 US US12/305,542 patent/US9214097B2/en not_active Expired - Fee Related
- 2008-02-08 EP EP08716773A patent/EP2143096A1/de not_active Ceased
Also Published As
Publication number | Publication date |
---|---|
US20090234877A1 (en) | 2009-09-17 |
US9214097B2 (en) | 2015-12-15 |
EP2143096A1 (de) | 2010-01-13 |
JP2010523951A (ja) | 2010-07-15 |
DE102007016002A1 (de) | 2008-10-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE69934301T2 (de) | Wegesuchsystem | |
DE69828339T2 (de) | Programm zum Erzeugen von Manövern | |
DE69736082T2 (de) | Vorrichtung und Verfahren zum Speichern von geographischen Daten auf einem physikalischen Speichermedium | |
DE102010040730B4 (de) | System und Verfahren für mehrfach aufgelöste Routenplanung | |
DE102006046969A1 (de) | Strassenkartendaten-Erzeugungsverfahren, Strassenkartendaten-Aktualisierungssystem und Strassenkartendaten-Verwaltungsvorrichtung | |
EP2507589B1 (de) | Verfahren zur vereinfachung einer beschreibung einer fahrtroute | |
EP2075781A1 (de) | Verfahren zur Erzeugung einer digitalen Landkarte | |
DE102009006183B4 (de) | Verfahren und System zum Anpassen von Routenplanungs-Ergebnissen | |
WO1998024079A1 (de) | Verfahren und endgerät zur räumlichen zuordnung von auf einen ort bezogenen informationen | |
DE10137632A1 (de) | Verfahren und System zum Auffinden eines Ortes in einer digitalen Karte | |
EP2143096A1 (de) | VERFAHREN ZUM ERSTELLEN EINES VERZEICHNISSES VON STRAßENABSCHNITTEN, VERFAHREN ZUM ERMITTELN ALLER STRAßENABSCHNITTE INNERHALB EINES SUCHGEBIETS UND COMPUTERPROGRAMM | |
EP2069719B1 (de) | Anzeigevorrichtung zur anzeige einer reiseroute | |
EP2997333B1 (de) | Verfahren zum betreiben eines navigationssystems, navigationssystem und kraftfahrzeug | |
DE112012005733B4 (de) | Kartendatenstruktur, Kartendatenerstellungsverfahren und Bordinformationsterminal | |
DE10033193A1 (de) | Verfahren und Anordnung zur Codierung, zur Decodierung und/oder zur Übertragung von Ortsinformationen | |
EP1837628A2 (de) | Verfahren zum Betrieb eines Navigationssystems | |
EP2100097B1 (de) | Navigationseinrichtung | |
DE102006013297B4 (de) | Verfahren zum Betrieb eines Navigationssystems | |
EP1979837B1 (de) | Verfahren zur ausgabe von datensätzen und vorrichtung hierfür | |
EP2401723A1 (de) | Verfahren, system und computerprogrammprodukt zur dreidimensionalen darstellung von gebäuden auf einer grafischen anzeigeeinrichtung einer navigationsvorrichtung | |
DE102005063013B4 (de) | Verfahren zur Darstellung einer Oberfläche und eine Vorrichtung hierfür | |
DE102019006103B4 (de) | Übertragen des Verlaufs einer Route | |
EP2194466A1 (de) | Verfahren und Vorrichtung zum Indexieren von Daten in einer Suchmaschine oder einer Datenbank für eine geschwindigkeitsoptimierte radiusabhängige Umkreissuche | |
DE102009027607A1 (de) | Verfahren zum Bestimmen und Speichern einer nicht digitalisierten Straße | |
DE102005012849A1 (de) | Verfahren und Vorrichtung zum Bereitstellen von Kartendaten |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
REEP | Request for entry into the european phase |
Ref document number: 2008716773 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008716773 Country of ref document: EP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 08716773 Country of ref document: EP Kind code of ref document: A2 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12305542 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 2010501454 Country of ref document: JP Kind code of ref document: A |