CN111143487A - Urban map data upgrading method, terminal equipment and storage medium - Google Patents
Urban map data upgrading method, terminal equipment and storage medium Download PDFInfo
- Publication number
- CN111143487A CN111143487A CN201811311640.9A CN201811311640A CN111143487A CN 111143487 A CN111143487 A CN 111143487A CN 201811311640 A CN201811311640 A CN 201811311640A CN 111143487 A CN111143487 A CN 111143487A
- Authority
- CN
- China
- Prior art keywords
- city
- data
- boundary
- road network
- unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004590 computer program Methods 0.000 claims description 16
- 238000010586 diagram Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000000243 solution Substances 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Abstract
The invention relates to a method for upgrading city map data, a terminal device and a storage medium, wherein the method comprises the following steps: s1: establishing city road network data files of each city by taking the city as a unit; s2: establishing a city boundary data index file, wherein the city boundary data index file comprises circumscribed rectangular coordinates and boundary coordinates of each city; s3: searching the corresponding external rectangles according to the external rectangle coordinates of each city in the city boundary data index file, and further searching the city according to the boundary coordinates of the city corresponding to the searched external rectangles; s4: judging whether the city road network data of the city is updated or not, and updating the city road network data of the city when the city road network data of the city is updated; s5: and obtaining road network data of the grid corresponding to the current position according to the city road network data file of the city. The invention can reduce the energy loss of invalid data in the upgrade of the map data.
Description
Technical Field
The invention relates to the technical field of map navigation, in particular to a method for upgrading urban map data, a terminal device and a storage medium.
Background
The traditional terminal navigation map data taking grids as basic units generally pack and integrate road networks and related attribute data of nationwide cities into a large file package, so that related road network data gridding retrieval is facilitated. One of the defects of the large file package is that the map data is difficult to upgrade, and a whole large file package needs to be updated at one time to update partial regional data. With the period of national infrastructure network construction quickening, the frequency of map data upgrading of partial areas is continuously improved, and the contradiction of map data updating is further aggravated.
Disclosure of Invention
In order to solve the problems, the invention provides an urban map data upgrading method, terminal equipment and a storage medium, so as to reduce energy loss of invalid data in map data upgrading.
The specific scheme is as follows:
a city map data upgrading method comprises the following steps:
s1: establishing city road network data files of each city by taking the city as a unit;
s2: establishing a city boundary data index file, wherein the city boundary data index file comprises circumscribed rectangular coordinates and boundary coordinates of each city;
s3: searching the corresponding external rectangles according to the external rectangle coordinates of each city in the city boundary data index file, and further searching the city according to the boundary coordinates of the city corresponding to the searched external rectangles;
s4: judging whether the city road network data of the city is updated or not, if so, updating the city road network data of the city, and entering S5, otherwise, directly entering S5;
s5: and obtaining road network data of the grid corresponding to the current position according to the city road network data file of the city.
Further, in step S1, the city road network data file includes two parts, that is, a file header unit and a grid data unit, where the file header unit is used to store offset addresses of all grid data covered by a city, and the grid data unit is used to store road network data corresponding to each road network grid.
Further, in step S2, the city boundary data index file specifically includes: including city number unit, city entry index unit and city data unit, city entry index unit includes a plurality of city index data package, and every city index data package all includes city name, city data index address and external rectangle coordinate, city data unit includes a plurality of city data, and every city data all includes the boundary coordinate of this city, city index data package in the city entry index unit and the city data one-to-one in the city data unit, city number is the figure of city index data package that contains in the city entry index unit.
Further, step S3 is specifically:
according to the circumscribed rectangle coordinates of each city in the city boundary data index file, finding the circumscribed rectangle where the current coordinates are located in a circulating traversal mode, and further finding the city name and the city data index address corresponding to the circumscribed rectangle;
and searching the boundary coordinate of the corresponding city data in the city data unit of the city boundary data index file according to the searched city data index address, judging the boundary coordinate of the current coordinate, and setting the city name corresponding to the boundary coordinate as the city of the current coordinate.
Further, the road network data includes a basic road network and attribute information data.
Further, the offset addresses of the grid data stored in the file header unit are stored in an array form, wherein the array size is the total number of grids contained in the circumscribed rectangle of the city, and the array content is the offset address of each grid data.
Further, the circumscribed rectangle is the smallest rectangle capable of containing the city.
A city map data upgrading terminal device comprises a processor, a memory and a computer program stored in the memory and running on the processor, wherein the processor executes the computer program to realize the steps of the method of the embodiment of the invention.
A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to an embodiment of the invention.
The invention adopts the technical scheme and has the beneficial effects that: the method is characterized in that a map data organization mode with cities as basic units is used for compiling and storing road network and attribute data, and the road network data is still cut and stored by taking grids as minimum units in a single city, so that a single large file package originally covering road network data across the whole country is split into hundreds of city data file packages, and when certain city data needs to be upgraded, only the city map data needs to be updated and replaced, so that an efficient gridding road network processing algorithm can be utilized, and the subsequent map data upgrading and updating are facilitated.
Drawings
Fig. 1 is a schematic diagram illustrating a first step of the embodiment of the present invention.
Fig. 2 is a schematic diagram showing a city bounding rectangle and a boundary in this embodiment.
Fig. 3 is a schematic diagram illustrating the position determination of the front position and the city boundary in this embodiment.
Detailed Description
To further illustrate the various embodiments, the invention provides the accompanying drawings. The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the embodiments. Those skilled in the art will appreciate still other possible embodiments and advantages of the present invention with reference to these figures.
The invention will now be further described with reference to the accompanying drawings and detailed description.
The first embodiment is as follows:
an embodiment of the present invention provides a method for upgrading city map data, as shown in fig. 1, including the following steps:
step 1: the method comprises the steps of setting city road network data files taking cities as units, and establishing city road network data files taking cities as units for each city, wherein in the embodiment, the city road network data files of all cities of the whole country, namely 300 direct prefectures and grade cities, are generated.
Each urban road network data file comprises a file header unit and a grid data unit:
the file header unit is configured to store offset addresses of all grid data covered by a city, and the grid data unit is configured to store road network data corresponding to each road network grid, where the road network data is all data corresponding to a map of the grid.
In this embodiment, the offset addresses of the mesh data stored in the file header unit are stored in an array form, where the array size is the total number of meshes included in the circumscribed rectangle of the city, and the array content is the offset address of each mesh data.
Specifically, in this embodiment, the set is an array meshnex [ citymehnum ], where each component in the array meshnex corresponds to a storage address of the mesh data, that is, an offset address of the mesh data relative to the file header is stored (if the offset address is-1, it indicates that there is no mesh network data in the corresponding mesh); the size citymehsnum of the array meslndex is equal to the total number of grids contained by the circumscribed rectangle of the city.
In order to make the result more accurate, preferably, the circumscribed rectangle of the city is the smallest rectangle capable of containing the city, and it should be noted that two connected edges of the circumscribed rectangle of the city should be parallel to the longitude and the latitude of the earth respectively.
As shown in fig. 2, the boundary lines and the circumscribed rectangle frame of the city n are shown, and the grid division is performed within the range of the circumscribed rectangle of the boundary lines of the city n.
And taking the point A at the lower left corner of the external rectangle of the city as a spatial gridding datum point, wherein the grid number is increased from 0 to the left and from bottom to top in sequence. K represents the number of grids contained in the external rectangle of the city in the longitude direction; m represents the number of grids contained in the external rectangle of the city in the latitude direction.
a. Setting basic parameters of the city grid:
minimum longitude (fixed value) of the city bounding rectangle: city Lon Min
Maximum longitude (fixed value) of the city bounding rectangle: city _ Lon _ Max
Minimum latitude (fixed value) of the circumscribed rectangle of the city: city _ Lat _ Min
Maximum latitude (fixed value) of the circumscribed rectangle of the city: city _ Lat _ Max
Grid width (constant): city _ Mesh _ Width
Grid height (constant): city _ Mesh _ Height
b. And (3) calculating the total grid number CityMeshNum contained in the city bounding rectangle:
the total number of lines of the urban grid: city _ RowNum ═ City _ Lat _ Max-City _ Lat _ Min)/City _ Mesh _ Height
The total number of the urban grids is as follows: city _ ColNum ═ City _ Lon _ Max-City _ Lon _ Min)/City _ Mesh _ Width
The total number of the city grids: city _ RowNum ═ City _ ColNum
In this embodiment, the road network mesh data of the corresponding area can be quickly retrieved and acquired by the offset address of the mesh data in the header file unit.
By adopting the grid data addressing method, although storage space waste can be generated on grids without road network data, the advantage of linear and rapid retrieval of arrays can be fully utilized.
Step two: and establishing a city boundary data index file containing all cities in the country, wherein the city boundary data index file comprises the circumscribed rectangular coordinates and the boundary coordinates of all the cities and is used for judging the city where the current position is located according to the boundary coordinates and the circumscribed rectangular coordinates of the cities.
Specifically, the national city boundary data index file comprises a city number unit, a city entry index unit and a city data unit, the city entry index unit comprises a plurality of city index data packets, each city index data packet comprises a city name, a city data index address and an external rectangular coordinate, the city data unit comprises a plurality of city data, each city data comprises a boundary coordinate of the city, the city index data packets in the city entry index unit correspond to the city data in the city data unit one by one, namely the city index data packets are equal in number, and the city names and the external rectangular coordinates in the city index data packets and the boundary coordinates in the city data in the corresponding addresses of the city data index addresses in the city index data packets are the external rectangular coordinates and the boundary coordinates of the cities corresponding to the city names. The city number is the number of city index data packets contained in the city entry index unit.
It should be noted that the boundary coordinates and the circumscribed rectangular coordinates of the city are longitude and latitude data. The boundary of the city is the boundary between two cities on the map, namely, the adjacent cities have a common boundary.
Step three: and searching the corresponding external rectangles according to the external rectangle coordinates of each city in the city boundary data index file, and further searching the city according to the boundary coordinates of the city corresponding to the searched external rectangles.
In this embodiment, specifically, according to the circumscribed rectangle coordinates of each city in the city boundary data index file, the circumscribed rectangle where the current coordinate is located is found in a circular traversal manner, and then the city name and the city data index address corresponding to the circumscribed rectangle are found.
Due to the common boundary between adjacent cities, the bounding rectangles of adjacent cities may partially coincide, and thus the current coordinates may be located within the bounding rectangles of multiple cities.
And searching the boundary coordinate of the corresponding city data in the city data unit of the city boundary data index file according to the searched city data index address, judging the boundary coordinate of the current coordinate, and setting the city name corresponding to the boundary coordinate as the city of the current coordinate.
Because adjacent cities have a common boundary between them, a location is, and may be, within the boundary of a city.
In this embodiment, the method for determining whether the city is located within the boundary is an injection line method, which specifically includes:
and making a half ray along the direction of the x coordinate axis from the current position, and judging whether the current position falls in the urban area or not by calculating the number of intersection points of the half ray and the urban boundary line.
a. If the number of the intersection points is an odd number, the current position can be judged to be inside the city boundary polygon.
b. If the number of the intersection points is an even number, it can be determined that the current position does not fall within the boundary polygon.
Referring to fig. 3, where vehicle position 1 and vehicle position 2 both fall within the rectangular frame of the city a boundary line, it is further determined whether the vehicle is in city a:
a. if the number of intersection points between the vehicle position 1 and the boundary line of the city a is 2, namely C1 and C2, and is even, the vehicle position 1 is not in the city a.
b. If there are 1 intersection points C3 from vehicle position 2 and the intersection points are odd, then vehicle position 2 is in city a.
Step four: and judging whether the city road network data of the city is updated or not, if so, updating the city road network data of the city, and entering the fifth step, otherwise, entering the fifth step.
Step five: and C, acquiring road network data of a grid corresponding to the current position according to the urban road network data file of the city established in the step one.
In the first embodiment of the invention, the road network and attribute data are compiled and stored in a map data organization mode with cities as basic units, and the road network data are still cut and stored in a single city by taking grids as minimum units, so that a single large file package originally covering road network data nationwide is split into hundreds of city data file packages, and when certain city data needs to be upgraded, only the city map data needs to be updated and replaced, so that an efficient gridding road network processing algorithm can be utilized, and the subsequent map data upgrading and updating are facilitated.
Example two:
the invention also provides city map data upgrading terminal equipment which comprises a memory, a processor and a computer program which is stored in the memory and can run on the processor, wherein the steps in the method embodiment of the first embodiment of the invention are realized when the processor executes the computer program.
Further, as an executable scheme, the city map data upgrading terminal device may be a mobile phone, a smart watch, a vehicle-mounted terminal, or other computing devices. The city map data upgrading terminal equipment can comprise, but is not limited to, a processor and a memory. It is understood by those skilled in the art that the above-mentioned structure of the city map data upgrade terminal device is only an example of the city map data upgrade terminal device, and does not constitute a limitation on the city map data upgrade terminal device, and may include more or less components than the above, or combine some components, or different components, for example, the city map data upgrade terminal device may further include an input/output device, a network access device, a bus, and the like, which is not limited in this embodiment of the present invention.
Further, as an executable solution, the processor may be a Central Processing Unit (CPU), or may be other general purpose processors, Digital Signal Processors (DSP), Application Specific Integrated Circuits (ASIC), Field Programmable Gate Arrays (FPGA) or other programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and so on. The general processor can be a microprocessor or the processor can be any conventional processor and the like, the processor is a control center of the city map data upgrading terminal device, and various interfaces and lines are utilized to connect various parts of the whole city map data upgrading terminal device.
The memory can be used for storing the computer program and/or the module, and the processor realizes various functions of the city map data upgrading terminal device by running or executing the computer program and/or the module stored in the memory and calling the data stored in the memory. The memory can mainly comprise a program storage area and a data storage area, wherein the program storage area can store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the mobile phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a flash memory Card (Fnash Card), at least one magnetic disk storage device, a flash memory device, or other volatile solid state storage device.
The invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned method of an embodiment of the invention.
The module/unit integrated with the city map data upgrading terminal device may be stored in a computer readable storage medium if it is implemented in the form of a software functional unit and sold or used as an independent product. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-only Memory (ROM), Random Access Memory (RAM), software distribution medium, and the like.
While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (9)
1. A city map data upgrading method is characterized by comprising the following steps:
s1: establishing city road network data files of each city by taking the city as a unit;
s2: establishing a city boundary data index file, wherein the city boundary data index file comprises circumscribed rectangular coordinates and boundary coordinates of each city;
s3: searching the corresponding external rectangles according to the external rectangle coordinates of each city in the city boundary data index file, and further searching the city according to the boundary coordinates of the city corresponding to the searched external rectangles;
s4: judging whether the city road network data of the city is updated or not, if so, updating the city road network data of the city, and entering S5, otherwise, directly entering S5;
s5: and obtaining road network data of the grid corresponding to the current position according to the city road network data file of the city.
2. The city map data upgrade method according to claim 1, wherein: in step S1, the city road network data file includes two parts, i.e., a file header unit and a grid data unit, where the file header unit is used to store offset addresses of all grid data covered by a city, and the grid data unit is used to store road network data corresponding to each road network grid.
3. The city map data upgrade method according to claim 2, wherein: in step S2, the city boundary data index file specifically includes: including city number unit, city entry index unit and city data unit, city entry index unit includes a plurality of city index data package, and every city index data package all includes city name, city data index address and external rectangle coordinate, city data unit includes a plurality of city data, and every city data all includes the boundary coordinate of this city, city index data package in the city entry index unit and the city data one-to-one in the city data unit, city number is the figure of city index data package that contains in the city entry index unit.
4. The city map data upgrade method according to claim 3, wherein: step S3 specifically includes:
according to the circumscribed rectangle coordinates of each city in the city boundary data index file, finding the circumscribed rectangle where the current coordinates are located in a circulating traversal mode, and further finding the city name and the city data index address corresponding to the circumscribed rectangle;
and searching the boundary coordinate of the corresponding city data in the city data unit of the city boundary data index file according to the searched city data index address, judging the boundary coordinate of the current coordinate, and setting the city name corresponding to the boundary coordinate as the city of the current coordinate.
5. The city map data upgrade method according to claim 2, wherein: the road network data includes a basic road network and attribute information data.
6. The city map data upgrade method according to claim 2, wherein: the offset addresses of the grid data stored in the file header unit are stored in an array form, wherein the array size is the total number of grids contained in the external rectangle of the city, and the array content is the offset address of each grid data.
7. The city map data upgrade method according to claim 1, wherein: the circumscribed rectangle is the smallest rectangle that can contain the city.
8. A city map data upgrading terminal equipment is characterized in that: comprising a processor, a memory and a computer program stored in said memory and running on said processor, said processor implementing the steps of the method according to any one of claims 1 to 7 when executing said computer program.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811311640.9A CN111143487A (en) | 2018-11-06 | 2018-11-06 | Urban map data upgrading method, terminal equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811311640.9A CN111143487A (en) | 2018-11-06 | 2018-11-06 | Urban map data upgrading method, terminal equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111143487A true CN111143487A (en) | 2020-05-12 |
Family
ID=70516130
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811311640.9A Pending CN111143487A (en) | 2018-11-06 | 2018-11-06 | Urban map data upgrading method, terminal equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111143487A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288550A (en) * | 2020-11-19 | 2021-01-29 | 食亨(上海)科技服务有限公司 | Regional order analysis method, system and computer readable medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101029830A (en) * | 2006-03-03 | 2007-09-05 | 株式会社电装 | Map data updating method |
| JP2008090195A (en) * | 2006-10-05 | 2008-04-17 | Hitachi Ltd | Map data distribution system |
| CN101319911A (en) * | 2008-07-02 | 2008-12-10 | 凯立德欣技术（深圳）有限公司 | Client terminal and server terminal of navigation system, and map updating method |
| CN101501452A (en) * | 2006-09-29 | 2009-08-05 | 爱信艾达株式会社 | Map update data supplying apparatus, version table, map data updating syste and map update data supplying method |
| CN101646921A (en) * | 2007-03-29 | 2010-02-10 | 爱信艾达株式会社 | Map update data supply apparatus, map data update system, and map update data supply method |
| CN102142012A (en) * | 2010-01-29 | 2011-08-03 | 爱信艾达株式会社 | Map update data supply device and map update data supply program |
| CN103473293A (en) * | 2013-09-03 | 2013-12-25 | 沈阳美行科技有限公司 | Navigation data partitioning method |
| CN103823854A (en) * | 2014-02-19 | 2014-05-28 | 厦门雅迅网络股份有限公司 | Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes |
-
2018
- 2018-11-06 CN CN201811311640.9A patent/CN111143487A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101029830A (en) * | 2006-03-03 | 2007-09-05 | 株式会社电装 | Map data updating method |
| CN101501452A (en) * | 2006-09-29 | 2009-08-05 | 爱信艾达株式会社 | Map update data supplying apparatus, version table, map data updating syste and map update data supplying method |
| JP2008090195A (en) * | 2006-10-05 | 2008-04-17 | Hitachi Ltd | Map data distribution system |
| CN101646921A (en) * | 2007-03-29 | 2010-02-10 | 爱信艾达株式会社 | Map update data supply apparatus, map data update system, and map update data supply method |
| CN101319911A (en) * | 2008-07-02 | 2008-12-10 | 凯立德欣技术（深圳）有限公司 | Client terminal and server terminal of navigation system, and map updating method |
| CN102142012A (en) * | 2010-01-29 | 2011-08-03 | 爱信艾达株式会社 | Map update data supply device and map update data supply program |
| CN103473293A (en) * | 2013-09-03 | 2013-12-25 | 沈阳美行科技有限公司 | Navigation data partitioning method |
| CN103823854A (en) * | 2014-02-19 | 2014-05-28 | 厦门雅迅网络股份有限公司 | Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288550A (en) * | 2020-11-19 | 2021-01-29 | 食亨(上海)科技服务有限公司 | Regional order analysis method, system and computer readable medium |
| CN112288550B (en) * | 2020-11-19 | 2022-11-22 | 食亨(上海)科技服务有限公司 | Regional order analysis method, system and computer readable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110134755B (en) | Map updating method, device, equipment, server and medium | |
| US20070253642A1 (en) | Method and apparatus for indexing, storing and retrieving raster (GRID) data in a combined raster vector system | |
| EP2589932B1 (en) | Technique for structuring a navigation database | |
| US8447790B2 (en) | Electric device for executing process based on map data | |
| CN109798903A (en) | A kind of method and device obtaining road information from map datum | |
| CN103090876A (en) | Technique for structuring navigation data | |
| US20140188386A1 (en) | Map distribution server for automotive navigation systems, map data distribution system, and road difference data production method | |
| US8892583B2 (en) | Map data, navigation device having map data, and method for generating map data | |
| CN111506939A (en) | Garage design method, device, terminal and medium | |
| CN103823854A (en) | Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes | |
| US20230093020A1 (en) | Positioning method and apparatus | |
| JP2002514805A (en) | Method for manufacturing storage medium with map | |
| CN111143487A (en) | Urban map data upgrading method, terminal equipment and storage medium | |
| CN105631038B (en) | Navigation map generation method and system, and electronic device with system | |
| CN104572805A (en) | Apparatus and method for processing map data by real-time index creation and system thereof | |
| CN110569546B (en) | Traffic cell division method and device | |
| CN117171288A (en) | Grid map analysis method, device, equipment and medium | |
| CN112988933A (en) | Method and device for managing address information | |
| CN113011946A (en) | Order processing method and device | |
| CN115329030B (en) | Method for checking road network model parameters, electronic equipment and storage medium | |
| CN115779424B (en) | Navigation grid path finding method, device, equipment and medium | |
| CN115905310A (en) | Data query method, data storage method, corresponding equipment, system and medium | |
| CN104205190A (en) | Information processing system | |
| CN110718078B (en) | Traffic incident information publishing method and device | |
| CN111896017B (en) | Route determination method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200512 |