CN114353757B - Automatic extraction algorithm for geographical entities of road sections of intersections - Google Patents
Automatic extraction algorithm for geographical entities of road sections of intersections Download PDFInfo
- Publication number
- CN114353757B CN114353757B CN202210057115.9A CN202210057115A CN114353757B CN 114353757 B CN114353757 B CN 114353757B CN 202210057115 A CN202210057115 A CN 202210057115A CN 114353757 B CN114353757 B CN 114353757B
- Authority
- CN
- China
- Prior art keywords
- edges
- road
- triangle
- triangulation network
- edge
- 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
Landscapes
- Processing Or Creating Images (AREA)
- Instructional Devices (AREA)
Abstract
The invention discloses an automatic extraction algorithm for geographical entities of road sections of intersections, which comprises the following steps: s1, constructing an irregular TIN triangular network: constructing an irregular triangular network TIN by using road intersection surface data elements; s2, extracting a 3R triangle: comparing and analyzing characteristics of the road intersection surface data in the intersections and other positions of the triangulation network, and extracting a 3R triangle according to the type of edges in the triangulation network, wherein three edges of the 3R triangle are Regular edges; s3, traversing three edges of the 3R triangle: traversing three sides of the 3R triangle and judging whether each Regular Edge has a Soft Edge corresponding to the Regular Edge; on the basis of the TIN triangulation network, the characteristics of the road triangulation network are analyzed, an automatic intersection section geographic entity extraction algorithm is provided, the intersection surface of the road surface is automatically extracted, compared with other means, the time for manual surface construction is shortened, the data processing efficiency is improved, and the method has certain production and application values.
Description
Technical Field
The invention relates to the technical field of basic surveying and mapping photogrammetry and remote sensing, in particular to an automatic extraction algorithm for geographical entities at road sections of intersections.
Background
The basic mapping refers to establishing a nationwide uniform mapping benchmark and mapping system, carrying out basic aerial photography, acquiring remote sensing data of basic geographic information, measuring and updating national basic scale maps, image maps and digital products, and establishing and updating a basic geographic information system, and has public welfare and foundation. The existing basic mapping system can basically summarize 3S +4D, namely a 3S technical framework consisting of a global positioning system GPS, a geographic information system GIS and a remote sensing RS, and a 4D product system consisting of a digital line drawing DLG, a digital ortho-image DOM, a digital elevation model DEM and a digital grid map DRG.
With the development of the economic society and the continuous progress of technologies such as the Internet of things and big data, higher requirements are put forward on basic surveying and mapping results. The live-action three-dimension is a digital virtual space for real, three-dimensional and time-sequence reflection and expression of human production, life and ecological space, is a novel basic mapping standardized product, and is an important component of national novel infrastructure construction.
At present, the generation of road intersection surfaces mainly depends on manual surface construction, the workload is large, the situation that the positions of intersections can be quickly found through constructing a TIN triangle is found in actual production, the intersection range is divided by solving the perpendicular line from the end point of a regular edge to a soft edge, and an automatic geographic entity extraction algorithm of an intersection road section is provided through continuous research.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides an automatic intersection road segment geographic entity extraction algorithm, which can solve the problem of large workload of road intersection surface generation.
The technical scheme adopted by the invention for solving the technical problem is as follows:
the automatic intersection section geographic entity extraction algorithm comprises the following steps:
s1, constructing an irregular triangular net: constructing an irregular triangular net by using road intersection surface data elements;
s2, extracting a 3R triangle: comparing and analyzing characteristics of the road intersection surface data in the intersection and other positions of the triangular network, and extracting a 3R triangle according to the type of edges in the triangular network, wherein three edges of the 3R triangle are regular edges;
s3, traversing three edges of the 3R triangle: traversing three sides of the 3R triangle and judging whether each regular side has a corresponding soft side;
s4, solving the corresponding vertical point on the soft edge: when the regular edge has a corresponding soft edge, solving the vertical point of the end point of the regular edge falling on the soft edge and reserving all the vertical points;
s5, clockwise ordering configuration: and adding the vertical points obtained in the step S3 to three vertexes of the 3R triangle, and forming the road surface in a clockwise sequence.
Further, in the step S1, the irregular triangulation network is composed of vertices, edges and triangles, where the types of the edges include hard edges and non-hard edges, the hard edges refer to edges coinciding with line data participating in construction of the irregular triangulation network, and other edges are non-hard edges;
further, in the step S2, the irregular triangular meshes of the road intersection surface data at the intersection position all have 3R triangles;
further, in the step S4, when the regular edge has no corresponding soft edge, skipping is performed;
further, before step S1, data preprocessing operations of format conversion and coordinate conversion need to be performed on the road surface data to meet the standard that the road surface forms an irregular triangulation network.
Compared with the prior art, the invention has the beneficial effects that: the automatic extraction algorithm of the geographical entities of the road sections analyzes the characteristics of the road triangulation network on the basis of the irregular triangulation network, provides the automatic extraction algorithm of the geographical entities of the road sections, and automatically extracts the road surface of the road surface.
Drawings
FIG. 1 is a schematic diagram of the automatic extraction algorithm of geographical entities at a road section of an intersection according to the present invention;
FIG. 2 is a first schematic diagram of the present invention;
FIG. 3 is a second schematic illustration of the present invention;
FIG. 4 is a third schematic diagram of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. 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 order to further understand the contents, features and effects of the present invention, the following embodiments are described in detail with reference to the accompanying drawings.
The automatic intersection road segment geographic entity extraction algorithm of the invention is described in detail below with reference to fig. 1-4:
as shown in the attached figure 1, the automatic intersection section geographic entity extraction algorithm comprises the following steps:
s1, constructing an irregular triangular net: constructing an irregular triangular net by using road intersection surface data elements;
in step S1, the road surface elements, as well as the cut elements for defining the data area, the replacement elements for defining the area by the constant Z value, and the erasure elements for indicating the internal area where no data exists are specified as discrete multipoint and partition lines; constructing an irregular triangulation network for road surface data, and defining roles of input elements in the surface of the irregular triangulation network; the valid options depend on the geometry of the input elements; points and multipoint elements can be defined as Mass _ Points and are used for forming elevation values stored in the form of irregular triangulation network data nodes; line elements can be designated as Soft _ Line or partition lines by designating Mass _ Points or Hard _ Line; by specifying Hard _ Clip or Soft _ Clip, a face element can represent an interpolation boundary; by selecting Hard _ Erase or Soft _ Erase, the face element may represent an internal portion that does not contain data; by specifying Hard _ Replace or Soft _ Replace, a face element can represent an area of constant height; in addition, by specifying Hardvalue _ Fill or Softvalue _ Fill, the face can also be used to assign integer property values;
s2, extracting a 3R triangle: comparing and analyzing the characteristics of the road intersection surface data in the triangular network at intersections and other positions, extracting a 3R triangle according to the type of edges in the triangular network, wherein three edges of the 3R triangle are regular edges, and as shown in figure 2, the position of the extracted triangle is the position of an intersection section;
s3, traversing three edges of the 3R triangle: traversing three sides of the 3R triangle and judging whether each regular side has a corresponding soft side;
s4, solving the corresponding vertical point on the soft edge: when the regular edge has a corresponding soft edge, solving the vertical point of the end point of the regular edge falling on the soft edge and reserving all the vertical points;
s5, clockwise ordering configuration: and adding the vertical points obtained in the step S3 to the three vertexes of the 3R triangle, and forming the intersection surface in a clockwise sequencing manner, specifically, forming the vertical points into a point sequence, sequencing the point sequence in the clockwise direction, and forming the intersection surface, wherein as shown in the attached figures 3 and 4, the polygonal position in the road is the formed intersection surface.
Preferably, in step S1, the irregular triangulation network is composed of vertices, edges and triangles, where the types of the edges include hard edges and non-hard edges, where a hard edge refers to an edge coinciding with line data participating in construction of the irregular triangulation network, and other edges are non-hard edges;
preferably, in step S2, the road surface data has 3R triangles in the irregular triangulation network of the intersection;
preferably, in the step S4, when the regular edge has no corresponding soft edge, skipping is performed;
preferably, before step S1, data preprocessing operations of format conversion and coordinate conversion need to be performed on the road surface data to meet the standard of the road surface irregular triangulation network;
the method specifically comprises the following steps: and in the aspect of format conversion, the interconversion among the formats such as MDB, GDB, SHP, CSV and the like is completed. In the coordinate transformation, the transformation from the WGS-84 coordinate system to the 2000 national geodetic coordinate system is mainly considered, and as the mainstream coordinate system of the mapping data, the use of the geographic coordinate system to create the TIN is avoided, because the Delaunay triangulation rule cannot be effectively implemented when XY units are expressed in spherical coordinates.
In conclusion, the automatic extraction algorithm for geographical entities of the road sections analyzes the characteristics of the road triangulation network on the basis of the irregular triangulation network, provides the automatic extraction algorithm for geographical entities of the road sections, and automatically extracts the road surface of the road surface.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Claims (1)
1. The automatic intersection road section geographic entity extraction algorithm is characterized by comprising the following steps of:
s1, constructing an irregular triangular net: constructing an irregular triangular net by using road intersection surface data elements; in step S1, the road surface elements, as well as the trimming element for defining the data area, the replacement element for defining the area by the constant Z value, and the erasing element for indicating the internal area where no data exists are specified as discrete multipoint and partition line; constructing an irregular triangulation network for the road surface data, and defining roles of input elements in the surface of the irregular triangulation network; the valid options depend on the geometry of the input elements; points and multipoint elements can be defined as Mass _ Points and are used for forming elevation values stored in the form of irregular triangulation network data nodes; line elements can be designated as Soft _ Line or partition lines by designating Mass _ Points or Hard _ Line; by specifying Hard _ Clip or Soft _ Clip, a face element can represent an interpolation boundary; by selecting Hard _ Erase or Soft _ Erase, the face element may represent an internal portion that does not contain data; by specifying Hard _ Replace or Soft _ Replace, a face element can represent a region of constant height; in addition, by specifying Hardvalue _ Fill or Softvalue _ Fill, the face can also be used to assign integer property values; in the step S1, the irregular triangulation network is composed of vertices, edges, and triangles, where the types of the edges include hard edges and non-hard edges, where a hard edge refers to an edge that coincides with line data participating in construction of the irregular triangulation network, and other edges are non-hard edges;
s2, extracting a 3R triangle: comparing and analyzing characteristics of the road intersection surface data in the intersection and other positions of the triangulation network, and extracting a 3R triangle according to the type of edges in the triangulation network, wherein three edges of the 3R triangle are regular edges; the irregular triangular nets of the road intersection surface data at the intersection positions all have 3R triangles;
s3, traversing three edges of the 3R triangle: traversing three sides of the 3R triangle and judging whether each regular side has a corresponding soft side; skipping when the regular edge has no corresponding soft edge;
s4, solving the corresponding vertical point on the soft edge: when the regular edge has a corresponding soft edge, solving the vertical point of the end point of the regular edge falling on the soft edge and reserving all the vertical points;
s5, clockwise ordering configuration: adding the vertical points obtained in the step S3 to three vertexes of the 3R triangle, and forming a road surface in a clockwise sequencing manner, wherein the vertical points form a point sequence, the point sequence is sequenced in the clockwise direction to form the road surface, and the polygonal position in the road is the formed road surface;
before the step S1, data preprocessing operations of format conversion and coordinate conversion need to be performed on the road surface data to meet the standard that the road surface forms the irregular triangulation network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210057115.9A CN114353757B (en) | 2022-01-19 | 2022-01-19 | Automatic extraction algorithm for geographical entities of road sections of intersections |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210057115.9A CN114353757B (en) | 2022-01-19 | 2022-01-19 | Automatic extraction algorithm for geographical entities of road sections of intersections |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114353757A CN114353757A (en) | 2022-04-15 |
| CN114353757B true CN114353757B (en) | 2022-10-04 |
Family
ID=81091403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210057115.9A Active CN114353757B (en) | 2022-01-19 | 2022-01-19 | Automatic extraction algorithm for geographical entities of road sections of intersections |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114353757B (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10307024A (en) * | 1996-06-25 | 1998-11-17 | Kumagai Gumi Co Ltd | Control apparatus for earthwork amount |
| EP2518445B1 (en) * | 2011-04-29 | 2019-02-27 | Harman Becker Automotive Systems GmbH | Database for a navigation device, method of outputting a three-dimensional representation of a terrain and method of generating a database |
| CN108717729A (en) * | 2018-05-25 | 2018-10-30 | 武汉大学 | A kind of online method for visualizing of landform multi-scale TIN of the Virtual earth |
| CN112598724B (en) * | 2021-03-01 | 2021-06-01 | 武大吉奥信息技术有限公司 | Improved TIN-based vector data center line extraction method |
-
2022
- 2022-01-19 CN CN202210057115.9A patent/CN114353757B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN114353757A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105989198B (en) | Highway parametrization method for automatic modeling and system based on BIM | |
| KR101548647B1 (en) | Processor for visualization of three dimensional geo-spatial information | |
| CN110659385B (en) | Fusion method of multi-channel video and three-dimensional GIS scene | |
| CN112017285B (en) | Method for accurately fitting terrain to strip-shaped model in three-dimensional GIS (geographic information System) in real time | |
| CN108198143B (en) | Three-dimensional terrain crack eliminating method for removing LoD (LoD) level constraint | |
| CN112785708A (en) | Method, equipment and storage medium for building model singleization | |
| CN114117702A (en) | Point cloud-based automatic reverse modeling method for power transmission line | |
| CN115082699B (en) | Contour shape extraction method and device, electronic equipment and storage medium | |
| CN110765542A (en) | Lightweight method of high-precision digital elevation model | |
| CN109872390B (en) | Organization method of massive three-dimensional models | |
| JP4619504B2 (en) | 3D digital map generator | |
| CN114138265B (en) | Visualization method based on digital twinning | |
| CN114353757B (en) | Automatic extraction algorithm for geographical entities of road sections of intersections | |
| Forlani et al. | Building reconstruction and visualization from lidar data | |
| CN116128903B (en) | Smart city three-dimensional scene tiled segmentation method | |
| Elberink et al. | 3D modelling of topographic objects by fusing 2D maps and lidar data | |
| CN114463494A (en) | Automatic topographic feature line extracting algorithm | |
| CN115033972A (en) | Method and system for unitizing building main body structures in batches and readable storage medium | |
| Komadina et al. | Automated 3D urban landscapes visualization using open data sources on the example of the city of Zagreb | |
| CN115342779A (en) | Mapping method of urban ground and underground forms based on mapping model map | |
| Elberink et al. | Adding the third dimension to a topographic database using airborne laser scanner data | |
| Steed et al. | Data visualization within urban models | |
| CN116310262B (en) | Planar entity and inclined three-dimensional model fusion method, system, medium and equipment | |
| Gruber et al. | Urban data management—A modern approach | |
| Schilling | 3D Spatial Data Infrastructures for Web-Based Visualization |
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 |