CN114791940A - Method, device and system for calculating road name in digital twin city - Google Patents
Method, device and system for calculating road name in digital twin city Download PDFInfo
- Publication number
- CN114791940A CN114791940A CN202210716636.0A CN202210716636A CN114791940A CN 114791940 A CN114791940 A CN 114791940A CN 202210716636 A CN202210716636 A CN 202210716636A CN 114791940 A CN114791940 A CN 114791940A
- Authority
- CN
- China
- Prior art keywords
- road
- label
- road section
- calculating
- key points
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/169—Annotation, e.g. comment data or footnotes
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention belongs to the field of digital twin application, and provides a method, equipment and a system for calculating road names in a digital twin city, wherein the method comprises the following steps: acquiring coordinates and critical degrees of key points of a road, wherein the key points comprise a starting point and an end point of the road; dividing viewpoint levels, and determining label intervals and label sizes under different viewpoint levels; dividing the road into a plurality of road sections by taking the key points as division points, and calculating the length of each road section; sequentially traversing all road sections according to the road direction, and comparing the length of the road sections with the size of the label space: if the length of the current road section is smaller than the label distance, splicing the current road section and the next road section to obtain a new road section; when the corner degree of the new road section is greater than the critical degree and the length of the new road section is greater than the label distance, calculating the position of the label according to the coordinates of key points at two ends of the current road section and the label distance.
Description
Technical Field
The invention relates to the field of digital twin application, in particular to a method, equipment and a system for calculating road names in a digital twin city.
Background
In a digital twin city, a large number of POI interest points expressed by vector data need to be drawn and expressed in real time in a digital twin scene, such as: road signs, rivers, planning drawings, etc.
In the prior art, the drawing technology of the road label is applied to a two-dimensional electronic map more frequently, and the development of the drawing technology is mature. With the emergence of the digital twin city, road display becomes an important basic item in a digital twin scene, and in order to enable a user to know road information more clearly and intuitively, a corresponding name needs to be marked on a road.
Because the scene is often reduced and enlarged at any time in the roaming process of the digital twin scene, the height of the viewpoint from the ground is changed, and how to reasonably display the road label under different heights of the viewpoint from the ground is an unsolved problem in the industry.
Disclosure of Invention
In view of the above, embodiments of the present invention provide a method, an apparatus, and a system for calculating a road name in a digital twin city, so as to solve the above technical problems.
In a first aspect, an embodiment of the present invention provides a method for calculating a road name in a digital twin city, where the method includes:
s1, obtaining coordinates and critical degrees of key points of a road, wherein the key points comprise a starting point and an end point of the road;
s2, dividing viewpoint levels, and determining label intervals and label sizes under different viewpoint levels;
s3, dividing the road into a plurality of road sections by taking the key points as dividing points, and calculating the length of each road section;
sequentially traversing all road sections according to the road direction, and screening out the road sections to be labeled under each viewpoint level;
and S5, sequentially calculating the label coordinates of the road section of the label to be drawn according to the label distance, and storing the label coordinates.
Preferably, the key points are points selected from a road center line and reflecting the road trend, and the key points further include turning points at the corners of the road.
Preferably, the S2 specifically includes:
s21, dividing viewpoint levels according to the height of the camera from the ground, wherein the higher the height of the camera from the ground is, the higher the viewpoint levels are;
and S22, determining label intervals and label font sizes under different viewpoint levels.
Preferably, the calculating the length of each road segment specifically includes:
and obtaining coordinates of key points at two ends of the road section, and calculating the length of the road section according to the coordinates between the two points.
Preferably, the S4 specifically includes:
s41, traversing the road section according to the road direction;
s42, comparing the length of the current road section with the size of the label space:
and if the length of the current road section is greater than the distance between the labels, marking the road section as the road section to be marked with the label.
If the length of the current road section is smaller than the label distance, the step S43 is carried out;
s43, splicing the current road section and the next road section to obtain a new road section;
s44, comparing the corner degree and the critical degree of the new road section:
when the corner degree is greater than the critical degree, repeating the step S42;
when the corner degree is less than the critical degree, the step S45 is entered;
s45, judging whether the current road section is the end point of the road:
if not, repeating the step S43;
and if so, ending the traversal.
Preferably, the method for calculating the corner degree of the road section comprises the following steps:
and key points at two ends of the road section are obtained, and the corner degree of the road section is calculated according to the included angle between the two key point vectors.
Preferably, the step S5 specifically includes:
s51, obtaining coordinates of key points at two ends of a to-be-drawn label road section, setting the key point close to the starting point of the road as start, and setting the key point close to the end point of the road as end;
s52, determining a point of the start coordinate and the label interval as a label coordinate;
s53, taking the label coordinate as a start, and calculating the distance between the start and the end;
s54, comparing the distance with the label distance:
when the distance is greater than the tag pitch, repeating step S52;
and when the distance is smaller than the label distance, finishing the calculation and storing all label coordinates.
In a second aspect, an embodiment of the present invention provides a device for calculating a road name in a digital twin city, including: at least one processor, at least one memory, and computer program instructions stored in the memory, which when executed by the processor, implement the method of the first aspect of the embodiments described above.
In a third aspect, an embodiment of the present invention provides a road name calculation system in a digital twin city, including:
a data acquisition module: the system comprises a coordinate acquisition unit, a coordinate acquisition unit and a coordinate processing unit, wherein the coordinate acquisition unit is used for acquiring the coordinates of key points of a road, and the key points comprise a starting point and an end point of the road;
a viewpoint level determination module: the system comprises a database, a database server and a server, wherein the database is used for determining a current viewpoint level and a critical degree and acquiring a label interval and a label size under the current viewpoint level;
a road section calculation module: the system is used for dividing the road into a plurality of road sections by taking the key points as dividing points, and calculating the length of each road section;
a screening module: the system is used for sequentially traversing all road sections according to the road direction and screening the road sections to be labeled;
a tag location calculation module: and the label coordinates of the road sections to be labeled are sequentially calculated according to the label distance and stored.
In conclusion, the beneficial effects of the invention are as follows:
1. according to the embodiment of the invention, different label intervals and label sizes are preset for different viewpoint levels, so that the label drawing of a key road can be performed under the condition that the current viewpoint is higher than the ground. And calculating the positions of the labels at different view levels so as to be directly called in the subsequent drawing process.
2. In the embodiment of the invention, in order to optimize the coordinate calculation method of the label, the road is divided into different road sections through key points, and the aim of dividing the straight line section from the curve section is fulfilled. Only comparing the length of the road section with the distance between the labels in the linear road section, and calculating the coordinates of the labels in the road section when the length of the road section is greater than the distance between the labels; in the curve road section, whether the label needs to be displayed at the corner is judged firstly: judging whether the angle degree is greater than the critical degree, if so, indicating that the road section approaches to a straight line section, judging whether the length of the road section is greater than the distance between labels, and if both conditions are met, calculating the coordinates of the labels in the road section. And when the length of the road section is smaller than the distance between the labels, splicing the road section with the next road section to splice the road section meeting the drawing condition, and then calculating the position of the label.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly described below, and for those skilled in the art, without making creative efforts, other drawings can be obtained according to the drawings, and these drawings are all within the protection scope of the present invention.
Fig. 1 is a flow chart of a road name calculation method in a digital twin city.
FIG. 2 is a flowchart of the method of steps S4-S5 according to the embodiment of the present invention.
FIG. 3 is a flowchart of the method of steps S41-S43 according to the embodiment of the present invention.
FIG. 4 is a road segment schematic of an embodiment of the invention.
FIG. 5 is a schematic view of a road corner of an embodiment of the present invention.
Fig. 6 is a digital twin scene effect diagram of level 0 of the embodiment of the present invention.
Fig. 7 is a 4-level digital twin scene effect diagram of an embodiment of the invention.
FIG. 8 is a block framework diagram of a road name calculation system in a digital twin city, in accordance with an embodiment of the present invention.
Detailed Description
Features of various aspects and exemplary embodiments of the present invention will be described in detail below, and in order to make objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail below with reference to the accompanying drawings and the embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not to be construed as limiting the invention. It will be apparent to one skilled in the art that the present invention may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the present invention by illustrating examples of the present invention.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Example 1
Referring to fig. 1, an embodiment of the present invention provides a method for calculating a road name in a digital twin city, where the method includes the following steps:
s1, obtaining coordinates and critical degrees of key points of a road, wherein the key points comprise a starting point and an end point of the road and a break point at a corner of the road, and the key points are selected points reflecting the trend of the road on a central line of the road, such as: if the road is linear, the trend of the road can be embodied only by taking the starting point and the end point of the road; if the road is curved, a turning point is required to be taken at the corner to reflect the degree and direction of the road, as shown in fig. 4, Q 1 As a starting point of the road, Q 2 、Q 3 、Q 4 、Q 5 Etc. are the break points at the corners.
Specifically, request for obtaining the city vector data GeoJson is performed, information such as a road name, a road grade, longitude and latitude coordinates of a key point of each road and the like is obtained by analyzing and processing a character string in a Json format, and after the longitude and latitude coordinates are obtained, the longitude and latitude coordinate system of the key point needs to be converted into a graphic engine coordinate system in the current digital twin scene, and the specific conversion process is as follows:
the longitude and latitude coordinates are approximated to double-precision coordinates to avoid large deviation from correct data;
converting the double-precision coordinates into projection coordinates;
converting the projection coordinates into graphic engine coordinates, and outputting a coordinate array (a, b);
the graphic engine coordinates of all tags are stored in the structural body, in this embodiment, the digital twin city is built in the UE4, and therefore the graphic engine coordinates are the wgs84 coordinate system in the UE 4.
After the coordinate conversion is completed, the road name, the road grade, the starting point, the end point, the break point and the graphic engine coordinate corresponding to each road are stored in a structural body (a data storage structure).
Referring to fig. 2, based on the above embodiment, a road name calculation in a digital twin city further includes:
s2, dividing viewpoint levels, and determining label spacing d and label sizes under different viewpoint levels;
the S2 specifically includes:
s21, dividing viewpoint levels according to the height of the camera from the ground (the height of the viewpoint from the ground), wherein the higher the height of the camera from the ground is, the higher the viewpoint levels are;
and S22, determining label intervals and label font sizes under different viewpoint levels.
Specifically, in the present embodiment, 5 levels are divided according to the height from the ground from the viewpoint: 0 layer, 1 layer, 2 layers, 3 layers, 4 layers, as shown in table 1;
TABLE 1
| Id (level) | 0 | 1 | 2 | 3 | 4 |
| Height from ground (cm) | [0,220000） | [220000,450000） | [450000,650000） | [650000,850000） | [850000,1000000） |
| Font size (pound) | 30 | 80 | 150 | 300 | 600 |
| d（cm） | 30000 | 70000 | 10000 | 200000 | 300000 |
In this embodiment, different tag distances d are set to determine which roads need to generate tags and how many tags under the current viewpoint level, and when the length of a road is smaller than the current tag distance, no tag needs to be generated under the viewpoint level. Thus, the higher the viewpoint level, the fewer the number of tags generated, the larger the font in the scene; the lower the viewpoint level, the greater the number of labels generated and the smaller the fonts in the scene. As shown in fig. 6: the height of a digital twin scene viewpoint shown in the 0 level from the ground is low, the coverage of the scene is small, and although the number of displayed roads is small, the label of each road can be displayed in detail; as shown in fig. 7: the viewpoint of the digital twin scene shown in the 4-level is high from the ground, the coverage of the scene is large, and although the number of displayed roads is large, only the labels of the main roads are displayed.
Based on the above embodiment, a road name calculation in a digital twin city further includes:
s3, acquiring the road sections L between all two adjacent key points Q, and calculating the length of the road sections L;
specifically, as shown in FIG. 4, Q 1 As a starting point of the road, Q 2 Is and Q 1 Adjacent key point, then let Q 1 And Q 2 The section in between is L 12 By analogy, the road section L is obtained 23 ，L 34 …
Acquiring coordinates of key points at two ends of a road section, and calculating the length of the road section according to the distance between the two points;
in this embodiment, the road is divided into a plurality of road segments by the key point, and whether the label needs to be drawn is calculated in each road segment. Since the graphics engine coordinates of each key point (i.e., the starting point, the break point, and the ending point) are obtained through the above steps, the length of the road segment, i.e., the distance between two key points, can be calculated through the coordinates, and the direction from the starting point to the ending point is determined as the label drawing direction.
Based on the above embodiment, a road name calculation in a digital twin city further includes:
sequentially traversing all road sections according to the road direction, and screening out the road sections to be labeled under each viewpoint level; in this embodiment, each viewpoint level needs to be screened, and since the tag intervals of different viewpoint levels are different, the screened road sections are different
Wherein, the S4 specifically includes the following steps:
s40, acquiring a label interval under a current viewpoint level;
s41, traversing road sections according to the road direction;
s42, comparing the length of the current road section with the size of the label space:
and if the length of the current road section is greater than the label distance, marking the road section as the road section to be labeled.
If the length of the current road section is smaller than the label distance, the step S43 is entered;
s43, splicing the current road section with the next road section to obtain a new road section;
s44, comparing the corner degree of the new road section with the critical degree:
when the corner degree is greater than the critical degree, repeating the step S42;
when the corner degree is less than the critical degree, the process proceeds to step S45;
s45, judging whether the current road section is the end point of the road:
if not, repeating the step S43;
and if so, ending the traversal.
Taking the example of fig. 3:
1) to be provided withInitial road section L 12 Starting to traverse in sequence;
2）L 12 as a comparison of the current route section with the tag distance d, due to L 12 ＞d，L 12 Marking the road segment to be drawn, and continuously traversing to L 23 ；
3）L 23 As a comparison of the current road section with the tag distance d, since when L 23 Less than d, mixing L 23 And L 34 Spliced into a new road section L 24 ；
4) Calculating L 24 Angle degree of (1), comparison L 24 Magnitude of corner degree and critical degree:
based on the above embodiment, the method for calculating the corner degree is as follows:
obtaining a road segment L 24 Two-end key point Q 2 、Q 4 According to Q 2 、Q 4 Calculating the included angle between the vectors to obtain L 24 The angle degree of (c).
Specifically, as shown in FIG. 5, Q 2 And Q 4 The angle between the vectors is 173 °.
Preferably, the critical degree is set to 172 °, when the corner degree is greater than 172 °, the road approaches to a straight line, and the road label can be normally displayed, and it should be noted that the critical degree is a custom parameter and can be set according to an actual situation;
due to L 24 When the angle degree is larger than the critical degree, continuing to compare L 24 The size of the distance d from the label;
due to L 24 Greater than the label spacing d, thus will L 24 And marking the road segment to be drawn.
5) Continue traversing L 45 …, until each segment traversal of the current road is completed.
Based on the above embodiment, a road name calculation in a digital twin city further comprises:
s5, calculating the label coordinates of the road section of the label to be drawn under each level in sequence according to the label distance, and storing, wherein the method specifically comprises the following steps:
s51, acquiring road section L 24 Two-end key point Q 2 、Q 4 The coordinates of (a); and will approachKey point Q of road starting point 2 Set to start, key point Q near the end of the road 4 Is set as end;
s52, determining a point of the start coordinate and the label interval as a label coordinate;
s53, taking the coordinates of the label as a start, and calculating the distance between the start and the end;
s54, comparing the distance with the label distance d:
when the distance is greater than the tag spacing d, repeating step S51;
and when the distance is smaller than the label distance d, finishing the calculation and storing all label coordinates.
In this embodiment, L is 12 Road sections are taken as examples: q 1 Is start, Q2 is end, and the point of start + d is determined as the tag position P 1 ；
Then with P 1 Is start, Q 2 For end, calculate P 1 The distance from end;
when the distance is greater than d, then the distance start (P) will be 1 ) The point of + d is determined as the label P 2 And so on until the label P n When the distance from the end is less than d, jumping into the next road section L 24 。
On the section L 24 In, Q 2 Is start, Q 4 For end, determine the point of start + d as the tag position P n+1 ,
Then using P n+1 Is start, Q 2 For end, calculate P n+1 The distance from end;
when the distance is greater than d, then the distance start (P) will be n+1 ) The point of + d is determined as the label P n+2 And so on until the label P 2n And if the distance from the end is less than d, jumping into the next road section.
Example 2
Referring to fig. 8, an embodiment of the present invention provides a system for calculating road names in digital twin cities, where the system includes:
a data acquisition module: the system comprises a coordinate acquisition unit, a coordinate acquisition unit and a coordinate processing unit, wherein the coordinate acquisition unit is used for acquiring the coordinates of key points of a road, and the key points comprise a starting point and an end point of the road;
a viewpoint level determination module: the system is used for determining the current viewpoint level and the critical degree, and acquiring the label space and the label size under the current viewpoint level;
a road section calculation module: the system is used for dividing the road into a plurality of road sections by taking the key points as dividing points, and calculating the length of each road section;
a screening module: the system is used for sequentially traversing all road sections according to the road direction and screening out the road sections of which the labels are to be drawn;
a tag position calculation module: and the label coordinates of the road sections to be labeled are sequentially calculated according to the label distance and stored.
In addition, the method for calculating the road name in the digital twin city according to the embodiment of the present invention may be implemented by a device for calculating the road name in the digital twin city.
A road name calculating device in a digital twin city may include a processor and a memory storing computer program instructions.
In particular, the processor may include a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits that may be configured to implement embodiments of the present invention.
The memory may include mass storage for data or instructions. By way of example, and not limitation, memory may include a Hard Disk Drive (HDD), floppy Disk Drive, flash memory, optical Disk, magneto-optical Disk, magnetic tape, or Universal Serial Bus (USB) Drive or a combination of two or more of these. Memory may include removable or non-removable (or fixed) media, where appropriate. The memory may be internal or external to the data processing apparatus, where appropriate. In a particular embodiment, the memory is non-volatile solid-state memory. In a particular embodiment, the memory includes Read Only Memory (ROM). Where appropriate, the ROM may be mask-programmed ROM, Programmable ROM (PROM), Erasable PROM (EPROM), Electrically Erasable PROM (EEPROM), Electrically Alterable ROM (EAROM), or flash memory or a combination of two or more of these.
The processor realizes the road name calculation method in the digital twin city in any one of the above embodiments by reading and executing the computer program instructions stored in the memory.
In one example, the road name computing device in the digital twin city may further include a communication interface and a bus. As shown in the road name calculation in the figure twin city, the processor, the memory and the communication interface are connected through the bus and complete mutual communication.
The communication interface is mainly used for realizing communication among modules, devices, units and/or equipment in the embodiment of the invention.
The bus includes hardware, software, or both that couple components of the road name computing device in the digital twin city to each other. By way of example, and not limitation, a bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industrial Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industrial Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus or a combination of two or more of these. A bus may include one or more buses, where appropriate. Although specific buses have been described and illustrated with respect to embodiments of the invention, any suitable buses or interconnects are contemplated by the invention.
In addition, in combination with the method for calculating the road name in the digital twin city in the above embodiment, the embodiment of the present invention may be implemented by providing a computer-readable storage medium. The computer readable storage medium having stored thereon computer program instructions; the computer program instructions, when executed by the processor, implement a method of road name calculation in a digital twin city as in any of the embodiments described above.
In summary, the method, the computer-readable storage medium, the device and the system for calculating the road name in the digital twin city provided by the embodiments of the present invention realize the calculation of the road name in the digital twin city.
It is to be understood that the invention is not limited to the specific arrangements and instrumentality described above and shown in the drawings. A detailed description of known methods is omitted herein for the sake of brevity. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present invention are not limited to the specific steps described and illustrated, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps, after comprehending the spirit of the present invention.
The functional blocks shown in the above-described structural block diagrams may be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, plug-in, function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine-readable medium or transmitted by a data signal carried in a carrier wave over a transmission medium or a communication link. A "machine-readable medium" may include any medium that can store or transfer information. Examples of a machine-readable medium include electronic circuits, semiconductor memory devices, ROM, flash memory, Erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, Radio Frequency (RF) links, and so forth. The code segments may be downloaded via computer networks such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this patent describe some methods or systems based on a series of steps or devices. However, the present invention is not limited to the order of the above steps, that is, the steps may be performed in the order mentioned in the embodiments, may be performed in an order different from the order in the embodiments, or may be performed at the same time.
As described above, only the specific embodiments of the present invention are provided, and it can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the module and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again. It should be understood that the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the present invention, and these modifications or substitutions should be covered within the scope of the present invention.
Claims (9)
1. A method for calculating road names in a digital twin city, the method comprising:
s1, obtaining coordinates of key points of a road, wherein the key points comprise a starting point and an end point of the road;
s2, dividing viewpoint levels, and determining label intervals and label sizes under different viewpoint levels;
s3, dividing the road into a plurality of road sections by taking the key points as dividing points, and calculating the length of each road section;
s4, sequentially traversing all road sections according to the road direction, and screening out the road sections to be labeled under each viewpoint level;
and S5, sequentially calculating the label coordinates of the label sections to be drawn under each viewpoint level according to the label intervals, and storing the label coordinates.
2. The method of claim 1, wherein the key points are selected from a center line of a road and represent a road direction, and the key points further include a break point at a corner of the road.
3. The method for calculating a road name in a digital twin city according to claim 1, wherein the S2 specifically includes:
s21, dividing viewpoint levels according to the height of the camera from the ground, wherein the higher the height of the camera from the ground is, the higher the viewpoint levels are;
and S22, determining label intervals and label font sizes under different viewpoint levels.
4. The method according to claim 1, wherein the calculating the length of each road segment specifically comprises:
and obtaining coordinates of key points at two ends of the road section, and calculating the length of the road section according to the coordinates between the two points.
5. The method for calculating road names in digital twin cities according to claim 1, wherein all road segments are traversed in sequence according to a road direction, and a road segment to be labeled is screened out, wherein the S4 specifically comprises:
s41, traversing road sections according to the road direction;
s42, comparing the length of the current road section with the size of the label space:
if the length of the current road section is larger than the label distance, marking the road section as the road section to be labeled, and repeating the step S41;
if the length of the current road section is smaller than the label distance, the step S43 is carried out;
s43, splicing the current road section and the next road section to obtain a new road section;
s44, comparing the corner degree and the critical degree of the new road section:
when the corner degree is greater than the critical degree, repeating the step S42;
when the corner degree is less than the critical degree, the step S45 is entered;
s45, judging whether the current road section is the end point of the road:
if not, repeating the step S43;
and if so, ending the traversal.
6. The method for calculating road names in digital twin cities according to claim 5, wherein the method for calculating the number of corner degrees of a road section is:
and key points at two ends of the road section are obtained, and the corner degree of the road section is calculated according to the included angle between the two key point vectors.
7. The method for calculating road names in digital twin cities according to claim 1, wherein the step S5 specifically includes:
s51, obtaining coordinates of key points at two ends of a to-be-drawn label road section, setting the key point close to the starting point of the road as start, and setting the key point close to the end point of the road as end;
s52, determining a point of the start coordinate and the label space as a label coordinate;
s53, taking the coordinates of the label as a start, and calculating the distance between the start and the end;
s54, comparing the distance with the distance between the labels:
when the distance is greater than the tag pitch, repeating step S52;
and when the distance is smaller than the label distance, finishing the calculation and storing all label coordinates.
8. A road name calculating apparatus in a digital twin city, comprising: at least one processor, at least one memory, and computer program instructions stored in the memory that, when executed by the processor, implement the method of any of claims 1-7.
9. A road name calculation system in a digital twin city, comprising:
a data acquisition module: the system comprises a coordinate acquisition unit, a coordinate acquisition unit and a control unit, wherein the coordinate acquisition unit is used for acquiring the coordinates of key points of a road, and the key points comprise a starting point and an end point of the road;
a viewpoint level determination module: the system comprises a database, a database server and a server, wherein the database is used for determining a current viewpoint level and a critical degree and acquiring a label interval and a label size under the current viewpoint level;
a road section calculation module: the system is used for dividing the road into a plurality of road sections by taking the key points as dividing points, and calculating the length of each road section;
a screening module: the system is used for sequentially traversing all road sections according to the road direction and screening the road sections to be labeled;
a tag location calculation module: and the system is used for sequentially calculating and storing the label coordinates of the road section of the label to be drawn according to the label distance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210716636.0A CN114791940B (en) | 2022-06-23 | 2022-06-23 | Road name calculation method, device and system in digital twin city |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210716636.0A CN114791940B (en) | 2022-06-23 | 2022-06-23 | Road name calculation method, device and system in digital twin city |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114791940A true CN114791940A (en) | 2022-07-26 |
| CN114791940B CN114791940B (en) | 2022-09-27 |
Family
ID=82462913
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210716636.0A Active CN114791940B (en) | 2022-06-23 | 2022-06-23 | Road name calculation method, device and system in digital twin city |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114791940B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115424435A (en) * | 2022-08-10 | 2022-12-02 | 阿里巴巴（中国）有限公司 | Cross-link road identification method and cross-link road identification method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6424933B1 (en) * | 2000-03-17 | 2002-07-23 | Vicinity Corporation | System and method for non-uniform scaled mapping |
| CN104280035A (en) * | 2013-07-08 | 2015-01-14 | 厦门雅迅网络股份有限公司 | Method for elimination of electronic map interest point label covering of roads |
| CN104736971A (en) * | 2012-10-30 | 2015-06-24 | 大众汽车有限公司 | Apparatus, method and computer program for spatially representing a digital map section |
| CN110069580A (en) * | 2017-09-07 | 2019-07-30 | 腾讯科技（深圳）有限公司 | Road marks display methods, device, electronic equipment and storage medium |
| CN111858793A (en) * | 2020-06-09 | 2020-10-30 | 北京百度网讯科技有限公司 | Map road marking processing method and device, electronic equipment and storage medium |
| CN113362420A (en) * | 2021-06-02 | 2021-09-07 | 北京百度网讯科技有限公司 | Road marking generation method, device, equipment and storage medium |
| CN113495931A (en) * | 2020-03-19 | 2021-10-12 | 华为技术有限公司 | Map label presenting method |
-
2022
- 2022-06-23 CN CN202210716636.0A patent/CN114791940B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6424933B1 (en) * | 2000-03-17 | 2002-07-23 | Vicinity Corporation | System and method for non-uniform scaled mapping |
| CN104736971A (en) * | 2012-10-30 | 2015-06-24 | 大众汽车有限公司 | Apparatus, method and computer program for spatially representing a digital map section |
| CN104280035A (en) * | 2013-07-08 | 2015-01-14 | 厦门雅迅网络股份有限公司 | Method for elimination of electronic map interest point label covering of roads |
| CN110069580A (en) * | 2017-09-07 | 2019-07-30 | 腾讯科技（深圳）有限公司 | Road marks display methods, device, electronic equipment and storage medium |
| CN113495931A (en) * | 2020-03-19 | 2021-10-12 | 华为技术有限公司 | Map label presenting method |
| CN111858793A (en) * | 2020-06-09 | 2020-10-30 | 北京百度网讯科技有限公司 | Map road marking processing method and device, electronic equipment and storage medium |
| CN113362420A (en) * | 2021-06-02 | 2021-09-07 | 北京百度网讯科技有限公司 | Road marking generation method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 蒋腾平: ""功能性规则约束下的三维点云道路设施语义标注"", 《南京师范大学学报（工程技术版）》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115424435A (en) * | 2022-08-10 | 2022-12-02 | 阿里巴巴（中国）有限公司 | Cross-link road identification method and cross-link road identification method |
| CN115424435B (en) * | 2022-08-10 | 2024-01-23 | 阿里巴巴（中国）有限公司 | Training method of cross link road identification network and method for identifying cross link road |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114791940B (en) | 2022-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112598762B (en) | Three-dimensional lane line information generation method, device, electronic device, and medium | |
| JP5041638B2 (en) | Method for transmitting location information of digital map and device used therefor | |
| CN111950555B (en) | Text recognition method and device, readable medium and electronic equipment | |
| CN111444918A (en) | Image inclined text line detection model training and image inclined text line detection method | |
| CN112328731B (en) | Vehicle lane level positioning method and device, electronic equipment and computer readable medium | |
| CN112050820B (en) | Road matching method, device, electronic equipment and readable storage medium | |
| CN114791940B (en) | Road name calculation method, device and system in digital twin city | |
| CN114782588B (en) | Real-time drawing method and system for road names in digital twin city | |
| CN112798004A (en) | Vehicle positioning method, device, equipment and storage medium | |
| CN112712036A (en) | Traffic sign recognition method and device, electronic equipment and computer storage medium | |
| CN110287817B (en) | Target recognition and target recognition model training method and device and electronic equipment | |
| CN111739043A (en) | Parking space drawing method, device, equipment and storage medium | |
| CN110796060A (en) | Method, device and equipment for determining high-speed driving route and storage medium | |
| CN114780666B (en) | Road label optimization method and system in digital twin city | |
| JP2016211900A (en) | Information processing apparatus, route search method, traffic information data, and computer program | |
| CN112651393B (en) | Method, device, equipment and storage medium for processing interest point data | |
| CN113055239B (en) | Data display method, device, equipment and medium | |
| CN113449687A (en) | Identification method and device for point of interest entrance and exit and electronic equipment | |
| CN113761169A (en) | Price identification method and device | |
| CN114199228B (en) | Map data generation method, map data generation device, electronic equipment and storage medium | |
| CN117974635B (en) | Cable channel detection method, device, electronic equipment and computer readable medium | |
| CN113542800B (en) | Video picture scaling method, device and terminal equipment | |
| CN108509635B (en) | Method and apparatus for generating information | |
| CN109300304B (en) | Method and device for determining historical road conditions | |
| CN115439631A (en) | Three-dimensional scanning data processing method and device, electronic 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |