CN107978219B - Method and device for constructing road network of digital map - Google Patents
Method and device for constructing road network of digital map Download PDFInfo
- Publication number
- CN107978219B CN107978219B CN201610939225.2A CN201610939225A CN107978219B CN 107978219 B CN107978219 B CN 107978219B CN 201610939225 A CN201610939225 A CN 201610939225A CN 107978219 B CN107978219 B CN 107978219B
- Authority
- CN
- China
- Prior art keywords
- administrative
- administrative division
- point
- path
- division
- 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.)
- Active
Links
Images
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
- G09B29/003—Maps
- G09B29/006—Representation of non-cartographic information on maps, e.g. population distribution, wind direction, radiation levels, air and sea routes
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Ecology (AREA)
- Mathematical Physics (AREA)
- Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Educational Technology (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
- Instructional Devices (AREA)
Abstract
The invention provides a method for constructing a road network of a digital map, which comprises the steps of firstly selecting a first administrative division, and acquiring a plurality of second administrative divisions, wherein the distance between the first administrative division and the second administrative division is within a preset range; then, acquiring a path starting point and a path ending point of a first administrative division, and determining an exploration point set of the first administrative division according to the path starting point and the path ending point of the first administrative division; and finally, acquiring the passable paths reaching the searching points of the second administrative division from each searching point in sequence to form a road network. In the method, search points are obtained first, then paths are searched according to the search points to form a customizable road network, and the road network of any region can be changed by adjusting the number of administrative divisions or a connectivity algorithm. The obtained road network can improve the path planning efficiency of the navigator by combining the path planning algorithm of the navigator. In addition, the method can automatically calculate the road network, reduce manual operation and avoid repeated work.
Description
Technical Field
The invention relates to the field of digital maps, in particular to a method and a device for constructing a road network of a digital map.
Background
In the electronic map, after the roads are digitized, a line and two nodes are used to represent a road in the real world. The road types include high speed, national road, provincial road, county road, village road, and other roads. In a certain area, a road network is formed by mutually communicated road systems consisting of various roads. The road network is reasonably distributed in density, and the path planning efficiency is reduced when the density is too large or too small. The roads of one or several road classes form a road network, the road network class representing the importance of the road network.
The road network in the navigator generally has a plurality of layers, from the lower floor to the upper floor, road network grade is higher and higher, and the importance is higher and higher, and the density is smaller and smaller, is applicable to farther distance's route planning. And the road network of the upper layer must exist in the road network of the lower layer. The multi-layer road network of the navigator can be regarded as a result of extracting the main roads for a plurality of times. The road network at the bottom layer has all road networks in the real world, and partial main roads are extracted from the bottom layer to form a high-grade road network. For example, the primary road network is a road network between large cities such as provinces and meetings formed by national roads, the secondary road network is a province road which is additionally connected with different cities on the basis of the primary road network, and the tertiary road network is a county road which is additionally connected with counties and towns on the basis of the secondary road network. When a city or a road is newly added, a new road network needs to be reconstructed for remote path planning, so that remote navigation is realized, but manual modification is time-consuming and labor-consuming, and the updating period is slow, so that the effectiveness of road network data in the digital map is poor.
Disclosure of Invention
Therefore, the technical problem to be solved by the present invention is to overcome the defect that a new road network cannot be built in time after a road is updated in the prior art.
The invention provides a method for constructing a road network of a digital map, which comprises the following steps: selecting a first administrative division, and acquiring a plurality of second administrative divisions of which the distance from the first administrative division is within a preset range; acquiring a path starting point and a path ending point of a first administrative division, and determining an exploration point set of the first administrative division according to the path starting point and the path ending point of the first administrative division; and acquiring the passable paths reaching the searching points of the second administrative division from each searching point in sequence to form a road network.
Preferably, the acquiring a plurality of second administrative divisions whose distance from the first administrative division is within a preset range includes: taking the center of the first administrative division as a circle center and a preset first distance as a radius, and acquiring a peripheral administrative division within the radius coverage range; and respectively connecting the center of each peripheral administrative division with the center of the first administrative division, if the included angle of the connecting lines is smaller than an angle threshold, deleting one or more peripheral administrative divisions which are far away from the center of the first administrative division, and using the rest peripheral administrative divisions as second administrative divisions.
Preferably, the obtaining a route starting point of the first administrative division includes: taking the center of the first administrative division as a circle center, presetting a second distance as a radius, and acquiring road nodes within the radius range; respectively connecting the center of the first administrative division and the center of the second administrative division by taking the road node as a vertex to obtain an included angle of two connecting lines; and acquiring the set of road nodes with the included angle close to 180 degrees as the path starting point of the first administrative district.
Preferably, the obtaining a route starting point of the first administrative division includes: drawing a circle by taking the center of the first administrative division as an origin and a preset third distance as a radius; a set of intersections of the circumference and surrounding roads is obtained, and the intersections are used as route starting points of the first administrative district.
Preferably, the acquiring the route end point of the first administrative division includes: determining a path starting point of the second administrative district, and searching a passable path from the path starting point of the second administrative district to the first administrative district; and when the distance between the node of the passable path and the center of the first administrative division is smaller than a preset distance threshold, finishing the exploration, wherein the exploration end point is the path end point of the first administrative division.
Preferably, the determining the set of exploration points of the first administrative division according to the route start point and the route end point of the first administrative division includes: and combining the starting point and the end point of the path to obtain an exploration point set.
Preferably, the process of obtaining a traversable path to a search point of the second administrative division to form a road network includes: road networks of different levels are formed according to the road grade of the passable road.
In addition, the present invention also provides an apparatus for constructing a road network of a digital map, comprising: the system comprises an area selection unit, a first management division and a second management division, wherein the area selection unit is used for selecting the first management division and acquiring a plurality of second management divisions, and the distance between the first management division and the second management division is within a preset range; the search point acquisition unit is used for acquiring a path starting point and a path ending point of a first administrative division and determining a search point set of the first administrative division according to the path starting point and the path ending point of the first administrative division; and the road network construction unit is used for acquiring the passable paths reaching the searching points of the second administrative division from each searching point in sequence to form a road network.
Preferably, the region selection unit includes: the peripheral administrative division acquisition subunit is used for acquiring the peripheral administrative division within the radius coverage range by taking the center of the first administrative division as a circle center and taking a preset first distance as a radius; and the screening subunit is used for respectively connecting the center of each peripheral administrative division with the center of the first administrative division, deleting one or more peripheral administrative divisions which are far away from the center of the first administrative division if the included angle of the connecting line is smaller than an angle threshold, and taking the rest peripheral administrative divisions as second administrative divisions.
Preferably, the exploration point obtaining unit includes a path starting point obtaining subunit including: the road node selection subunit is used for acquiring road nodes within the radius range by taking the center of the first administrative division as the circle center and presetting a second distance as the radius; the included angle acquisition subunit is used for respectively connecting the center of the first administrative division and the center of the second administrative division by taking the road node as a vertex to obtain an included angle of the two connecting lines; and the selecting subunit is used for acquiring the set of road nodes with the included angles close to 180 degrees as the path starting point of the first administrative district.
The scheme of the invention has the following advantages:
1. the method for constructing the road network of the digital map comprises the steps of firstly selecting a first administrative division, and acquiring a plurality of second administrative divisions, wherein the distance between the first administrative division and the second administrative division is within a preset range; then, acquiring a path starting point and a path ending point of a first administrative division, and determining an exploration point set of the first administrative division according to the path starting point and the path ending point of the first administrative division; and finally, acquiring the passable paths reaching the searching points of the second administrative division from each searching point in sequence to form a road network. In the method, search points are obtained first, then paths are searched according to the search points to form a customizable road network, the road network of any region can be changed by adjusting the number of administrative divisions or a communication algorithm, and the obtained road network can improve the path planning efficiency of a navigator by combining with a path planning algorithm of the navigator. In addition, the method can automatically calculate the road network, reduce manual operation and avoid repeated work.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a specific example of a method of constructing a road network of a digital map according to embodiment 1 of the present invention;
fig. 2, 3, and 4 are schematic diagrams illustrating obtaining a surrounding administrative division according to embodiment 1 of the present invention;
fig. 5 and 6 are schematic diagrams illustrating obtaining a starting point of a path in embodiment 1 of the present invention;
FIG. 7 is a schematic illustration of a constructed road network according to the invention in example 1;
fig. 8 is a block diagram showing a configuration of an apparatus for constructing a road network of a digital map according to embodiment 2 of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of description and simplicity of description, but do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; the two elements may be directly connected or indirectly connected through an intermediate medium, or may be communicated with each other inside the two elements, or may be wirelessly connected or wired connected. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Example 1
In this embodiment, a method for constructing a road network of a digital map is provided, where the method is used in the digital map, and can automatically generate a road network among multiple cities to provide a reference for remote path planning, and a flowchart of the method is shown in fig. 1, and includes the following steps:
s1, selecting a first administrative division, and acquiring a plurality of second administrative divisions, wherein the distance between the first administrative division and the second administrative division is within a preset range.
Administrative divisions are generally referred to herein as cities, such as prefectural cities, provincial cities, prefectural cities, and the like. The center of the administrative division is a central coordinate, but the area included in the administrative division is generally an irregular range.
In the process of acquiring a plurality of second administrative divisions within a preset range from the first administrative division, firstly, taking the center of the first administrative division as the center of a circle and a preset first distance as a radius, and acquiring peripheral administrative divisions within the radius coverage range; then, the center of each peripheral administrative division is connected with the center of the first administrative division, if the included angle of the connecting lines is smaller than the angle threshold, one or more peripheral administrative divisions far away from the center of the first administrative division are deleted, and the rest peripheral administrative divisions are the second administrative division. In a preferred embodiment, the peripheral administrative division may be manually adjusted, and the peripheral administrative division may be manually adjusted.
A specific example is given below, for example, taking wuhan as the first administrative division, and acquiring the administrative divisions around wuhan, where the method is as follows:
first, peripheral administrative divisions are screened by range. The center of the current administrative division Wuhan is taken as an origin, and the designated length R is taken as a radius. The peripheral administrative divisions within the circular range are reserved, as shown in fig. 2, for zhengzhou, fertile, nanjing, nanchang, hangzhou and Changsha.
Then, screening by angle. And connecting the center of each peripheral administrative division with the center of the current administrative division, and calculating the included angle between the connecting line and the due north direction. If the angle difference between any two connecting lines is less than the threshold value T (generally within 30 degrees), one (or more) of the connecting lines is reserved. As shown in fig. 3, if the angle between Nanjing and the mixed fertilizer is small, the Nanjing with a long distance is deleted, and the Nanjing is not used as a peripheral administrative division of Wuhan.
Finally, the peripheral administrative divisions are manually adjusted. When the method cannot find a proper peripheral administrative division, a manual configuration method is used. As shown in fig. 4, siegan and chongqing are added as peripheral administrative divisions of wuhan.
And S2, acquiring a path starting point and a path ending point of the first administrative division, and determining an exploration point set of the first administrative division according to the path starting point and the path ending point of the first administrative division.
The step of obtaining the route starting point of the first administrative division may be implemented in two ways.
The first method is as follows:
firstly, taking the center of a first administrative division as a circle center, presetting a second distance as a radius, and acquiring road nodes within the radius range;
secondly, the road nodes are taken as vertexes and are respectively connected with the center of the first administrative division and the center of the second administrative division to obtain an included angle between two connecting lines;
and thirdly, acquiring a set of road nodes with the included angles close to 180 degrees as a path starting point of the first administrative district. The approximate 180 degrees can be judged by the range, for example, the included angle between 165 and 180 degrees is regarded as approximate 180 degrees, and the person skilled in the art can reasonably set the included angle as required.
Specifically, to give an example, as shown in fig. 5, first, a set N ═ N of all road nodes within the current administrative center radius r is obtained1,N2…NnThe road nodes can be starting points and intersection points of roads, the road nodes are taken as vertexes to connect the current administrative center and the peripheral administrative center, and an included angle α between the two connecting lines is obtained, so that an included angle set P corresponding to each node is obtained, wherein the included angle set P is { α ═1,α2…αn}., selecting α node set closest to 180 degrees to obtain a search starting point set S ═ N1＇,N2＇…Nn＇}。
The second method comprises the following steps:
firstly, drawing a circle by taking the center of the first administrative division as an origin and a preset third distance as a radius;
secondly, a set of intersections of the circumference and surrounding roads is obtained, and the intersections are used as route starting points of the first administrative division.
As shown in fig. 6, a circle is drawn with r as a radius with the current administrative center as the origin, and an intersection set S ═ N { N } of the circle and the road is obtained1,N2…NnAnd S is taken as a exploration starting point set.
The process of obtaining the path end point is as follows: first, the route start point of the second administrative division is determined in the same manner as the route start point of the first administrative division. And exploring a passable path from the starting point of the path of the second administrative district to the first administrative district. Since the number of the second administrative divisions may be several, each of the second administrative divisions may form a passable path that falls over the first administrative division. Each passable path has a road node, such as an intersection, a starting point and the like, when the distance between the node of the passable path and the center of the first administrative division is smaller than a preset distance threshold, the search is ended, the preset distance threshold can be selected from 0-2km, and the search end point is the path end point of the first administrative division as long as the preset distance threshold is close to the center coordinate of the administrative division.
And when the path starting point and the path end point are obtained, combining the path starting point and the path end point to obtain a search point set. Merging the exploration starting point and the exploration end point of the current administrative center to obtain an exploration point set X ═ M1,M2…Mn}。
And S3, sequentially starting from each search point, acquiring the passable paths reaching the search points of the second administrative division to form a road network. The search points of the second administrative division are acquired in the same manner as the search points of the first administrative division, so that all the administrative divisions establish corresponding search point sets, and feasible paths which can reach other search points are searched sequentially from each search point, the path search algorithm can be set according to needs, such as the fastest speed, the shortest distance and the like, and the configuration table of the path search method is shown in table 1 below.
TABLE 1 Path exploration configuration Table
| Origin administrative division | Destination administrative division | Path exploration algorithm | Road variety that can be used |
| Wuhan dynasty | Sand for growing trees | The speed is fastest and the distance is shortest | High speed, national road |
| Wuhan dynasty | Nanchang tea | All passable paths | High speed, national road and provincial road |
| … | … | … | … |
Finally, a plurality of passable paths are connected into a road network. When the above processing is performed for all of the administrative divisions, a road network is formed, as shown in fig. 7.
In the process of forming a road network, road networks of different levels are formed according to the road grade of the passable road. For example, a first-level road network is formed from national roads and highways, a second-level road network is formed by adding provincial roads to the first-level road network, and so on, and as shown in table 2, the hierarchical system may be provided as necessary when creating a road network as a convertible embodiment. According to the scheme, the multi-layer road network is constructed by combining different path exploration algorithms based on the administrative levels.
TABLE 2 road variety configuration table
| Road network grade | Road species |
| 1 | Mainly comprises an expressway, an urban expressway and a national road |
| 2 | Mainly comprises an expressway, an urban expressway, a national road and a provincial road |
| 3 | Mainly comprises an expressway, an urban expressway, a national road, a provincial road and a county road |
| 4 | Mainly comprises an expressway, an urban expressway, a national road, a provincial road, a county road and a village and town road |
| 5 | All roads |
Example 2:
in this embodiment, an apparatus for constructing a road network of a digital map is provided, as shown in fig. 8, including:
the system comprises an area selection unit 01, a first administrative division and a second administrative division, wherein the area selection unit is used for selecting the first administrative division and acquiring a plurality of second administrative divisions, and the distance between the first administrative division and the second administrative division is within a preset range;
the search point acquisition unit 02 is used for acquiring a path starting point and a path ending point of a first administrative district, and determining a search point set of the first administrative district according to the path starting point and the path ending point of the first administrative district;
and the road network constructing unit 03 is configured to acquire a passable path to the search point of the second administrative division from each search point in sequence to form a road network.
Wherein the region selection unit includes:
the peripheral administrative division acquisition subunit is used for acquiring the peripheral administrative division within the radius coverage range by taking the center of the first administrative division as a circle center and taking a preset first distance as a radius;
and the screening subunit is used for respectively connecting the center of each peripheral administrative division with the center of the first administrative division, deleting one or more peripheral administrative divisions which are far away from the center of the first administrative division if the included angle of the connecting line is smaller than an angle threshold, and taking the rest peripheral administrative divisions as second administrative divisions.
Wherein the exploration point acquiring unit includes a path starting point acquiring subunit including:
the road node selection subunit is used for acquiring road nodes within the radius range by taking the center of the first administrative division as the circle center and presetting a second distance as the radius;
the included angle acquisition subunit is used for respectively connecting the center of the first administrative division and the center of the second administrative division by taking the road node as a vertex to obtain an included angle of the two connecting lines;
and the selecting subunit is used for acquiring the set of road nodes with the included angles close to 180 degrees as the path starting point of the first administrative district.
The device for constructing the road network of the digital map comprises an area selection unit, a search point acquisition unit and a road network construction unit.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications therefrom are within the scope of the invention.
Claims (5)
1. A method of constructing a road network of digital maps, comprising:
selecting a first administrative division, and acquiring a plurality of second administrative divisions of which the distance from the first administrative division is within a preset range;
acquiring a path starting point and a path ending point of a first administrative division, and determining an exploration point set of the first administrative division according to the path starting point and the path ending point of the first administrative division;
sequentially searching a passable path reaching the searching point of the second administrative division from each searching point to form a road network; the acquisition mode of the search points of the second administrative division is the same as that of the search points of the first administrative division;
the obtaining of the route starting point of the first administrative division includes:
taking the center of the first administrative division as a circle center, presetting a second distance as a radius, and acquiring road nodes within the radius range;
respectively connecting the center of the first administrative division and the center of the second administrative division by taking the road node as a vertex to obtain an included angle of two connecting lines;
acquiring a set of road nodes with included angles close to 180 degrees as a path starting point of a first administrative division;
or, the obtaining the route starting point of the first administrative division includes:
drawing a circle by taking the center of the first administrative division as an origin and a preset third distance as a radius;
acquiring a set of intersection points of the circumference and surrounding roads, and taking the intersection points as path starting points of a first administrative district;
the obtaining of the route end point of the first administrative division includes:
determining a path starting point of the second administrative district, and searching a passable path from the path starting point of the second administrative district to the first administrative district;
when the distance between the node of the passable path and the center of the first administrative division is smaller than a preset distance threshold, finishing exploration, wherein an exploration terminal point is a path terminal point of the first administrative division;
the determining of the exploration point set of the first administrative division according to the route starting point and the route ending point of the first administrative division includes:
and combining the starting point and the end point of the path to obtain an exploration point set.
2. The method of claim 1, wherein obtaining a number of second administrative regions within a preset range of distances from the first administrative region comprises:
taking the center of the first administrative division as a circle center and a preset first distance as a radius, and acquiring a peripheral administrative division within the radius coverage range;
and respectively connecting the center of each peripheral administrative division with the center of the first administrative division, if the included angle of the connecting lines is smaller than an angle threshold, deleting one or more peripheral administrative divisions which are far away from the center of the first administrative division, and using the rest peripheral administrative divisions as second administrative divisions.
3. Method according to any one of claims 1-2, characterized in that said process of exploring traversable paths reaching an exploration point of said second administrative division into a road network comprises:
road networks of different levels are formed according to the road grade of the passable road.
4. An apparatus for constructing a road network of digital maps, comprising:
the system comprises an area selection unit, a first management division and a second management division, wherein the area selection unit is used for selecting the first management division and acquiring a plurality of second management divisions, and the distance between the first management division and the second management division is within a preset range;
the search point acquisition unit is used for acquiring a path starting point and a path ending point of a first administrative division and determining a search point set of the first administrative division according to the path starting point and the path ending point of the first administrative division;
the road network construction unit is used for searching the passable paths reaching the searching points of the second administrative division from each searching point in sequence to form a road network; the acquisition mode of the search points of the second administrative division is the same as that of the search points of the first administrative division;
the exploration point acquisition unit includes a path starting point acquisition subunit including:
the road node selection subunit is used for acquiring road nodes within the radius range by taking the center of the first administrative division as the circle center and presetting a second distance as the radius;
the included angle acquisition subunit is used for respectively connecting the center of the first administrative division and the center of the second administrative division by taking the road node as a vertex to obtain an included angle of the two connecting lines;
the selecting subunit is used for acquiring a set of road nodes with the included angles close to 180 degrees as a path starting point of the first administrative division;
or, the path starting point obtaining subunit is specifically configured to:
drawing a circle by taking the center of the first administrative division as an origin and a preset third distance as a radius;
acquiring a set of intersection points of the circumference and surrounding roads, and taking the intersection points as path starting points of a first administrative district;
the exploration point acquisition unit is further configured to:
determining a path starting point of the second administrative district, and searching a passable path from the path starting point of the second administrative district to the first administrative district;
when the distance between the node of the passable path and the center of the first administrative division is smaller than a preset distance threshold, finishing exploration, wherein an exploration terminal point is a path terminal point of the first administrative division;
and combining the starting point and the end point of the path to obtain an exploration point set.
5. The apparatus of claim 4, wherein the region selection unit comprises:
the peripheral administrative division acquisition subunit is used for acquiring the peripheral administrative division within the radius coverage range by taking the center of the first administrative division as a circle center and taking a preset first distance as a radius;
and the screening subunit is used for respectively connecting the center of each peripheral administrative division with the center of the first administrative division, deleting one or more peripheral administrative divisions which are far away from the center of the first administrative division if the included angle of the connecting line is smaller than an angle threshold, and taking the rest peripheral administrative divisions as second administrative divisions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610939225.2A CN107978219B (en) | 2016-10-25 | 2016-10-25 | Method and device for constructing road network of digital map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610939225.2A CN107978219B (en) | 2016-10-25 | 2016-10-25 | Method and device for constructing road network of digital map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107978219A CN107978219A (en) | 2018-05-01 |
| CN107978219B true CN107978219B (en) | 2020-05-01 |
Family
ID=62004049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610939225.2A Active CN107978219B (en) | 2016-10-25 | 2016-10-25 | Method and device for constructing road network of digital map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107978219B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489510B (en) * | 2019-08-23 | 2022-05-20 | 腾讯科技（深圳）有限公司 | Road data processing method and device, readable storage medium and computer equipment |
| CN112115567B (en) * | 2020-08-01 | 2024-04-16 | 富盛科技股份有限公司 | Optical fiber minimum consumption path planning method |
| CN113935511A (en) * | 2021-08-26 | 2022-01-14 | 武汉光庭信息技术股份有限公司 | Method and system for maintaining normal connection of exploration road network after yawing |
| CN114199227B (en) * | 2021-12-03 | 2024-04-12 | 京东鲲鹏(江苏)科技有限公司 | Navigation path planning method and device |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488158A (en) * | 2009-02-13 | 2009-07-22 | 同济大学 | Road network modeling method based on road element |
| CN101614551A (en) * | 2009-07-21 | 2009-12-30 | 中国科学院地理科学与资源研究所 | Sneakernet method for building up and device, method for searching path and device |
| CN101859312A (en) * | 2010-04-20 | 2010-10-13 | 长安大学 | Highway network topological structure data model and path calculation method |
| CN102175252A (en) * | 2011-01-27 | 2011-09-07 | 中国人民解放军信息工程大学 | Method for planning dynamic merging and united path of distributed multi-stage road network |
| CN102435200A (en) * | 2011-09-05 | 2012-05-02 | 广东东纳软件科技有限公司 | Rapid path planning method |
| CN102637227A (en) * | 2012-03-29 | 2012-08-15 | 武汉大学 | Land resource assessment factor scope dividing method based on shortest path |
| CN102749083A (en) * | 2012-07-17 | 2012-10-24 | 中国科学院遥感应用研究所 | Method and device for constructing map realizing integration of multi-road network data |
| CN103512581A (en) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | Path planning method and device |
| CN104406590A (en) * | 2014-11-26 | 2015-03-11 | 中国测绘科学研究院 | Road grade-based shortest route-planning algorithm |
-
2016
- 2016-10-25 CN CN201610939225.2A patent/CN107978219B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101488158A (en) * | 2009-02-13 | 2009-07-22 | 同济大学 | Road network modeling method based on road element |
| CN101614551A (en) * | 2009-07-21 | 2009-12-30 | 中国科学院地理科学与资源研究所 | Sneakernet method for building up and device, method for searching path and device |
| CN101859312A (en) * | 2010-04-20 | 2010-10-13 | 长安大学 | Highway network topological structure data model and path calculation method |
| CN102175252A (en) * | 2011-01-27 | 2011-09-07 | 中国人民解放军信息工程大学 | Method for planning dynamic merging and united path of distributed multi-stage road network |
| CN102435200A (en) * | 2011-09-05 | 2012-05-02 | 广东东纳软件科技有限公司 | Rapid path planning method |
| CN102435200B (en) * | 2011-09-05 | 2014-05-21 | 广东东纳软件科技有限公司 | Rapid path planning method |
| CN102637227A (en) * | 2012-03-29 | 2012-08-15 | 武汉大学 | Land resource assessment factor scope dividing method based on shortest path |
| CN103512581A (en) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | Path planning method and device |
| CN102749083A (en) * | 2012-07-17 | 2012-10-24 | 中国科学院遥感应用研究所 | Method and device for constructing map realizing integration of multi-road network data |
| CN104406590A (en) * | 2014-11-26 | 2015-03-11 | 中国测绘科学研究院 | Road grade-based shortest route-planning algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107978219A (en) | 2018-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210019516A1 (en) | Method and apparatus for updating road map geometry based on received probe data | |
| CN107978219B (en) | Method and device for constructing road network of digital map | |
| CN105677804B (en) | Method and device for determining authoritative site and establishing database of authoritative site | |
| CN106909692B (en) | Method for calculating urban public facility coverage radiation index | |
| JP6011258B2 (en) | How to create map data | |
| US9507808B2 (en) | Technique for structuring navigation data | |
| CN106323301B (en) | Method and device for acquiring road information | |
| CN105758410B (en) | Fast path based on A-Star algorithm plans mixed method | |
| TWI393862B (en) | Method for integrating road names and place names in source data | |
| CN105466435B (en) | Route planning method and device of navigation system | |
| CN105222793B (en) | A kind of city stratification region partitioning method based on map vector data model | |
| CN105933294A (en) | Network user positioning method, device and terminal | |
| JP2013515974A (en) | Time and / or accuracy dependent weights for network generation in digital maps | |
| WO2011047729A1 (en) | Incremental map generation, refinement and extension with gps traces | |
| CN106461405B (en) | Updating a single region of a navigation database | |
| CN102147260A (en) | Electronic map matching method and device | |
| CN106708837B (en) | Interest point searching method and device | |
| CN104422451A (en) | Road recognition method and road recognition apparatus | |
| CN101776457B (en) | Navigation method and device | |
| CN104406590B (en) | A kind of shortest path planning method based on category of roads | |
| CN107782323B (en) | High-grade navigation network generation method based on inter-city optimal path | |
| Zhang et al. | Delimited stroke oriented algorithm-working principle and implementation for the matching of road networks | |
| CN105844031A (en) | Mobile phone positioning data based urban traffic corridor identification method | |
| CN114386536A (en) | Region determination method, device, computing equipment and storage medium | |
| CN107169080A (en) | A kind of geospatial analysis system being combined based on GIS and spatial database |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |