CN109100724B - Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section - Google Patents
Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section Download PDFInfo
- Publication number
- CN109100724B CN109100724B CN201810902999.7A CN201810902999A CN109100724B CN 109100724 B CN109100724 B CN 109100724B CN 201810902999 A CN201810902999 A CN 201810902999A CN 109100724 B CN109100724 B CN 109100724B
- Authority
- CN
- China
- Prior art keywords
- data
- radar
- scanning
- points
- layer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- 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
- G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
- G01S13/88—Radar or analogous systems specially adapted for specific applications
- G01S13/95—Radar or analogous systems specially adapted for specific applications for meteorological use
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A90/00—Technologies having an indirect contribution to adaptation to climate change
- Y02A90/10—Information and communication technologies [ICT] supporting adaptation to climate change, e.g. for weather forecasting or climate simulation
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Computer Networks & Wireless Communication (AREA)
- General Physics & Mathematics (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention provides a method for rapidly acquiring radar reflectivity data vertical sectioning plane three-dimensional vector data, which comprises the following steps: normalization of radar three-dimensional scanning data; constructing a hexahedral mesh of radar data points; constructing a vertical cutting plane; calculating the vertical sectioning plane data of the radar reflectivity data; the method directly processes data points detected by the radar by normalizing the scanning data of each layer of the radar to construct the hexahedral mesh, and then rapidly obtains the vertical sectioning plane of the radar reflectivity data by directly sectioning the hexahedron. The whole process reduces the calculation data amount and avoids redundant data, the acquisition efficiency of the vertical cutting plane of the radar reflectivity data is greatly improved, and the method can be conveniently applied to real-time three-dimensional weather monitoring services.
Description
The technical field is as follows:
the invention relates to a method for rapidly acquiring a vertical sectioning plane of radar reflectivity data.
Background art:
the vertical sectioning surface of the radar reflectivity data can express the internal data characteristics of the rainfall cloud group very intuitively, and has important significance for judging rainfall weather. The acquisition of the vertical section of the conventional radar reflectivity data is based on a three-dimensional regular grid. In the process, the arrangement of the three-dimensional regular grids is greatly different from the radar volume scanning mode, so that interpolation calculation needs to be carried out through existing radar detection data of each layer to obtain a data value corresponding to each three-dimensional regular small grid, and the section data is obtained on the basis of the data value. On one hand, the method needs to consume a large amount of calculation cost and increase the calculation time, on the other hand, redundant data is introduced to a certain extent, the data volume of product data is increased, and unnecessary obstacles are brought to the application of data transmission and the like. Therefore, the existing radar reflectivity data vertical sectioning method is difficult to be applied to real-time three-dimensional weather monitoring service.
The invention content is as follows:
the invention provides a method for rapidly acquiring radar reflectivity data vertical sectioning plane three-dimensional vector data, and the data acquired by the method can be conveniently applied to real-time three-dimensional weather monitoring services.
The specific technical scheme of the invention is as follows:
a method for rapidly acquiring radar reflectivity data vertical sectioning surface three-dimensional vector data comprises the following steps:
1) normalization of radar three-dimensional scanning data;
2) constructing a hexahedral mesh of radar data points;
3) constructing a vertical cutting plane;
4) calculating the vertical sectioning plane data of the radar reflectivity data; wherein the content of the first and second substances,
step 1), normalization of radar three-dimensional scanning data: normalizing each scanning layer of the radar three-dimensional scanning data into a standard layer with 360 scanning line data to obtain radar scanning data of each scanning layer with upper and lower corresponding data points;
and 2) constructing a hexahedral mesh of radar data points:
2.1) for the radar scanning data obtained by normalization, respectively taking point coordinates of adjacent ith and (i + 1) th data points of adjacent jth and (j + 1) th scanning lines on any scanning layer L, and taking four points in total as vertexes to connect into a quadrangle;
similarly, point coordinates of ith and (i + 1) th data points of jth and (j + 1) th scanning lines adjacent to each other on the L +1 scanning layer are taken, and four points are taken as vertexes in total to be connected into a quadrangle;
the point coordinates acquired by the L-th and the L + 1-th scanning layers are correspondingly connected according to the upper and lower position relation to construct a hexahedron; wherein L represents the number of scanning layers, j represents the azimuth angle corresponding to the scanning line, j is an integer which is more than or equal to 0 and less than or equal to 359, and i represents any data point on the scanning line;
2.2) when the number of the data points on the L +1 th layer is less than the number of the data points on the L th layer in step 2.1, that is, when the four data points taken from the jth and jth +1 th scan lines in the L th layer lack corresponding data points of upper and lower positions in the jth and jth +1 th scan lines in the L +1 th layer, repeatedly taking the last two data points (used as four data points so as to correspond to the four data points of the L layer) on the L +1 th layer corresponding to the two scan lines, and correspondingly connecting the taken data points to construct a hexahedron, in which case, the constructed hexahedron is a degraded hexahedron due to the repeated use of the data points in the L +1 layer;
2.3) repeating the steps 2.1 and 2.2, and sequentially carrying out the hexahedron construction on all data points on each adjacent scanning layer to obtain hexahedron grids constructed by all radar reflectivity data;
and 3) in the step 3), calculating the radar reflectivity data vertical section data:
and (3) setting a vertical sectioning plane and calculating the hexahedral mesh in the step (2) by using a vertical sectioning algorithm to obtain radar reflectivity data vertical sectioning plane three-dimensional vector data.
The invention is further designed in that:
the specific process of normalization in step 1) is as follows: in each scanning layer, a first scanning line is constructed by taking the position of a radar antenna as a center and an azimuth angle of 0 degree, a scanning line is constructed by each integral azimuth angle, and the like, the azimuth angle of a 360-th scanning line is 359 degrees, and 360 scanning lines are constructed; and acquiring 360 constructed scanning line data according to the data of each layer of the original radar three-dimensional reflectivity data by an interpolation calculation method according to the data on each scanning line, thereby completing the normalization processing of the radar three-dimensional scanning data.
In the step 3), the specific steps of the hexahedral mesh vertical plane sectioning algorithm are as follows:
3.1) setting a vertical cutting plane, taking two points P from the intersection line of the vertical cutting plane and the ground0(x0，y0，0)，P1(x1，y10), and taking another two points P from the vertical section corresponding to the height position of H3(x0，y0，H)，P2(x1，y1H), from P)0，P1，P2，P3The four points form a cutting quadrilateral surface positioned in the vertical cutting surface;
3.2) construction of the sectioning quadrilateral surface P of step 3.10P1P2P3Corresponding circumvallate (BBOX), searchStep 2, all hexahedrons in the hexahedron grids, which are positioned in a periploid (BBOX) and intersect with the periploid (BBOX), are stored;
3.3) traversing all the hexahedrons stored in the step 3.2 one by one, when the found hexahedron and the cutting quadrilateral surface in the step 3.1 are cut, calculating the intersection points of the cutting surface and each side of the hexahedron and the reflectivity values of the intersection points, connecting the intersection points to form a plurality of triangular surface patches, storing the generated triangular surface patches, wherein the three-dimensional coordinates of the vertexes of all the triangular surface patches and the radar reflectivity values corresponding to the vertexes are stored, and all the triangular surface patches stored form a section triangular network, namely the radar reflectivity data vertical cutting surface three-dimensional vector data is obtained.
And 3.3, each vertex of each triangular patch contains a corresponding radar reflectivity value, corresponding colors are respectively given to corresponding different reflectivity values, and the triangular patches with colors are drawn according to the colors of the vertexes in a gradual change mode to obtain the three-dimensional vector data of the radar reflectivity data vertical sectioning plane with the colors.
The gradual change mode is that a triangular patch with gradually changed colors is obtained by adopting the color interpolation function of the computer drawing.
Compared with the prior art, the invention has the following beneficial effects:
in view of the low efficiency of the conventional method for obtaining the vertical cutting plane of the radar reflectivity data, the method is difficult to be applied to daily three-dimensional weather real-time monitoring service. In order to solve the problem, the scanning data of each layer of the radar is normalized, then the data points detected by the radar are directly processed, a hexahedral mesh is constructed, and then the vertical sectioning surface of the radar reflectivity data is rapidly obtained directly through sectioning processing aiming at the hexahedron. The whole process reduces the calculation data amount and avoids redundant data, the acquisition efficiency of the vertical cutting plane of the radar reflectivity data is greatly improved, and the method can be conveniently applied to real-time three-dimensional weather monitoring services.
The method can quickly acquire the radar reflectivity data vertical sectioning plane, so that radar product data can be well applied to a three-dimensional scene, effective decision support can be better provided for disaster reduction and prevention of meteorological disasters, and the method has good social and economic effects; meanwhile, the capacity of rapidly acquiring the internal data characteristics of the rainfall cloud cluster can shorten the response time of related departments to disasters.
Description of the drawings:
FIG. 1 is a schematic top view of a radar reflectivity data normalization according to an embodiment;
FIG. 2 is a side view of the normalized radar reflectivity data according to one embodiment;
FIG. 3 is a schematic diagram illustrating a hexahedron construction of radar reflectivity data according to an embodiment;
FIG. 4 is a schematic diagram of a hexahedron construction of radar reflectivity data (degenerated) in a special case of the first embodiment;
FIG. 5 is a schematic diagram illustrating the numbers of vertices and edges of a hexahedron according to an embodiment;
FIG. 6 is a schematic diagram of 5 basic types of the embodiment in which the middle plane and the hexahedron are cut;
FIG. 7 is a diagram illustrating an exemplary effect of a vertical section of radar data in Jiangsu province in a first test example;
FIG. 8 is a diagram illustrating another exemplary effect of a vertical section of radar data in Jiangsu province in the first test example;
the specific implementation mode is as follows:
the first embodiment is as follows:
the invention is described in detail below with reference to the figures and the specific embodiments.
The invention provides a method for rapidly acquiring radar reflectivity data vertical sectioning plane three-dimensional vector data, which comprises the following steps: 1) normalization of radar three-dimensional scanning data; 2) constructing a hexahedral mesh of radar data points; 3) constructing a vertical cutting plane; 4) calculating the vertical sectioning plane data of the radar reflectivity data;
wherein:
1. when the radar three-dimensional scanning data is normalized, traversing each layer of the radar volume scanning data, performing the following normalization operation on the data of each layer, normalizing the data of each scanning layer into a standard layer with 360 scanning line data, and obtaining the radar scanning data of each scanning layer with upper and lower corresponding data points:
a) randomly selecting a scanning layer, constructing a scanning line with an azimuth angle of 0 degree and an elevation angle of the scanning layer according to existing scanning line data in the selected layer, and obtaining scanning line data on the newly constructed scanning line by an interpolation calculation method, wherein the space interval of each data point is 1 kilometer, and the number of data on the scanning line data is the original number (library number) of the scanning line on the layer;
b) according to the method of the step a and parameters of the elevation angle, the data interval and the data number thereof, data lines with azimuth angles of 1 degree, 2 degrees and 3 degrees and up to 359 degrees are respectively constructed in the layer; the data normalization operation of the data of the local layer is finished;
c) according to the steps, all the echo data scanning layers in the radar volume scanning data are subjected to the normalization operation in sequence, and the upper part and the lower part of the azimuth angle scanning line data corresponding to each scanning layer of the radar after normalization correspond to each other, as shown in fig. 1 and fig. 2;
2. when the hexahedral mesh of the radar data points is constructed, the following operations are sequentially carried out on each layer of data of the radar:
a) in the radar scanning layer (assuming currently as the L-th layer), each data line is traversed, and the following operations are performed: assuming that the current data line is the jth data line, sequentially taking the point coordinates of two adjacent data points (set as ith and i +1 th data points) on the data line, simultaneously taking the point coordinates of two adjacent data points (i and i +1 th data points) at the same position on the jth +1 th line adjacent to the current data layer (L layer), and connecting the four data points as vertexes to form a quadrangle; simultaneously, in the L +1 th data layer, the point coordinates of four data points (i-th and i + 1-th data points on the j-th and j + 1-th scanning lines) at corresponding positions are also taken as vertexes to be connected into a quadrangle according to the method; on the basis, the upper and lower layers of data points are connected according to the upper and lower corresponding relation to form a hexahedron, as shown in fig. 3, wherein L represents the number of scanning layers, (because L +1 exists, L takes the layer before the last scanning layer at the maximum), j represents the azimuth angle corresponding to the scanning line, j takes an integer of which j is not less than 0 and not more than 359, i represents any data point on the scanning line, the formed hexahedron is an irregular hexahedron, and the irregular hexahedron is a hexahedron with unparallel opposite sides on a certain quadrilateral surface. (i.e., of the 6 faces of the hexahedron, the hexahedron is an irregular hexahedron as long as a set of opposing faces are not parallel);
b) if the number of data points of the L + 1-th scanning line is less than that of the L-th scanning line, that is, if four data points taken from the jth scanning line and the jth + 1-th scanning line in the L-th layer lack corresponding data points of the upper position and the lower position in the jth scanning line and the jth + 1-th scanning line in the L-th layer, redundant quadrangles in the L-th layer cannot be matched, at this moment, the last point of the corresponding two scanning lines in the L + 1-th layer is repeatedly used, and the linear degraded quadrangles are used according to the quadrangle construction method (the connecting line is still a quadrangle, but the four vertexes of the connecting line are already overlapped in pairs), the vertexes of the redundant quadrangles in the L-th layer are all correspondingly connected with the vertexes of the degraded quadrangle in the L + 1-th layer to form a hexahedron, and in this case, the data points in the L + 1-th layer are repeatedly used, the hexahedron constructed here is essentially a degenerate hexahedron, similar in shape to a triangular prism, but it can still be considered to be made up of eight vertices, except where two sets of points coincide, as shown in fig. 4.
c) According to the method, hexahedron construction is carried out on all data points in the layer;
d) and repeating the steps until all the scanning data points of each layer of the radar construct a hexahedron. All radar reflectivity data points form a hexahedral grid, and the calculation operation of the vertically-sliced data is waited;
3. construction of vertical section:
setting a cutting plane: the endpoints of the ground projection line segment with the sectioning plane are respectively P0(x0,y0,z0)，P1(x1,y1,z1) If the height of the cutting plane is 30 m, the coordinate of the upper edge line of the cutting plane can be P3(x0,y0,z0+30)，P2(x1,y1,z1+30), the section is in the shape of a sectionThe section quadrilateral surface is P0P1P2P3. (here, z is0，z1Is 0; or directly replace 0 in the coordinate
4. Calculating the vertical section data of the radar reflectivity data:
4.1) search for a hexahedron that may be sectioned by a section:
firstly, constructing a periploid (BBox) cutting a quadrilateral surface; the periploid is the smallest hexahedron which can contain the cutting quadrilateral surface and the surface of which is parallel to three-dimensional coordinate axes, and the coordinates (Xmin, Ymin, Zmin) of the smallest coordinate point can be calculated according to the following formula: (. P0、P1Has a Z-axis coordinate of Z0，z1Is 0, P2、P3Has a Z-axis coordinate of H. )
Xmin＝Min(P0.x,P1.x,P2.x,P3.x)
Ymin＝Min(P0.y,P1.y,P2.y,P3.y)
Zmin＝0
The maximum coordinate point coordinates (Xmax, Ymax, Zmax) can be calculated according to the following formula:
Xmax＝Max(P0.x,P1.x,P2.x,P3.x)
Ymax＝Max(P0.y,P1.y,P2.y,P3.y)
Zmax＝H＝30
where Min () represents a function that evaluates to a minimum value; max () represents a function to find the maximum value;
then, all the hexahedrons are traversed, and the hexahedrons which are positioned in the circum-hexahedron (BBox) and intersect with the circum-hexahedron (BBox) are stored. The hexahedron stored is the hexahedron possibly cut with the cutting quadrilateral surface.
The specific process of searching for a hexahedron that is inside and intersecting the periploid is as follows:
the process is described as follows:
firstly, for any hexahedron, calculating a minimum wrapped hexahedron Box _ i, and setting the maximum coordinate as (Xmax _ i, Ymax _ i, Zmax _ i) and the minimum coordinate as (Xmin _ i, Ymin _ i, Zmin _ i);
secondly, comparing whether the hexahedron wrapper (Box _ i) is intersected with the cutting plane wrapper (BBox) or not or whether the hexahedron wrapper (Box _ i) is contained in the cutting plane wrapper (BBox) or not, and the specific method is as follows:
if (Xmax _ i < Xmin) or (Ymax _ i < Ymin) or (Zmax _ i < Zmin) or
(Xmin _ i > Xmax) or (Ymin _ i > Ymax) or (Zmin _ i > Zmax) the hexahedral wrapper (Box _ i) does not intersect the sectioned wrapper (BBox), while the hexahedral wrapper (Box _ i) is not within the sectioned wrapper (BBox);
the case of removing 2.1 is that the hexahedral perigon (Box _ i) intersects the perigon (BBox) of the section plane, or the hexahedral perigon (Box _ i) is inside the perigon (BBox) of the section plane; the hexahedron is saved as a possibly cut hexahedron to wait for the next actual cutting operation.
4.2) traversing all the hexahedrons stored in the step 4.1 one by one, if the currently processed hexahedron and the sectioning quadrilateral surface are not cut, processing the next hexahedron, if the currently processed hexahedron and the sectioning quadrilateral surface are not cut, directly carrying out calculation by a vertical sectioning algorithm to obtain a plurality of triangular surface patches generated by sectioning the hexahedron by the sectioning quadrilateral surface, and storing the calculated triangular surface patches.
The vertical sectioning algorithm for sectioning the quadrilateral surface and the hexahedron comprises the following specific steps:
the end points of the ground projection line segment of the sectioning plane are known as P0And P1，P2A point with known coordinates of the upper edge line of the cutting plane;
4.2.1) for the convenience of later operations, the vertices of the hexahedron to be cut and their sides are first numbered, as shown in fig. 5:
4.2.2) calculating the intersection points of the cutting quadrilateral surface and each edge of the hexahedron, and the method comprises the following specific steps:
4.2.2.1) traversing each side of the hexahedron, setting the coordinates of two end points of the currently taken side as A and B respectively, and calculating the intersection relation between the current end points and the cutting quadrilateral surface according to the following formula:
if a is more than or equal to 0, the cutting quadrilateral surface intersects with the side;
if a <0, the cutting quadrilateral surface does not intersect with the side;
4.2.2.2) if the currently taken edge does not intersect with the section quadrilateral surface, detecting the next edge; if the intersection exists, the number of the side is saved, and the coordinates of the intersection point of the sectioning quadrilateral surface and the currently-taken side and the radar reflectivity value at the intersection point are calculated by using the following formula;
according to three-point coordinates (P) on the cutting quadrilateral surface0，P1，P2) The normal vector of the plane where the sectioning quadrilateral surface is located can be obtained as follows:
then
Let the reflectance at point A be ZAThe reflectance at point B is ZBThen the reflectivity value at the intersection is:
wherein: l isA: the distance from the endpoint A to the cutting quadrilateral surface; l isB: the distance from the endpoint B to the cutting quadrilateral surface; p: the coordinates of the intersection points of the current edge and the cutting quadrilateral surface; z: a value of reflectivity at the intersection;
4.2.2.3) according to the number of the edges of the hexahedron intersected with the sectioning quadrilateral surface and the relative position (which can be judged according to the label sequence of the edges), comparing the basic intersection type in the figure 6, connecting the intersection points of each hexahedron and the intersecting edges of the sectioning quadrilateral surface into a plurality of triangular surface patches, wherein the vertex of each triangular surface patch is a spatial three-dimensional point with a reflectivity value, and storing the triangular surface patches.
4.3) according to the method in the step 4.2, processing each hexahedron stored in the step 4.1, and storing the obtained triangular patches together; the triangular patches are the triangular cross-sectional meshes formed on the cross-section, wherein the vertex of each triangular patch contains the radar reflectivity value of the position of the vertex, and the obtained triangular cross-sectional mesh is the three-dimensional vector data of the vertical cross-sectional plane of the radar reflectivity data calculated by the invention.
When the method is applied, different colors can be given to the radar reflectivity numerical value stored in the vertex coordinate of each triangular net directly, each triangular net is drawn by utilizing the color interpolation function of a computer drawing self, the triangular patch with gradually changed colors is obtained, and then the three-dimensional vector image data with the color gradually changed effect of the current vertical cutting plane is obtained.
Test example one:
by utilizing the method, the vertical sectioning surface three-dimensional vector data is obtained for the radar data in Jiangsu province, and in the figure 7, the ground length of a sectioning line is about 220 kilometers and the height is 30 kilometers; in fig. 8, the ground length of the cutting line is about 50 km, and the height is 30 km, so as to obtain the effect graphs of the examples shown in fig. 7 and 8.
Claims (4)
1. A method for rapidly acquiring radar reflectivity data vertical sectioning surface three-dimensional vector data is characterized by comprising the following steps: 1) normalization of radar three-dimensional scanning data; 2) constructing a hexahedral mesh of radar data points; 3) constructing a vertical cutting plane; 4) calculating the vertical sectioning plane data of the radar reflectivity data; wherein:
1) normalization of radar three-dimensional scanning data: normalizing each scanning layer of the radar three-dimensional scanning data into a standard layer with 360 scanning line data to obtain radar scanning data of each scanning layer with upper and lower corresponding data points;
2) constructing a hexahedral grid of radar data points:
2.1) for the radar scanning data obtained by normalization, taking adjacent j-th and j + 1-th scanning lines on any scanning layer L, respectively taking point coordinates of adjacent i-th and i + 1-th data points, and taking four points in total as vertexes to connect into a quadrangle;
similarly, point coordinates of ith and (i + 1) th data points of jth and (j + 1) th scanning lines adjacent to each other on the L +1 scanning layer are taken, and four points are taken as vertexes in total to be connected into a quadrangle; the point coordinates acquired by the L-th and the L + 1-th scanning layers are correspondingly connected according to the upper and lower position relation to construct a hexahedron; wherein L represents the number of scanning layers, j represents the azimuth angle corresponding to the scanning line, j is an integer which is more than or equal to 0 and less than or equal to 359, and i represents any data point on the scanning line;
2.2) when the number of the data points on the L +1 th layer in the step 2.1) is less than that of the data points on the L th layer, namely when four data points taken from the jth and jth +1 th scanning lines in the L th layer lack corresponding data points of the upper and lower positions in the jth and jth +1 th scanning lines in the L +1 th layer, repeatedly taking the last two data points on the L +1 th layer corresponding to the two scanning lines, and correspondingly connecting the taken data points to construct a hexahedron, wherein in this case, the constructed hexahedron is a degraded hexahedron due to repeated use of the data points in the L +1 layer;
2.3) repeating the step 2.1) and the step 2.2), and sequentially carrying out the hexahedron construction on all data points on each adjacent scanning layer to obtain hexahedron grids constructed by all radar reflectivity data;
3) calculating the vertical section data of the radar reflectivity data:
setting a vertical sectioning plane and calculating the hexahedral mesh in the step 2) by using a vertical sectioning algorithm to obtain radar reflectivity data vertical sectioning plane three-dimensional vector data; the method comprises the following specific steps:
3.1) setting a vertical cutting plane, taking two points P from the intersection line of the vertical cutting plane and the ground0(x0，y0，0)，P1(x1，y10), and taking another two points P from the vertical section corresponding to the height position of H3(x0，y0，H)，P2(x1，y1H), from P)0，P1，P2，P3The four points form a cutting quadrilateral surface positioned in the vertical cutting surface;
3.2) construction of the sectioning quadrilateral surface P of step 3.1)0P1P2P3Searching all hexahedrons in the hexahedron grids in the step 2, which are positioned in the periplohedron and intersected with the periplohedron, and storing all searched hexahedrons;
3.3) traversing all the hexahedrons stored in the step 3.2) one by one, when the found hexahedron and the sectioning quadrilateral surface in the step 3.1) are sectioned, calculating the intersection points of the sectioning surface and each edge of the hexahedron and the reflectivity values of the intersection points, connecting the intersection points to form a plurality of triangular surface patches, storing the generated triangular surface patches, and storing all the stored triangular surface patches to form a section triangular network, namely obtaining the radar reflectivity data vertical sectioning surface three-dimensional vector data.
2. The method for rapidly acquiring the radar reflectivity data vertical section three-dimensional vector data according to claim 1, wherein: the specific process of normalization in step 1) is as follows: in each scanning layer, a first scanning line is constructed at an azimuth angle of 0 degrees by taking the position of a radar antenna as a center, a scanning line is constructed at each integral azimuth angle, and the like, wherein the azimuth angle of the 360 th scanning line is 359 degrees, and 360 scanning lines are constructed; and acquiring 360 constructed scanning line data according to the data of each layer of the original radar three-dimensional reflectivity data by an interpolation calculation method according to the data on each scanning line, thereby completing the normalization processing of the radar three-dimensional scanning data.
3. The method for rapidly acquiring the radar reflectivity data vertical section three-dimensional vector data according to claim 2, wherein: and 3.3) each vertex of each triangular patch contains a corresponding radar reflectivity value, corresponding colors are respectively given to corresponding different reflectivity values, and the triangular patches with colors are drawn according to the colors of the vertexes in a gradual change mode to obtain the three-dimensional vector data of the radar reflectivity data vertical sectioning plane with the colors.
4. The method for rapidly acquiring the radar reflectivity data vertical section three-dimensional vector data according to claim 3, wherein: the gradual change mode is that a triangular patch with gradually changed colors is obtained by adopting the color interpolation function of the computer drawing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810902999.7A CN109100724B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810902999.7A CN109100724B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109100724A CN109100724A (en) | 2018-12-28 |
| CN109100724B true CN109100724B (en) | 2022-05-10 |
Family
ID=64849269
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810902999.7A Active CN109100724B (en) | 2018-08-09 | 2018-08-09 | Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109100724B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112327267B (en) * | 2020-11-12 | 2022-08-23 | 国网湖南省电力有限公司 | Millimeter wave radar reflectivity layer-by-layer repairing method and system and computer storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101373543A (en) * | 2008-09-28 | 2009-02-25 | 武汉大学 | Method for rapidly cutting three-dimensional gridding model |
| CN105678846A (en) * | 2016-02-22 | 2016-06-15 | 武汉华信联创技术工程有限公司 | Three-dimensional visualization method and system for real-time meteorological networking radar data |
| CN106054194A (en) * | 2016-05-10 | 2016-10-26 | 南京信息工程大学 | Spaceborne radar and ground-based radar reflectivity factor data three dimensional fusion method |
| CN108152799A (en) * | 2017-12-04 | 2018-06-12 | 上海无线电设备研究所 | The radar cross section quick calculation method of superelevation velocity of sound aircraft |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10371793B2 (en) * | 2016-08-08 | 2019-08-06 | Honeywell International Inc. | Transmission of weather radar data |
-
2018
- 2018-08-09 CN CN201810902999.7A patent/CN109100724B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101373543A (en) * | 2008-09-28 | 2009-02-25 | 武汉大学 | Method for rapidly cutting three-dimensional gridding model |
| CN105678846A (en) * | 2016-02-22 | 2016-06-15 | 武汉华信联创技术工程有限公司 | Three-dimensional visualization method and system for real-time meteorological networking radar data |
| CN106054194A (en) * | 2016-05-10 | 2016-10-26 | 南京信息工程大学 | Spaceborne radar and ground-based radar reflectivity factor data three dimensional fusion method |
| CN108152799A (en) * | 2017-12-04 | 2018-06-12 | 上海无线电设备研究所 | The radar cross section quick calculation method of superelevation velocity of sound aircraft |
Non-Patent Citations (1)
| Title |
|---|
| 基于双线性内插值的CD雷达垂直剖面算法;熊伟等;《贵州气象》;20101231(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109100724A (en) | 2018-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109031234B (en) | Method for rapidly acquiring radar reflectivity data three-dimensional isosurface | |
| AU2014202457B9 (en) | Aerial image segmentation for refineries | |
| Falcidieno et al. | A new method for the characterization of topographic surfaces | |
| CN113781667B (en) | Three-dimensional structure simplified reconstruction method and device, computer equipment and storage medium | |
| CN108776993A (en) | The modeling method and buried cable work well modeling method of three-dimensional point cloud with hole | |
| CN108169751A (en) | A kind of weather radar base datum 3 d grid method, computer readable storage medium and electronic equipment | |
| CN109031235B (en) | Method for rapidly acquiring three-dimensional contour line data of radar basic reflectivity | |
| US11443452B2 (en) | Using spatial filter to reduce bundle adjustment block size | |
| CN113868476A (en) | Octree point cloud preprocessing method based on local density | |
| Kulawiak et al. | Processing of LiDAR and multibeam sonar point cloud data for 3D surface and object shape reconstruction | |
| CN104851127A (en) | Interaction-based building point cloud model texture mapping method and device | |
| CN109100724B (en) | Method for rapidly acquiring three-dimensional vector data of radar reflectivity data vertical section | |
| Abdelguerfi et al. | Representation of 3-D elevation in terrain databases using hierarchical triangulated irregular networks: a comparative analysis | |
| CN111507194B (en) | Ground-based LiDAR branch and leaf point cloud separation method based on fractal dimension supervised learning | |
| CN109031237B (en) | Method for rapidly acquiring radar combined reflectivity contour line data | |
| CN110188682B (en) | Optical remote sensing image target detection method based on geometric structure double-path convolution network | |
| Zhao et al. | A new k nearest neighbours algorithm using cell grids for 3d scattered point cloud | |
| CN109143244B (en) | Method for rapidly acquiring radar reflectivity CAPPI three-dimensional vector data | |
| US20230196719A1 (en) | Method for cargo counting, computer equipment, and storage medium | |
| CN111898687B (en) | Radar reflectivity data fusion method based on Dilongnie triangulation | |
| CN115908318A (en) | Power line sag determination method, device, equipment, medium and product | |
| CN112734677B (en) | Airborne LiDAR point cloud cavity interpolation method and system | |
| Alboul et al. | A system for reconstruction from point clouds in 3D: Simplification and mesh representation | |
| CN113030898A (en) | Weather radar base data three-dimensional curved surface triangulation network construction method | |
| Pedrini | An adaptive method for terrain surface approximation based on triangular meshes |
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 |