CN109031235B - Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity - Google Patents
Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity Download PDFInfo
- Publication number
- CN109031235B CN109031235B CN201810903019.5A CN201810903019A CN109031235B CN 109031235 B CN109031235 B CN 109031235B CN 201810903019 A CN201810903019 A CN 201810903019A CN 109031235 B CN109031235 B CN 109031235B
- Authority
- CN
- China
- Prior art keywords
- edge
- reflectivity
- contour line
- data
- point
- 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
- 238000002310 reflectometry Methods 0.000 title claims abstract description 95
- 238000000034 method Methods 0.000 title claims abstract description 22
- IYLGZMTXKJYONK-ACLXAEORSA-N (12s,15r)-15-hydroxy-11,16-dioxo-15,20-dihydrosenecionan-12-yl acetate Chemical compound O1C(=O)[C@](CC)(O)C[C@@H](C)[C@](C)(OC(C)=O)C(=O)OCC2=CCN3[C@H]2[C@H]1CC3 IYLGZMTXKJYONK-ACLXAEORSA-N 0.000 claims description 24
- IYLGZMTXKJYONK-UHFFFAOYSA-N ruwenine Natural products O1C(=O)C(CC)(O)CC(C)C(C)(OC(C)=O)C(=O)OCC2=CCN3C2C1CC3 IYLGZMTXKJYONK-UHFFFAOYSA-N 0.000 claims description 24
- 239000003086 colorant Substances 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 230000000694 effects Effects 0.000 abstract description 3
- 230000002265 prevention Effects 0.000 abstract description 2
- 239000010410 layer Substances 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 238000000605 extraction Methods 0.000 description 4
- 238000007796 conventional method Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000007781 pre-processing Methods 0.000 description 2
- MCSXGCZMEPXKIW-UHFFFAOYSA-N 3-hydroxy-4-[(4-methyl-2-nitrophenyl)diazenyl]-N-(3-nitrophenyl)naphthalene-2-carboxamide Chemical compound Cc1ccc(N=Nc2c(O)c(cc3ccccc23)C(=O)Nc2cccc(c2)[N+]([O-])=O)c(c1)[N+]([O-])=O MCSXGCZMEPXKIW-UHFFFAOYSA-N 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 239000002356 single layer Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S7/00—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00
- G01S7/02—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00 of systems according to group G01S13/00
- G01S7/41—Details of systems according to groups G01S13/00, G01S15/00, G01S17/00 of systems according to group G01S13/00 using analysis of echo signal for target characterisation; Target signature; Target cross-section
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention provides a method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity. The method is beneficial to realizing global sharing of radar product data, provides effective decision support for disaster reduction and prevention of meteorological disasters, and has good social and economic effects; meanwhile, the data acquisition has high efficiency and high precision, is convenient for manual interpretation and analysis, and can shorten the response time of relevant departments to disasters.
Description
The technical field is as follows:
the invention relates to a method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity.
Background art:
the conventional radar basic reflectivity data is basically in a two-dimensional plane image form, the radar single-layer scanning data is essentially distributed in a three-dimensional space, and the three-dimensional contour line data is generally calculated based on three-dimensional regular grid data. In the extraction process, the radar data needs to be subjected to three-dimensional regular lattice localization, then reflectivity data corresponding to each grid is obtained through a large amount of interpolation, and then contour line calculation is carried out; the process needs a large amount of interpolation calculation on original detection data of the radar, the spatial distribution of the regular grid and the radar scanning mode have great difference, ambiguity exists when the quadrilateral grid judges the contour line, and extra calculation is needed to process the problems. The method needs a large amount of preprocessing calculation before the contour line is extracted, and brings obstruction to the rapid extraction of the three-dimensional contour line.
The invention content is as follows:
the method directly utilizes the original data points detected by the radar to construct the triangular mesh so as to quickly acquire the three-dimensional contour line data of the radar basic reflectivity with the vector characteristics.
The specific technical scheme of the invention is as follows:
a method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity comprises the following steps:
(1) acquiring scanning layer data of a preset elevation angle from radar reflectivity data to be processed, calculating the spatial position coordinates of ith database data on a scanning line of each azimuth angle in the scanning layer, and forming a radar data point structure corresponding to each database data on each scanning line, wherein i represents any data point on the scanning line, and the number of data points on the scanning line is more than or equal to 1 and less than or equal to i;
(2) in the radar data point structure, two points of the i-th and i + 1-th library positions which are adjacent to each other are sequentially and respectively taken on two adjacent scanning lines, the total four points are sequentially connected and used as vertexes to construct a quadrilateral surface patch, and then all quadrilateral surface patches are constructed to obtain a quadrilateral grid;
(3) connecting a diagonal line to each quadrilateral patch, and dividing each quadrilateral patch into two triangles to form a triangular mesh;
(4) in the triangular mesh, a connecting line of two data points which are farthest away from the center of the radar on each adjacent scanning line forms the boundary of the triangular mesh; for any reflectivity factor Z in a preset reflectivity factor set, finding an initial edge on the boundary of a triangular grid, enabling the reflectivity factor Z value to be between the reflectivity values of two vertexes of the initial edge, and when the initial edge exists, firstly performing non-closed contour line search and then performing closed contour line search; when the initial edge does not exist, performing closed contour line search to obtain a contour line corresponding to the reflectivity factor Z; and repeating the steps to complete contour line search corresponding to all the reflectivity factors in the preset reflectivity factor set, and acquiring three-dimensional contour line data of the basic reflectivity of the radar.
The invention is further designed in that:
in the step 1, the longitude and latitude coordinates of the center of the radar are set as follows: (radarLX, radarLY, radarHKm), on a scanning line of the radar with a certain scanning layer elevation angle being elevaAngle and an azimuth angle being AZ _ angle, the first library distance is firstGate, and the library length is W, the spatial longitude and latitude position coordinate of the ith library data is calculated according to the following formula (wherein, i is more than or equal to 1 and less than or equal to the number of data points on the scanning line):
xDis = ((firstGate + (i-1) * W) * cos(elevaAngle)) * sin(AZ_angle) （1）
yDis = ( (firstGate + (i-1) * W)* cos(elevaAngle)) *cos(AZ_angle) （2）
LY = radarLY + yDis/(π * EarthRadius )*180 （3）
LX = radarLX + xDis/(π * EarthRadius*cos(LY*π/180))*180 （4）
disKM = firstGate + (i-1) * W； （5）
H =radarHKm+disKM *sin(elevaAngle)+disKM/(1.21*2* EarthRadius) （6）
wherein, xDis is the horizontal distance of ith storehouse data subaerial projection distance radar center, and yidis is the vertical distance of ith storehouse data subaerial projection distance radar center, and LY is the latitude coordinate of ith storehouse data, and LX is the longitude coordinate of ith storehouse data, and H is the altitude coordinate of ith storehouse data, and disKM is the spatial distance of current data point distance radar center, and Earth radius is the earth radius, gets: 6371.004 km.
In the step 3, when each quadrilateral surface patch is divided into two triangles by diagonal lines, the dividing directions of the diagonal lines are consistent.
And 4, endowing corresponding colors to the obtained basic reflectivity contour line of the scanning layer according to the reflectivity factor Z value.
The non-closed contour line search in step 4 comprises the following steps:
A. according to two vertexes of the initial edge found from the boundary, calculating point coordinates equal to the Z value of the reflectivity factor on the initial edge through interpolation, adding the point coordinates into a point set of the contour line, then searching a new edge which also meets the conditions on the other two edges of the triangle where the initial edge is located, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the new edge as the current initial edge, performing interpolation calculation on the two vertexes of the new edge to obtain point coordinates equal to the Z value of the reflectivity factor on the edge, adding the point coordinates into the point set of the contour line, and removing the current triangle from the triangle to be searched;
B. finding a triangle adjacent to the new edge, continuously searching a second new edge which also meets the condition in the other two edges of the triangle, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the current initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
C. b, repeating the step B until the point coordinates with the same reflectivity factor Z value are located on the boundary, and finishing searching the isoline point set of the non-closed isoline; sequentially connecting the coordinates of each point in the point set of the contour line to form a non-closed contour line;
D. and continuously searching another initial edge from the boundary which is not removed, and repeating the steps A-C until the initial edge can not be found in the boundary, and finishing all the non-closed contour line searches corresponding to the reflectivity factor Z.
Step 4 the search for a closed contour comprises the following steps:
a. searching any edge meeting the conditions from the triangle which is not removed as an initial edge, namely, the value of the reflectivity factor Z is between the reflectivity values of two vertexes of the initial edge, and ending the closed contour line search if the initial edge cannot be found; if the initial edge meeting the conditions is found, entering the next step;
b. carrying out interpolation calculation on two vertexes of the found initial edge to obtain a point coordinate equal to the value of the reflectivity factor Z on the edge, and adding the point coordinate into the isoline point set; then, searching a new edge which is in accordance with the same condition on the other two edges of any triangle where the initial edge is positioned, namely, the Z value is between the reflectivity values of the two vertexes of the edge, taking the new edge as the current initial edge, carrying out interpolation calculation on the two vertexes of the new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour point set, and removing the current triangle from the triangle to be searched;
c. taking the new edge as an initial edge to search for another triangle, continuously searching for a second new edge which also meets the condition in the other two edges of the found triangle, namely, the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour point set, and removing the current triangle from the triangle to be searched;
d. c is repeatedly executed until the point coordinate which is equal to the reflectivity factor Z value is located on the initial edge which is found in the step A, and searching of the isoline point set of the closed isoline is finished; sequentially connecting the coordinates of each point in the isoline point set to form a closed isoline;
e. and (4) continuously searching another initial edge from the triangle which is not removed, repeating the steps a-c until the initial edge can not be found, and completing all closed contour line searches corresponding to all the reflectivity factors Z.
Compared with the prior art, the invention has the following beneficial effects:
1. in view of the fact that in the conventional method for acquiring three-dimensional contour line data of radar basic reflectivity in the prior art, calculation is performed based on three-dimensional regular grid data, a large amount of interpolation calculation needs to be performed on original detection data of the radar in the process, the spatial distribution of the regular grid and the radar scanning mode have great difference, ambiguity exists in judgment of contour lines of the quadrilateral grid, and extra calculation is needed to solve the problem. The conventional method needs a large amount of preprocessing calculation before contour line extraction, and brings obstruction to rapid extraction of the three-dimensional contour line.
2. According to the method, the triangular mesh is constructed by directly utilizing the original data points detected by the radar, so that the three-dimensional isoline data of the radar basic reflectivity with vector characteristics is rapidly acquired, each vertex of the generated triangular mesh has the three-dimensional coordinate attribute of x.y.z, the radar basic reflectivity series products are perfected, the accuracy of radar data is improved, and the data networking of the radar products is promoted.
3. The method is beneficial to realizing global sharing of radar product data, provides effective decision support for disaster reduction and prevention of meteorological disasters, and has good social and economic effects; meanwhile, the data acquisition has high efficiency and high precision, is convenient for manual interpretation and analysis, and can shorten the response time of relevant departments to disasters.
Description of the drawings:
FIG. 1 is a schematic diagram illustrating a dot structure of radar scan data according to an embodiment;
FIG. 2 is a schematic diagram illustrating a quadrilateral patch connection according to an embodiment;
FIG. 3 is a schematic diagram of a quadrilateral mesh according to a first embodiment;
FIG. 4 is a schematic diagram of a quadrilateral mesh subdivision triangle mesh in the first embodiment;
FIG. 5 is a schematic diagram of a non-closed contour search according to an embodiment I;
FIG. 6 is a schematic diagram of a closed contour search according to an embodiment I;
FIG. 7 is a diagram of the effect of finding the three-dimensional contour of the basic reflectivity in the second embodiment.
The specific implementation mode is as follows:
the first embodiment is as follows:
the invention discloses a method for rapidly acquiring radar basic reflectivity data, which comprises the following specific steps:
(1) acquiring scanning layer data of a preset elevation angle from the radar reflectivity data to be processed, and calculating the spatial position coordinate of the ith database data on the scanning line of each azimuth angle in the scanning layer, wherein i represents any data point on the scanning line, and the number of the data points on the scanning line is more than or equal to 1 and less than or equal to i:
the longitude and latitude coordinates of the radar center are as follows: (radarLX, radarLY, radarHKm (unit: kilometer or kilometer)), on a scanning line of a certain scanning layer of the radar with an elevation angle of elevaAngle (unit: radian) and an azimuth angle of AZ _ angle (unit: radian), the first library distance is firstGate (unit: kilometer), the library length is W (unit: kilometer), and the spatial longitude and latitude position coordinates of the ith library data are calculated according to the following formula (wherein, i is more than or equal to 1 and less than or equal to the number of data points on the scanning line):
the ith database data is projected on the ground to be away from the radar center by a transverse distance xDis:
xDis = ((firstGate + (i-1)* W) * cos(elevaAngle)) * sin(AZ_angle)； （1）
the ith database data projects the longitudinal distance yDis from the radar center on the ground:
yDis = ( (firstGate + (i-1) * W)* cos(elevaAngle)) *cos(AZ_angle)； （2）
latitude coordinate LY of ith library data:
LY = radarLY + yDis / (π * EarthRadius ) * 180； （3）
longitude coordinate LX of ith library data:
LX = radarLX + xDis / (π * EarthRadius * cos(LY * π/180)) * 180； （4）
spatial distance disKM of the current data point from the radar center:
disKM = firstGate+ (i-1) * W； （5）
height coordinate H of ith library data:
H = radarHKm + disKM * sin(elevaAngle) + disKM /(1.21 * 2 * EarthRadius)；（6）
wherein Earth radius is the radius of the earth, and the following are taken: 6371.004km
And a schematic diagram of the radar data point structure corresponding to each database data on each scanning line is formed, as shown in fig. 1;
(2) in the schematic diagram of the radar data point structure, two points at the i-th and i + 1-th library positions adjacent to each other are sequentially taken from two adjacent scanning lines, and the total four points are sequentially connected as vertexes to form a trapezoid patch, wherein the trapezoid patch is a trapezoid patch which is a non-self-intersecting quadrilateral patch formed by sequentially connecting four coordinate vertexes, as shown in fig. 2. Further completing the construction of the trapezoid patches of all the adjacent points on the scanning layer to form mutually adjacent trapezoid grids as shown in fig. 3;
(3) connecting a diagonal line to each trapezoid patch, and dividing each trapezoid patch into two triangles, wherein when each trapezoid patch is divided into two triangles by the diagonal line, the dividing directions of the diagonal lines are consistent, thereby forming a triangle mesh, as shown in fig. 4;
(4) in the triangular mesh, a connecting line of two data points which are farthest away from the center of the radar on each adjacent scanning line forms the boundary of the triangular mesh; for any reflectivity factor Z in the preset reflectivity factor set, finding an initial edge on the boundary of the triangular mesh, enabling the reflectivity factor Z value to be between the reflectivity values of two vertexes of the initial edge, firstly carrying out non-closed contour line search, and then carrying out closed contour line search.
(5) And repeating the step 4 to complete contour line search corresponding to all the reflectivity factors in the preset reflectivity factor set, and obtaining the basic reflectivity contour line data of the scanning layer.
Example two:
in this embodiment, on the basis of the first embodiment, a non-closed contour is further searched, and the specific process is as follows:
A. according to two vertexes of the initial edge found from the boundary, calculating point coordinates of the initial edge, which are equal to the Z value of the reflectivity factor, by interpolation, adding the point coordinates into a point set of the contour line, then searching a new edge which also meets the conditions on the other two edges of the triangle where the initial edge is located, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the new edge as the current initial edge, performing interpolation calculation on the two vertexes of the new edge to obtain point coordinates of the edge, which are equal to the Z value of the reflectivity factor, adding the point coordinates into the point set of the contour line, and removing the current triangle from the triangle to be searched;
B. finding a triangle adjacent to the new edge, continuously searching a second new edge which also meets the condition in the other two edges of the triangle, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the current initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
C. b, repeating the step B until the point coordinates with the same reflectivity factor Z value are located on the boundary, and finishing searching the isoline point set of the non-closed isoline; sequentially connecting the coordinates of each point in the point set of the contour line to form a non-closed contour line;
D. and continuing to search another starting edge from the boundary which is not removed, and repeating the steps A-C until all the non-closed contour line searches corresponding to the reflectivity factor Z are completed after the starting edge cannot be found in the boundary, as shown in FIG. 5.
Example three:
in this example, on the basis of the second embodiment, the closed contour is further searched, and the specific process is as follows:
a. searching any edge meeting the conditions from the triangle which is not rejected as an initial edge, namely, the numerical value of the reflectivity factor Z is between the reflectivity numerical values of two vertexes of the initial edge, and ending the search of the closed contour line if the initial edge cannot be found; if the initial edge meeting the conditions is found, entering the next step;
b. carrying out interpolation calculation on two vertexes of the found initial edge to obtain a point coordinate of the edge, which is equal to the value of the reflectivity factor Z, and adding the point coordinate into the isoline point set; then searching a new edge which is in accordance with the same condition on the other two edges of any triangle where the initial edge is located, namely, enabling a Z value to be between the reflectivity values of the two vertexes of the edge, taking the new edge as a current initial edge, carrying out interpolation calculation on the two vertexes of the new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
c. taking the new edge as an initial edge to search another triangle, continuously searching a second new edge which also meets the condition in the other two edges of the found triangle, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
d. c is repeatedly executed until the point coordinate which is found to be equal to the value of the reflectivity factor Z is positioned on the initial edge which is found in the step A, and the searching of the isoline point set of the closed isoline is finished; sequentially connecting the coordinates of each point in the isoline point set to form a closed isoline;
e. and (4) continuing to search another starting edge from the triangle which is not rejected, repeating the steps a-c until the starting edge can not be found, and completing all closed contour line searches corresponding to all the reflectivity factors Z, as shown in FIG. 6.
Example four:
in the basic reflectance contour data of the scanned layer obtained in example three, the corresponding color is assigned to each contour according to the reflectance factor Z value, and the result is shown in fig. 7.
The isolines with different values are endowed with different colors, so that the size of the echo value can be visually expressed, for example, if the isoline is red or deep red, the isoline indicates a high echo value area, and a weather expert can visually judge a heavy rainfall area.
Claims (4)
1. A method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity is characterized by comprising the following steps: 1) acquiring scanning layer data of a preset elevation angle from radar reflectivity data to be processed, calculating the spatial position coordinates of ith database data on a scanning line of each azimuth angle in the scanning layer, and forming a radar data point structure corresponding to each database data on each scanning line, wherein i represents any data point on the scanning line, and the number of the data points on the scanning line is more than or equal to 1 and less than or equal to i;
2) in the radar data point structure, two points of the i-th and i + 1-th base positions which are adjacent to each other are sequentially and respectively taken from two adjacent scanning lines, the total four points are sequentially connected as vertexes to form a quadrilateral surface patch, and then all the quadrilateral surface patches are constructed to obtain a quadrilateral grid;
3) connecting a diagonal line to each quadrilateral patch, and dividing each quadrilateral patch into two triangles to form a triangular mesh;
4) in the triangular mesh, a connecting line of two data points which are farthest away from the center of the radar on each adjacent scanning line forms the boundary of the triangular mesh; for any reflectivity factor Z in a preset reflectivity factor set, finding an initial edge on the boundary of a triangular grid, enabling the reflectivity factor Z value to be between the reflectivity values of two vertexes of the initial edge, and when the initial edge exists, firstly performing non-closed contour line search and then performing closed contour line search; when the initial edge does not exist, performing closed contour line search to obtain a contour line corresponding to the reflectivity factor Z; repeating the steps to complete contour line search corresponding to all the reflectivity factors in the preset reflectivity factor set, and acquiring three-dimensional contour line data of the basic reflectivity of the radar;
the process of non-closed contour line search in step 4) is as follows:
A. according to two vertexes of the initial edge found from the boundary, calculating point coordinates equal to the Z value of the reflectivity factor on the initial edge through interpolation, adding the point coordinates into a point set of the contour line, then searching a new edge which also meets the conditions on the other two edges of the triangle where the initial edge is located, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the new edge as the current initial edge, performing interpolation calculation on the two vertexes of the new edge to obtain point coordinates equal to the Z value of the reflectivity factor on the edge, adding the point coordinates into the point set of the contour line, and removing the current triangle from the triangle to be searched;
B. finding a triangle adjacent to the new edge, continuously searching a second new edge which also meets the condition in the other two edges of the triangle, namely the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the current initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
C. b, repeating the step B until the point coordinates with the same reflectivity factor Z value are located on the boundary, and finishing searching the isoline point set of the non-closed isoline; sequentially connecting the coordinates of each point in the point set of the contour line to form a non-closed contour line;
continuously searching another initial edge from the boundary which is not removed, repeating the steps A-C until the initial edge can not be found in the boundary, and finishing all non-closed contour line searches corresponding to the reflectivity factor Z;
the process of closed contour line search in step 4) is as follows:
a. searching any edge meeting the conditions from the triangle which is not removed as an initial edge, namely, the value of the reflectivity factor Z is between the reflectivity values of two vertexes of the initial edge, and ending the closed contour line search if the initial edge cannot be found; if the initial edge meeting the conditions is found, entering the next step;
b. carrying out interpolation calculation on two vertexes of the found initial edge to obtain a point coordinate equal to the value of the reflectivity factor Z on the edge, and adding the point coordinate into the isoline point set; then searching a new edge which is in accordance with the same condition on the other two edges of any triangle where the initial edge is located, namely, enabling a Z value to be between the reflectivity values of the two vertexes of the edge, taking the new edge as a current initial edge, carrying out interpolation calculation on the two vertexes of the new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour line point set, and removing the current triangle from the triangle to be searched;
c. taking the new edge as an initial edge to search for another triangle, continuously searching for a second new edge which also meets the condition in the other two edges of the found triangle, namely, the Z value is between the reflectivity values of the two vertexes of the edge, taking the second new edge which meets the condition as the initial edge, carrying out interpolation calculation on the two vertexes of the second new edge to obtain a point coordinate which is equal to the reflectivity factor Z value on the edge, adding the point coordinate into a contour point set, and removing the current triangle from the triangle to be searched;
d. c is repeatedly executed until the point coordinate which is found to be equal to the value of the reflectivity factor Z is positioned on the initial edge which is found in the step A, and the searching of the isoline point set of the closed isoline is finished; sequentially connecting the coordinates of each point in the isoline point set to form a closed isoline;
e. and (e) continuously searching another initial edge from the triangle which is not eliminated, repeating the steps a-c until the initial edge can not be found, and completing all closed contour line searches corresponding to all the reflectivity factors Z.
2. The method for rapidly acquiring the three-dimensional contour line data of the radar basic reflectivity as recited in claim 1, wherein: in the step 1), setting the longitude and latitude coordinates of the center of the radar as follows: (radarLX, radarLY, radarHKm), on a scanning line of the radar with a certain scanning layer elevation angle of elevaAngle and an azimuth angle of AZ _ angle, the first library distance is firstGate, and the library length is W, then the spatial longitude and latitude position coordinate of the ith library data is calculated according to the following formula:
xDis＝((firstGate+(i-1)*W)*cos(elevaAngle))*sin(AZ_angle) (1)
yDis＝((firstGate+(i-1)*W)*cos(elevaAngle))*cos(AZ_angle) (2)
LY＝radarLY+yDis/(π*EarthRadius)*180 (3)
LX＝radarLX+xDis/(π*EarthRadius*cos(LY*π/180))*180 (4)
disKM＝firstGate+(i-1)*W； (5)
H＝radarHKm+disKM*sin(elevaAngle)+disKM/(1.21*2*EarthRadius) (6)
wherein, xDis is the horizontal distance of ith storehouse data subaerial projection distance radar center, and yidis is the vertical distance of ith storehouse data subaerial projection distance radar center, and LY is the latitude coordinate of ith storehouse data, and LX is the longitude coordinate of ith storehouse data, and H is the altitude coordinate of ith storehouse data, and disKM is the spatial distance of current data point distance radar center, and Earth radius is the earth radius, gets: 6371.004 km.
3. The method for rapidly acquiring the three-dimensional contour line data of the radar basic reflectivity as recited in claim 1, wherein: in the step 3), when each quadrilateral surface patch is divided into two triangles by diagonal lines, the dividing directions of the diagonal lines are consistent.
4. The method for rapidly acquiring the three-dimensional contour line data of the radar basic reflectivity as recited in claim 1, wherein: and 4) endowing corresponding colors to the obtained basic reflectivity contour line of the scanning layer according to the reflectivity factor Z value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810903019.5A CN109031235B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810903019.5A CN109031235B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109031235A CN109031235A (en) | 2018-12-18 |
| CN109031235B true CN109031235B (en) | 2022-06-24 |
Family
ID=64632533
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810903019.5A Active CN109031235B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109031235B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110297246B (en) * | 2019-07-16 | 2021-04-02 | 上海市气象信息与技术支持中心 | Networking X-waveband weather radar collaborative self-adaptive control method and system |
| CN110531360B (en) * | 2019-08-28 | 2021-08-17 | 中船重工鹏力（南京）大气海洋信息***有限公司 | X-band weather radar networking data processing method |
| CN111736154B (en) * | 2020-06-22 | 2023-09-15 | 太极计算机股份有限公司 | Construction method and display method of three-dimensional weather radar echo model |
| CN117406194A (en) * | 2023-12-15 | 2024-01-16 | 中科星图维天信科技股份有限公司 | Method, device, equipment and storage medium for generating contour data |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100520444C (en) * | 2006-09-26 | 2009-07-29 | 南京大桥机器有限公司 | Portable X wave range Doppler weather radar signal processing method and device thereof |
| JP2010281575A (en) * | 2009-06-02 | 2010-12-16 | Honda Electronic Co Ltd | Gps device for detecting fish shoal |
| CN108280863A (en) * | 2018-01-12 | 2018-07-13 | 武汉智博创享科技股份有限公司 | TIN model equivalence line search methods based on bilateral structure |
-
2018
- 2018-08-09 CN CN201810903019.5A patent/CN109031235B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109031235A (en) | 2018-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109031235B (en) | Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity | |
| CN107092877B (en) | Remote sensing image roof contour extraction method based on building base vector | |
| CN107092020B (en) | Merge the surface evenness monitoring method of unmanned plane LiDAR and high score image | |
| CN104036544B (en) | A kind of building roof method for reconstructing based on on-board LiDAR data | |
| WO2021143778A1 (en) | Positioning method based on laser radar | |
| CN104463164B (en) | It is a kind of based on umbrella frame method and crown height than trees canopy structure information extracting method | |
| US20180081035A1 (en) | Method and device for filtering point cloud data | |
| CN110490888B (en) | Highway geometric feature vectorization extraction method based on airborne laser point cloud | |
| CN103729872B (en) | A kind of some cloud Enhancement Method based on segmentation resampling and surface triangulation | |
| CN103324916B (en) | Vehicle-mounted and aviation LiDAR data method for registering based on building profile | |
| CN111105496A (en) | High-precision DEM construction method based on airborne laser radar point cloud data | |
| JP2011501301A (en) | Geospatial modeling system and related methods using multiple sources of geographic information | |
| CN106408581B (en) | A kind of quick three-dimensional point cloud lines detection method | |
| CN107644452A (en) | Airborne LiDAR point cloud roof dough sheet dividing method and system | |
| JP6347061B2 (en) | Measurement result consistency determination method and measurement result consistency determination apparatus | |
| Tseng et al. | Extraction of building boundary lines from airborne LiDAR point clouds | |
| CA2684893A1 (en) | Geospatial modeling system providing data thinning of geospatial data points and related methods | |
| CN114898118A (en) | Automatic statistical method and system for power transmission line house removal amount based on multi-source point cloud | |
| JP6146731B2 (en) | Coordinate correction apparatus, coordinate correction program, and coordinate correction method | |
| CN104898106B (en) | Towards the ground point extracting method of complicated landform airborne laser radar data | |
| JP6397386B2 (en) | Region division processing apparatus, method, and program | |
| CN116977580A (en) | Method for manufacturing mountain area large scale DEM based on airborne LiDAR | |
| CN109031237B (en) | Method for rapidly acquiring radar combined reflectivity contour line data | |
| JP4226360B2 (en) | Laser data filtering method and program | |
| Chen et al. | Power line extraction and analysis based on LiDAR |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20181218 Assignee: Nanjing Guangbing Technology Co.,Ltd. Assignor: Nanjing University of Information Science and Technology Contract record no.: X2024980009397 Denomination of invention: A method for quickly obtaining three-dimensional contour data of radar basic reflectivity Granted publication date: 20220624 License type: Common License Record date: 20240711 Application publication date: 20181218 Assignee: Nanjing China Mineral Union Information Co.,Ltd. Assignor: Nanjing University of Information Science and Technology Contract record no.: X2024980009395 Denomination of invention: A method for quickly obtaining three-dimensional contour data of radar basic reflectivity Granted publication date: 20220624 License type: Common License Record date: 20240711 |