Data processing method for ecological restoration of high and steep slope based on three-dimensional simulation

Abstract

The application discloses a data processing method for ecological restoration of high and steep slope based on three-dimensional simulation, and relates to the technical field of high and steep slope restoration, and comprises the following steps: constructing a three-dimensional model of the high and steep slope; establishing a division plane, and obtaining a final analysis intersection on the division plane; obtaining first to fourth coordinate points based on the final analysis intersection, obtaining the height of the three-dimensional model of the high and steep slope at the positions of the final analysis intersection and the first to fourth coordinate points, and marking them as Sz, S1, S2, S3 and S4 respectively; calculating the overall slope, the overall slope direction and the overall concave-convex difference value based on Sz, S1, S2, S3 and S4 respectively; and obtaining the grade of the ecological restoration difficulty based on the overall slope, the overall slope direction and the overall concave-convex difference value. The application is used for solving the problem that the existing high and steep slope restoration technology cannot analyze the restoration difficulty grade according to the three-dimensional data of the high and steep slope, thereby causing the waste of restoration resources and restoration time.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of high and steep slope repair, in particular to a data processing method for ecological repair of high and steep slopes based on three-dimensional simulation. BACKGROUND

[0002] High and steep slopes are usually less stable and prone to landslides and collapses and other geological disasters, which pose a threat to the surrounding environment and personal safety, so high and steep slope repair technology is needed.

[0003] Existing high and steep slope repair technology includes various repair methods, such as engineering repair and ecological repair. However, different repair methods are often needed for different high and steep slope repairs, such as ecological repair for low slopes and flat slopes, which can waste resources if engineering repair is used. In addition, existing technology often uses unmanned aerial vehicles or remote sensing mapping to conduct three-dimensional mapping of the area that needs to be repaired. However, there is a lack of data analysis and processing methods for three-dimensional data after mapping, which requires manual marking and analysis, and the difficulty of repair and the resources and time needed for repair need to be judged manually. For example, the patent application with publication number CN118780183A discloses a simulation digital data processing method for high and steep slope ecological repair, which uses the simulation digital data processing result of high and steep slope ecological repair to improve the accurate and efficient processing of simulation digital data for high and steep slope ecological repair, and to improve the error caused by data visualization and simulation digitization. This scheme only visualizes the repair process and analyzes the accuracy, and does not analyze the repair according to the different ecological environments of high and steep slopes. In addition, existing high and steep slope repair technology does not analyze the repair difficulty level based on high and steep slope three-dimensional data, which is inefficient and inaccurate for manual judgment, resulting in waste of repair resources and repair time. SUMMARY

[0004] The present application aims to at least partially solve one of the technical problems in the prior art, based on Sz, S1, S2, S3 and S4 to calculate the overall slope, overall slope direction and overall concave-convex difference, and based on the overall slope, overall slope direction and overall concave-convex difference to obtain the level of ecological repair difficulty, to solve the problem of waste of repair resources and repair time caused by the inability of existing high and steep slope repair technology to analyze the repair difficulty level based on high and steep slope three-dimensional data.

[0005] To achieve the above-mentioned purpose, the present application provides a data processing method for ecological repair of high and steep slopes based on three-dimensional simulation, comprising the following steps:

[0006] Constructing a three-dimensional model of high and steep slopes;

[0007] establishing a division plane, and obtaining a final analysis intersection point on the division plane;

[0008] obtaining a first coordinate point to a fourth coordinate point based on the final analysis intersection point, and obtaining heights of the final analysis intersection point and the first coordinate point to the fourth coordinate point on the high and steep slope three-dimensional model, and marking the heights as Sz, S1, S2, S3 and S4 respectively;

[0009] calculating an overall slope, an overall slope direction and an overall concave-convex difference value based on the Sz, S1, S2, S3 and S4 respectively;

[0010] obtaining a level of ecological restoration difficulty based on the overall slope, the overall slope direction and the overall concave-convex difference value.

[0011] Further, the step of establishing a division plane and obtaining a final analysis intersection point on the division plane comprises the following sub-steps:

[0012] obtaining a horizontal plane of the high and steep slope three-dimensional model, and marking the horizontal plane as a division plane;

[0013] establishing a plane rectangular coordinate system on the division plane, and marking the plane rectangular coordinate system as a division plane coordinate system, wherein the X axis direction is from west to east, and the Y axis direction is from south to north, and the high and steep slope three-dimensional model is in the first quadrant;

[0014] drawing m straight lines with an interval of n in the positive direction of the X axis in the division plane coordinate system, and marking the straight lines as Y axis parallel lines, and drawing m straight lines with an interval of n in the positive direction of the Y axis in the division plane coordinate system, and marking the straight lines as X axis parallel lines;

[0015] obtaining an intersection point of the X axis parallel lines and the Y axis parallel lines, and marking the intersection point as an initial analysis intersection point;

[0016] if the initial analysis intersection point is on the high and steep slope three-dimensional model, marking the initial analysis intersection point as a final analysis intersection point.

[0017] Further, the step of obtaining a first coordinate point to a fourth coordinate point based on the final analysis intersection point, and obtaining heights of the final analysis intersection point and the first coordinate point to the fourth coordinate point on the high and steep slope three-dimensional model, and marking the heights as Sz, S1, S2, S3 and S4 respectively comprises the following sub-steps:

[0018] obtaining a coordinate point with an interval of R in the positive direction of the Y axis based on the final analysis intersection point, and marking the coordinate point as a first coordinate point; obtaining a coordinate point with an interval of R in the negative direction of the X axis based on the final analysis intersection point, and marking the coordinate point as a second coordinate point; obtaining a coordinate point with an interval of R in the positive direction of the X axis based on the final analysis intersection point, and marking the coordinate point as a third coordinate point; and obtaining a coordinate point with an interval of R in the negative direction of the Y axis based on the final analysis intersection point, and marking the coordinate point as a fourth coordinate point;

[0019] Respectively obtain the height of the high and steep slope three-dimensional model at the positions of the final analysis intersection, the first coordinate point, the second coordinate point, the third coordinate point and the fourth coordinate point, and mark them as Sz, S1, S2, S3 and S4 respectively.

[0020] Further, the overall slope, the overall slope direction and the overall concave-convex difference value are calculated based on Sz, S1, S2, S3 and S4 respectively, including the following sub-steps:

[0021] The horizontal height variation rate Hbx is calculated as: Hbx=(S4-S1) / (2*R); wherein Hbx is the horizontal height variation rate;

[0022] The vertical axis height variation rate Hby is calculated as: Hby=(S2-S3) / (2*R); wherein Hbx is the vertical axis height variation rate;

[0023] The slope around the Sz point Psd is calculated as: Psd=arctan(|Hbx|+|Hby|), wherein Psd is the slope around the Sz point; the range of Psd is: [0, 90°];

[0024] The Psd of all the final analysis intersections is obtained, and the average value of the Psd of all the final analysis intersections is calculated, which is marked as the overall slope.

[0025] Further, the overall slope, the overall slope direction and the overall concave-convex difference value are calculated based on Sz, S1, S2, S3 and S4 respectively, including the following sub-steps:

[0026] The slope direction is set to 0° in the north direction, and the value of the slope direction is increased in the clockwise direction, and the range of the slope direction is 0-360°;

[0027] When Hby is equal to 0 and Hbx is greater than 0, the slope direction is 90°; when Hby is equal to 0 and Hbx is less than 0, the slope direction is 270°;

[0028] When Hbx is equal to 0 and Hby is greater than 0, the slope direction is 0°;

[0029] When Hbx is equal to 0 and Hby is less than 0, the slope direction is 180°;

[0030] When Hby and Hbx are not equal to 0, the slope direction around the Sz point is calculated as:

[0031] Psx=arctan(|Hby / Hbx|); wherein Psx is the slope direction around the Sz point, and the range of Psx is: [0, 90°];

[0032] When Hbx is greater than 0 and Hby is greater than 0, the slope direction is Psx;

[0033] When Hbx is greater than 0 and Hby is less than 0, the slope direction is 360°-Psx;

[0034] when Hbx is less than 0 and Hby is less than 0, the slope direction is Psx+180°;

[0035] when Hbx is less than 0 and Hby is greater than 0, the slope direction is 180°-Psx;

[0036] obtaining the slope direction of all the final analysis intersection points, and calculating the average of the slope direction of all the final analysis intersection points, marked as the overall slope direction.

[0037] Further, the calculation of the overall slope, the overall slope direction and the overall concave-convex difference based on Sz, S1, S2, S3 and S4 respectively further comprises the following sub-steps:

[0038] calculating the concave-convex difference of the Sz point as: Otc = [(|S4+S1|+|S2+S3|) / 2]-Sz; wherein Otc is the concave-convex difference of the Sz point;

[0039] obtaining the Otc of all the final analysis intersection points, and calculating the average of the Otc of all the final analysis intersection points, marked as the overall concave-convex difference.

[0040] Further, the obtaining of the ecological restoration difficulty value based on the overall slope, the overall slope direction and the overall concave-convex difference comprises the following sub-steps:

[0041] marking the overall slope as Psdz;

[0042] normalizing Psdz as: Psdg = (Psdz-Psdzmin) / (Psdzmax-Psdzmin); wherein Psdg is the normalized value of Psdz; Psdzmax is the maximum value of Psdz in the database, and Psdzmin is the minimum value of Psdz in the database;

[0043] calculating the average of Psx of all the final analysis intersection points, marked as Psxz, and when Hbx or Hby is 0 in the final analysis intersection points, Psx is taken as 0 when calculating the average;

[0044] normalizing Psxz as: Psxg = (psxz-psxzmin) / (psxzmax-psxzmin); wherein Psxg is the normalized value of Psxz; Psxzmax is the maximum value of Psxz in the database, and Psxzmin is the minimum value of Psxz in the database;

[0045] marking the overall concave-convex value as Otcz;

[0046] Normalize |Otcz| as: Otcg = (|Otcz| - |Otczmin|) / (|Otcmax| - |Otczmin|); where |Otcg| is the normalized value of |Otcz|, |Otczmax| is the maximum value of |Otcz| in the database, and |Otczmin| is the minimum value of |Otcz| in the database.

[0047] Furthermore, obtaining the ecological restoration difficulty value based on the overall slope, overall aspect, and overall unevenness difference also includes the following sub-steps:

[0048] Obtain the wind direction predicted for the location of steep slopes in the first time and mark it as the local wind direction;

[0049] Set the local wind direction to due north as 0°, and increase the local wind direction value clockwise. The local wind direction range is 0-360°.

[0050] Obtain the angle between the local wind direction and the overall slope aspect, denoted as Fpj; where Fpj ranges from [0, 180°].

[0051] Normalize Fpj as: Fpjg=(Fpj-Fpjmin) / (Fpjmax-Fpjmin); where Fpjg is the normalized value of Fpj, Fpjmax is the maximum value of Fpj in the database, and Fpjmin is the minimum value of Fpj in the database.

[0052] Furthermore, obtaining the ecological restoration difficulty value based on the overall slope, overall aspect, and overall unevenness difference also includes the following sub-steps:

[0053] The method for obtaining the maximum and minimum data is as follows: obtain all Fpj values ​​of the first number of steep slopes in the database and mark them as database Fpj values;

[0054] Mark the first quantity as D1;

[0055] Sort the database Fpj values ​​in ascending order, and assign a sequence number to each database Fpj value, which is an integer starting from 1;

[0056] Determine if f1*D1 is an integer. If it is an integer, mark the database Fpj value with sequence number f1*D1 as the first quantile value. If it is not an integer, calculate the average of the database Fpj values ​​corresponding to the sequence numbers on both sides of f1*D1 and mark them as the first quantile value. Here, f1 is the first quantile coefficient, and the range of f1 is (0, 0.5).

[0057] If f2*D1 is an integer, mark the database Fpj value with the sequence number f2*D1 as the second quantile value, if not, calculate the average value of the database Fpj values corresponding to the sequence numbers on both sides of f2*D1, and mark it as the second quantile value; wherein f2 is the second quantile coefficient, f2 = [(1 / f1)-1]*f1;

[0058] The minimum value of the database Fpj is obtained as: Fpjmin = Fd1-f3*(Fd2-Fd1);

[0059] The maximum value of the database Fpj is obtained as: Fpjmax = Fd2+f3*(Fd2-Fd1); wherein Fd1 is the first quantile value, Fd2 is the second quantile value, q1 is the minimum value of the database Fpj, q2 is the minimum value of the database Fpj, and f3 is the equation coefficient;

[0060] The maximum value of the database Psdz, the minimum value of the database Psdz, the maximum value of the database Psxz, the minimum value of the database Psxz, the maximum value of the database |Otcz|, and the minimum value of the database |Otcz| are obtained by using the maximum and minimum data obtaining method.

[0061] Further, the obtaining of the grade of the ecological restoration difficulty based on the overall slope, the overall slope direction and the overall concave-convex difference further includes the following sub-steps:

[0062] The ecological restoration difficulty value is calculated as:

[0063] Stq = (k1*Psdg+k2*Psxg+k3*|Otcg|+k4*Fpjg) / 4; wherein Stq is the ecological restoration difficulty value, wherein k1, k2, k3 and k4 are respectively: Psdg weight coefficient, Psxg weight coefficient, |Otcg| weight coefficient and Fpjg weight coefficient, the sum of k1, k2, k3 and k4 is 1, and the range of Stq is: [0, 1];

[0064] When Stq is between [0, p1], it is a mild ecological restoration difficulty;

[0065] When Stq is between (p1, p2], it is a moderate ecological restoration difficulty;

[0066] When Stq is between (p2, 1], it is a severe ecological restoration difficulty; wherein p1 and p2 are difficulty classification grades; the size relationship is: 0

[0067] The beneficial effects of the present application are that the present application calculates the overall slope, the overall slope direction and the overall concave-convex difference value based on S Z, S 1, S 2, S 3 and S 4 respectively, and obtains the ecological restoration difficulty level based on the overall slope, the overall slope direction and the overall concave-convex difference value, and the advantage is that the restoration difficulty level can be analyzed according to the three-dimensional data of the high and steep slope, and the corresponding restoration operation is carried out based on the restoration difficulty level.

[0068] The maximum and minimum data acquisition method of the present application has the advantage that the normalized data can be uniformly distributed between 0-1, and the accuracy of the formula Stq=(k1*Psdg+k2*Psxg+k3*|Otcg|+k4*Fpjg) / 4 when k1, k2, k3 and k4 take equal values is improved. BRIEF DESCRIPTION OF DRAWINGS

[0069] Figure 1 The step flow chart of the method of the present application is shown in the figure.

[0070] Figure 2 The schematic diagram of the final intersection point to be analyzed of the present application is shown in the figure.

[0071] Figure 3 The schematic diagram of the first coordinate point to the fourth coordinate point of the present application is shown in the figure. DETAILED DESCRIPTION

[0072] The technical solutions in the embodiments of the present application will be described clearly and completely in the embodiments of the present application in combination with the accompanying drawings, and obviously, the described embodiments are only part of the embodiments of the present application, not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application.

[0073] Embodiment 1, please refer to Figure 1 The data processing method for high and steep slope ecological restoration based on three-dimensional simulation is provided in the first aspect, and the method comprises the following steps:

[0074] Step S1, constructing a three-dimensional model of the high and steep slope;

[0075] Step S2, establishing a division plane, and obtaining the final analysis intersection point on the division plane; step S2 further comprises the following substeps:

[0076] Step S201, obtaining the horizontal plane of the three-dimensional model of the high and steep slope, and marking it as the division plane;

[0077] Step S202, establishing a plane rectangular coordinate system on the division plane, and marking it as the division plane coordinate system, wherein the X-axis direction is from west to east, and the Y-axis direction is from south to north, and the three-dimensional model of the high and steep slope is in the first quadrant;

[0078] Step S203, in the divided plane coordinate system, m straight lines with an interval of n are drawn from the straight line coinciding with the Y axis as the starting line towards the positive direction of the X axis and marked as Y axis parallel lines, and m straight lines with an interval of n are drawn from the straight line coinciding with the X axis as the starting line towards the positive direction of the Y axis and marked as X axis parallel lines;

[0079] Step S204, the intersection points of the X axis parallel lines and the Y axis parallel lines are marked as initial analysis intersection points;

[0080] Step S205, if the initial analysis intersection points are marked as final analysis intersection points on the high and steep slope three-dimensional model;

[0081] In practical application, please refer to Figure 2 As shown in the drawing, in the divided plane coordinate system, 16 straight lines with an interval of 0.4 m are drawn from the straight line coinciding with the Y axis as the starting line towards the positive direction of the X axis and marked as Y axis parallel lines, and 16 straight lines with an interval of 0.4 m are drawn from the straight line coinciding with the X axis as the starting line towards the positive direction of the Y axis, and the final analysis intersection points are obtained.

[0082] Step S3, based on the final analysis intersection points, first coordinate points to fourth coordinate points are obtained, and the heights of the high and steep slope three-dimensional model at the positions of the final analysis intersection points and the first coordinate points to the fourth coordinate points are obtained and marked as Sz, S1, S2, S3 and S4 respectively; Step S3 further includes the following sub-steps:

[0083] Step S301, a coordinate point with an interval of R is obtained from the final analysis intersection point as the starting point towards the positive direction of the Y axis and marked as the first coordinate point, a coordinate point with an interval of R is obtained from the final analysis intersection point as the starting point towards the negative direction of the X axis and marked as the second coordinate point, a coordinate point with an interval of R is obtained from the final analysis intersection point as the starting point towards the positive direction of the X axis and marked as the third coordinate point, and a coordinate point with an interval of R is obtained from the final analysis intersection point as the starting point towards the negative direction of the Y axis and marked as the fourth coordinate point;

[0084] Step S302, the heights of the high and steep slope three-dimensional model at the positions of the final analysis intersection point, the first coordinate point, the second coordinate point, the third coordinate point and the fourth coordinate point are obtained respectively and marked as Sz, S1, S2, S3 and S4 respectively;

[0085] In practical application, please refer to Figure 3 As shown in the drawing, the heights of the high and steep slope three-dimensional model at the positions of the final analysis intersection point, the first coordinate point, the second coordinate point, the third coordinate point and the fourth coordinate point are obtained as 10 m, 10 m, 11 m, 9 m and 10 m respectively;

[0086] Step S4, based on Sz, S1, S2, S3 and S4, the overall slope, the overall slope direction and the overall concave-convex difference value are calculated respectively; Step S4 further includes the following sub-steps:

[0087] Step S401, the calculation of the lateral height variation rate is: Hbx=(S4-S1) / (2*R); wherein Hbx is the lateral height variation rate; the height variation rate in the X-axis direction every interval R in the division plane coordinate system, also expressed as the slope slope in the X-axis direction;

[0088] Step S401, the calculation of the longitudinal axis height variation rate is: Hby=(S2-S3) / (2*R); wherein Hbx is the longitudinal axis height variation rate; the height variation rate in the Y-axis direction every interval R in the division plane coordinate system, also expressed as the slope slope in the Y-axis direction;

[0089] Step S403, the calculation of the slope around the point Sz is: Psd=arctan(|Hbx|+|Hby|) wherein Psd is the slope around the point Sz; the range of Psd is: [0, 90°]; the sum of the slope slope in the Y-axis direction and the slope slope in the X-axis direction is the overall slope slope, and the tangent value of the slope is the slope angle, so the calculation of the slope around the point Sz is: Psd=arctan(|Hbx|+|Hby|);

[0090] Step S404, the Psd of all the final analysis intersection points is obtained, and the average of the Psd of all the final analysis intersection points is obtained, which is marked as the overall slope;

[0091] In actual application, R is set to 0.4 m, Hby=(10-10) / (2*0.4)=0; Hbx=(11-9) / (2*0.4)=2.8; Psd=70.35°, the calculation result is retained as an integer, and the overall slope is the average of Psd; for example, the overall slope is 70.35°, if there are fifty Psd data, the average of the fifty Psd is obtained, such as 70.35°;

[0092] Step S405, the slope direction is set to 0° in the north direction, and the value of the slope direction is increased in the clockwise direction, and the range of the slope direction is 0-360°; the slope direction is set to facilitate subsequent processing; the north direction coincides with the positive direction of the Y-axis;

[0093] Step S406, when Hby is equal to 0 and Hbx is greater than 0, the slope is 90°; when Hby is equal to 0 and Hbx is less than 0, the slope is 270°; Hby equal to 0 indicates that the height variation rate in the Y-axis direction every interval R in the division plane coordinate system is 0, Hbx is greater than 0, and the height between the positive directions of the X-axis is gradually reduced, so the slope is 90° in the X-axis positive direction, and similarly, when Hby is equal to 0 and Hbx is less than 0, the slope is 270° in the X-axis negative direction;

[0094] Step S407, when Hbx is equal to 0 and Hby is greater than 0, the slope is 0°; when Hbx is equal to 0 and Hby is less than 0, the slope is 180°; Hbx equal to 0 indicates that the height change rate is 0 in the X axis direction every interval R in the division plane coordinate system, Hby is greater than 0, the height gradually decreases between the positive direction of Y axis, so the slope is 0° in the positive direction of Y axis, and the slope is 180° in the negative direction of Y axis when Hbx is equal to 0 and Hby is less than 0.

[0095] Step S408, when Hbx and Hby are not equal to 0, the slope around the Sz point is Psx=arctan(|Hby / Hbx|); wherein Psx is the slope around the Sz point, the range of Psx is [0, 90°]; the formula can be obtained by space relationship and calculation; Psx also indicates the included angle between Y axis, so the range is [0, 90°];

[0096] Step S409, when Hbx is greater than 0 and Hby is greater than 0, the slope is Psx; when Hbx is greater than 0 and Hby is less than 0, the slope is 360°-Psx; when Hbx is less than 0 and Hby is less than 0, the slope is Psx+180°; when Hbx is less than 0 and Hby is greater than 0, the slope is 180°-Psx; when Hbx is greater than 0 and Hby is greater than 0, the slope is in the first quadrant, so the slope is Psx; when Hbx is greater than 0 and Hby is less than 0, the slope is in the second quadrant, so the slope is 360°-Psx; when Hbx is less than 0 and Hby is less than 0, the slope is in the third quadrant, so the slope is Psx+180°; when Hbx is less than 0 and Hby is greater than 0, the slope is in the fourth quadrant, so the slope is 180°-Psx;

[0097] Step S410, the slope of all final analysis intersection points is obtained, and the average of the slope of all final analysis intersection points is obtained, which is marked as the overall slope;

[0098] In practical application, when Hby is equal to 0 and Hbx is 2.8 greater than 0, the slope is 90°, if the slope has fifty data, the average of the fifty slopes is obtained, such as 90°;

[0099] Step S411, the concave-convex difference value of the Sz point is Otc=[(|S4+S1|+|S2+S3|) / 2]-Sz; wherein Otc is the concave-convex difference value of the Sz point; the difference value of the average of S4+S1 and the average of S2+S3 and Sz indicates the data, when the overall concave-convex value is greater than 0, it indicates that the Sz point is a protruding point, and soil reinforcement is required; when the overall concave-convex value is less than 0, it indicates that the Sz point is a recessed point, and drainage measures are required; the absolute value of Otc, the more difficult the drainage measures or soil reinforcement is;

[0100] Step S412, obtaining Otc of all final analysis intersection points, and calculating Otc mean value of all final analysis intersection points, marked as overall concave-convex difference value;

[0101] In practical application, Otc = [(|10+10|+|11+9|) / 2]-10 = 0 m is calculated; if Otc has fifty data, the mean value of the fifty Otc is calculated, such as 0 m;

[0102] Step S5, obtaining the grade of ecological restoration difficulty based on overall slope, overall slope direction and overall concave-convex difference value; step S5 further includes the following sub-steps:

[0103] Step S501, marking the overall slope as Psdz;

[0104] Step S502, normalizing Psdz as Psdg = (Psdz-Psdzmin) / (Psdzmax-Psdzmin); wherein Psdg is the normalized value of Psdz; Psdzmax is the maximum value of Psdz in the database, and Psdzmin is the minimum value of Psdz in the database; the normalization operation enables different data to be classified in terms of difficulty;

[0105] Step S503, calculating the mean value of Psx of all final analysis intersection points, marked as Psxz; when Hbx or Hby is 0 in the final analysis intersection points, Psx is taken as 0 when calculating the mean value;

[0106] Step S504, normalizing Psxz as Psxg = (psxz-psxzmin) / (psxzmax-psxzmin); wherein Psxg is the normalized value of Psxz; Psxzmax is the maximum value of Psxz in the database, and Psxzmin is the minimum value of Psxz in the database; in high and steep slope restoration, if there is direct sunlight, sun-loving plants are planted; China is in the northern hemisphere, so the smaller Psxg is, the better the plant grows, and the larger Psxg is, the worse the plant grows;

[0107] Step S505, marking the overall concave-convex value as Otcz;

[0108] Step S506, normalizing |Otcz| as Otcg = (|Otcz|-|Otczmin|) / (|Otcmax|-|Otczmin|); wherein |Otcg| is the normalized value of |Otcz|, |Otczmax| is the maximum value of |Otcz| in the database, and |Otczmin| is the minimum value of |Otcz| in the database; the absolute value is calculated here because the larger the absolute value of Otcz is, the more difficult the drainage measures or soil reinforcement is;

[0109] Step S507, the first time of the high and steep slope position prediction is obtained, and the local wind direction is marked as local wind direction;

[0110] Step S508, the local wind direction is set to the north direction, and the value of the local wind direction is increased in the clockwise direction. The range of the local wind direction is 0-360°;

[0111] Step S509, the angle between the local wind direction and the overall slope direction is obtained, and is marked as Fpf; wherein the range of Fpf is [0, 180°]; the negative value of Fpf is marked as Fpj; the negative value of Fpf is unified with other data, and the greater the value is, the more difficult the operation is;

[0112] Step S510, Fpj is normalized as Fpjg=(Fpj-Fpjmin) / (Fpjmax-Fpjmin); wherein Fpjg is the normalized value of Fpj, Fpjmax is the maximum value of Fpj in the database, and Fpjmin is the minimum value of Fpj in the database;

[0113] Step S513, the maximum and minimum data acquisition method is that the first quantity of Fpj values of all high and steep slopes in the database is obtained, and is marked as the database Fpj value; the first quantity is marked as D1;

[0114] Step S514, the database Fpj value is sorted from small to large, and each database Fpj value is set to correspond to a sequence number, and the sequence number is an integer starting from 1;

[0115] Step S515, it is judged whether f1*D1 is an integer. If it is an integer, the database Fpj value with the sequence number f1*D1 is marked as the first quantile value. If it is not an integer, the average value of the database Fpj values corresponding to the sequence numbers on both sides of f1*D1 is calculated, and is marked as the first quantile value; wherein f1 is the first quantile coefficient, and the range of f1 is (0, 0.5);

[0116] Step S516, it is judged whether f2*D1 is an integer. If it is an integer, the database Fpj value with the sequence number f2*D1 is marked as the second quantile value. If it is not an integer, the average value of the database Fpj values corresponding to the sequence numbers on both sides of f2*D1 is calculated, and is marked as the second quantile value; wherein f2 is the second quantile coefficient, and f2=[(1 / f1)-1]*f1;

[0117] Step S517, the minimum value of the database Fpj is Fpjmin=Fd1-f3*(Fd2-Fd1);

[0118] Step S518, the maximum value of the database Fpj is obtained as: Fpjmax = Fd2 + f3 * (Fd2 - Fd1); wherein Fd1 is the first quantile value, Fd2 is the second quantile value, q1 is the minimum value of the database Fpj, q2 is the minimum value of the database Fpj, and f3 is the equation coefficient; f3 is set in the range (0, 0.5); f3 can be set based on the distribution of the database Fpj, the database Fpj value with the order number of 0.5*D1 is marked as the intermediate reference value, the mean value of the absolute value of the difference between all the database Fpj values and the intermediate reference value is obtained and marked as the reference setting value, the smaller the reference setting value is, the smaller f3 is set, and vice versa, the larger the reference setting value is, the larger f3 is set;

[0119] Step S519, the maximum value of the database Psdz, the minimum value of the database Psdz, the maximum value of the database Psxz, the minimum value of the database Psxz, the maximum value of the database |Otcz| and the minimum value of the database |Otcz| are obtained by using the maximum and minimum data acquisition method;

[0120] In practical applications, the maximum and minimum data acquisition method is: whether 0.25*1000 is an integer, is an integer, the database Fpj value of the sequence number 0.25*1000 is 23°, then the second quantile value is 22.5°, whether 0.75*1000 is an integer, is an integer, the database Fpj value of the sequence number 0.75*1000 is 67.5°, then the second quantile value is 67.5°, the minimum value of the database Fpj is obtained: Fpjmin=22.5-0.5*(67.5-22.5)=0°, the maximum value of the database Fpj is obtained: Fpjmax=67.5+0.5*(67.5-22.5)=90°, similarly, the maximum value of the database Psdz, the minimum value of the database Psdz, the maximum value of the database Psxz, the minimum value of the database Psxz, the maximum value of the database |Otcz|, the minimum value of the database |Otcz|, and the maximum value of the database Fpj and the minimum value of the database Fpj are 60°, 88°, 0°, 90°, 0m, 8m, 0° and 90° respectively, Psdg=(Psdz-Psdzmin) / (Psdzmax-Psdzmin)=(70.38-60) / (88-60)=0.37; Psxg=(psxz-psxzmin) / (psxzmax-psxzmin)=(90-0) / (90-0)=1; Otcg=(|Otcz|-|Otczmin|) / (|Otcmax|-|Otczmin|)=(0-0) / (8-0)=0; Fpjg=(Fpj-Fpjmin) / (Fpjmax-Fpjmin)=(30-0) / (90-0)=0.34, it should be noted that in order to make the normalized data uniformly distributed between 0 and 1, the maximum and minimum values are not directly obtained, but the maximum and minimum data acquisition method is used, so the normalized value may exceed 1, when it exceeds 1, it is recorded as 1;

[0121] In step S520, the ecological restoration difficulty value is calculated: Stq=(k1*Psdg+k2*Psxg+k3*|Otcg|+k4*Fpjg) / 4; wherein Stq is the ecological restoration difficulty value, wherein k1, k2, k3 and k4 are respectively: Psdg weight coefficient, Psxg weight coefficient, |Otcg| weight coefficient and Fpjg weight coefficient, the sum of k1, k2, k3 and k4 is 1, the range of Stq is: [0, 1]; wherein Psdg is larger, the slope is higher, the restoration is more difficult, Psxg is larger, the plant growth is worse, |Otcz| is larger, the drainage measures or soil reinforcement operation is more, the restoration is more difficult, Fpjg is larger, the wind is more, so the rainfall is more, the drainage measures, the operation is more, the restoration is more difficult;

[0122] Step S521, when Stq is between [0, p1] for mild ecological restoration difficulty; when Stq is between (p1, p2] for moderate ecological restoration difficulty; when Stq is between (p2, 1] for severe ecological restoration difficulty; wherein p1 and p2 are difficulty classification levels; the size relationship is: 0 < p1 < p2 < 1;

[0123] In practical applications, because each value is uniformly distributed between 0 and 1, k1, k2, k3 and k4 can all be set to 0.25, p1 and p2 are set to 3.33 and 6.67, respectively, and Stq = (0.25*0.37+0.25*1+0.25*0+0.25*0.34) / 4 = 0.43, the calculation result is rounded to two decimal places, 0.43 is between (3.33, 6.67], so it is moderate ecological restoration difficulty. Based on the moderate ecological restoration difficulty, the difficulty of restoration is preliminarily understood, so it is convenient for subsequent planning of corresponding investment and corresponding ecological restoration and engineering restoration.

[0124] In embodiment 2, the electronic device can include a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory can communicate with each other through the communication bus. The memory stores computer readable instructions, and the processor can call the instructions in the memory. When the computer readable instructions are executed by the processor, the steps in the data processing method for high and steep slope ecological restoration based on three-dimensional simulation are run to realize the following functions: a three-dimensional model of the high and steep slope is constructed; a division plane is established, and a final analysis intersection point is obtained on the division plane; first to fourth coordinate points are obtained based on the final analysis intersection point, and the heights of the high and steep slope three-dimensional model at the positions of the final analysis intersection point and the first to fourth coordinate points are obtained and marked as Sz, S1, S2, S3 and S4, respectively; the overall slope, the overall slope direction and the overall concave-convex difference value are calculated based on Sz, S1, S2, S3 and S4, respectively; and the ecological restoration difficulty level is obtained based on the overall slope, the overall slope direction and the overall concave-convex difference value.

[0125] Further, the logic instructions in the above-mentioned memory can be realized in the form of software function units and sold or used as independent products, and can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the parts of the prior art that make contributions or parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

[0126] In embodiment 3, the present application further provides a computer program product, which comprises a computer program stored on a computer readable storage medium, and the computer program comprises program instructions, when the program instructions are executed by a computer, the computer can execute the data processing method for high and steep slope ecological restoration based on three-dimensional simulation provided by the above-mentioned methods, and the method comprises the following steps: constructing a three-dimensional model of a high and steep slope; establishing a division plane, and obtaining a final analysis intersection on the division plane; obtaining first to fourth coordinate points based on the final analysis intersection, and obtaining the height of the three-dimensional model of the high and steep slope at the positions of the final analysis intersection and the first to fourth coordinate points, and marking them as Sz, S1, S2, S3 and S4 respectively; calculating the overall slope, the overall slope direction and the overall concave-convex difference value based on Sz, S1, S2, S3 and S4 respectively; and obtaining the grade of the ecological restoration difficulty based on the overall slope, the overall slope direction and the overall concave-convex difference value.

[0127] In embodiment 4, the present application further provides a computer readable storage medium, and the present application provides a storage medium, which stores a computer program, and when the computer program is executed by a processor, the steps in the data processing method for high and steep slope ecological restoration based on three-dimensional simulation are run to realize the following functions: constructing a three-dimensional model of a high and steep slope; establishing a division plane, and obtaining a final analysis intersection on the division plane; obtaining first to fourth coordinate points based on the final analysis intersection, and obtaining the height of the three-dimensional model of the high and steep slope at the positions of the final analysis intersection and the first to fourth coordinate points, and marking them as Sz, S1, S2, S3 and S4 respectively; calculating the overall slope, the overall slope direction and the overall concave-convex difference value based on Sz, S1, S2, S3 and S4 respectively; and obtaining the grade of the ecological restoration difficulty based on the overall slope, the overall slope direction and the overall concave-convex difference value.

[0128] Through the description of the above embodiments, the embodiments of the present application can be provided as a method, a system or a computer program product. Based on such understanding, the above technical solutions can be embodied in the form of a software product, which can be stored in a computer readable storage medium, such as a ROM / RAM, a magnetic disk, an optical disk, etc., and includes a plurality of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute the methods described in various embodiments or some parts of the embodiments.

[0129] In the embodiments provided by the present application, it should be understood that the disclosed system or method can be implemented in other manners. The embodiments described above are merely schematic, and should not be construed as limiting. For example, the division of the modules or the units is merely logical function division, and there can be other division manners in actual implementation. For example, a plurality of modules or units can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between different modules can be indirect couplings or communication connections through some interfaces, and there can be electric, mechanical or other forms.

[0130] Finally, it should be noted that the above embodiments are merely used to illustrate the technical solutions of the present application, rather than limit them; even though the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still make modifications to the technical solutions recorded in the foregoing embodiments, or make equivalent replacements to some technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A data processing method for ecological restoration of high and steep slope based on three-dimensional simulation, characterized in that, The method comprises the following steps: constructing a three-dimensional model of the high and steep slope; establishing a division plane to obtain a final analysis intersection point on the division plane; obtaining first to fourth coordinate points based on the final analysis intersection point, and obtaining heights of the high and steep slope three-dimensional model at positions of the final analysis intersection point and the first to fourth coordinate points, and marking the heights as Sz, S1, S2, S3 and S4 respectively; calculating the overall slope, the overall slope direction and the overall concave-convex difference value based on Sz, S1, S2, S3 and S4 respectively; obtaining the ecological restoration difficulty level based on the overall slope, the overall slope direction and the overall concave-convex difference value; the step of establishing a division plane to obtain a final analysis intersection point on the division plane comprises the following sub-steps: obtaining a horizontal plane of the high and steep slope three-dimensional model, and marking the horizontal plane as the division plane; establishing a plane rectangular coordinate system on the division plane, with the west-east direction as the X-axis direction and the south-north direction as the Y-axis direction, and with the high and steep slope three-dimensional model in the first quadrant, and marking the plane rectangular coordinate system as the division plane coordinate system; in the division plane coordinate system, drawing m straight lines parallel to the Y-axis with an interval of n as the starting line and towards the positive direction of the X-axis, and marking the straight lines as Y-axis parallel lines, and drawing m straight lines parallel to the X-axis with an interval of n as the starting line and towards the positive direction of the Y-axis, and marking the straight lines as X-axis parallel lines; obtaining an intersection point of the X-axis parallel lines and the Y-axis parallel lines, and marking the intersection point as an initial analysis intersection point; if the initial analysis intersection point is on the high and steep slope three-dimensional model, marking the initial analysis intersection point as a final analysis intersection point.

2. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 1, characterized in that, the step of obtaining first to fourth coordinate points based on the final analysis intersection point, and obtaining heights of the high and steep slope three-dimensional model at positions of the final analysis intersection point and the first to fourth coordinate points, and marking the heights as Sz, S1, S2, S3 and S4 respectively comprises the following sub-steps: taking the final analysis intersection point as the starting point, obtaining a coordinate point with an interval of R towards the positive direction of the Y-axis, and marking the coordinate point as the first coordinate point; taking the final analysis intersection point as the starting point, obtaining a coordinate point with an interval of R towards the negative direction of the X-axis, and marking the coordinate point as the second coordinate point; taking the final analysis intersection point as the starting point, obtaining a coordinate point with an interval of R towards the positive direction of the X-axis, and marking the coordinate point as the third coordinate point; taking the final analysis intersection point as the starting point, obtaining a coordinate point with an interval of R towards the negative direction of the Y-axis, and marking the coordinate point as the fourth coordinate point; respectively obtaining heights of the high and steep slope three-dimensional model at positions of the final analysis intersection point, the first coordinate point, the second coordinate point, the third coordinate point and the fourth coordinate point, and marking the heights as Sz, S1, S2, S3 and S4 respectively.

3. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 2, characterized in that, the step of calculating the overall slope, the overall slope direction and the overall concave-convex difference value based on Sz, S1, S2, S3 and S4 respectively comprises the following sub-steps: calculating a horizontal plane height change rate Hbx= (S4-S1) / (2*R); wherein Hbx is the horizontal plane height change rate; calculating a vertical axis height change rate Hby= (S2-S3) / (2*R); wherein Hbx is the vertical axis height change rate; calculating a Sz point surrounding slope Psd=arctan(|Hbx|+|Hby|); wherein Psd is the Sz point surrounding slope; and the range of Psd is [0, 90°]. Obtain the Psd of all the final analysis intersection points, and calculate the average of the Psd of all the final analysis intersection points, which is marked as the overall slope.

4. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 3, characterized in that, The calculation of the overall slope, the overall slope direction and the overall concave-convex difference based on Sz, S1, S2, S3 and S4 further comprises the following sub-steps: The north direction is set as 0°, and the slope direction is increased clockwise, and the range of the slope direction is 0-360°; When Hby is equal to 0 and Hbx is greater than 0, the slope direction is 90°; when Hby is equal to 0 and Hbx is less than 0, the slope direction is 270°; When Hbx is equal to 0 and Hby is greater than 0, the slope direction is 0°; When Hbx is equal to 0 and Hby is less than 0, the slope direction is 180°; When Hby and Hbx are not equal to 0, the slope direction around the Sz point is calculated as: Psx=arctan(|Hby / Hbx|); wherein Psx is the slope direction around the Sz point, and the range of Psx is: [0, 90°]; When Hbx is greater than 0 and Hby is greater than 0, the slope direction is Psx; When Hbx is greater than 0 and Hby is less than 0, the slope direction is 360°-Psx; When Hbx is less than 0 and Hby is less than 0, the slope direction is Psx+180°; When Hbx is less than 0 and Hby is greater than 0, the slope direction is 180°-Psx; Obtain the slope direction of all the final analysis intersection points, and calculate the average of the slope direction of all the final analysis intersection points, which is marked as the overall slope direction.

5. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 4, characterized in that, The calculation of the overall slope, the overall slope direction and the overall concave-convex difference based on Sz, S1, S2, S3 and S4 further comprises the following sub-steps: The concave-convex difference of the Sz point is calculated as: Otc=[(|S4+S1|+|S2+S3|) / 2]-Sz; wherein Otc is the concave-convex difference of the Sz point; Obtain the Otc of all the final analysis intersection points, and calculate the average of the Otc of all the final analysis intersection points, which is marked as the overall concave-convex difference.

6. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 5, characterized in that, The calculation of the ecological restoration difficulty value based on the overall slope, the overall slope direction and the overall concave-convex difference comprises the following sub-steps: Mark the overall slope as Psdz; Normalize Psdz as: Psdg=(Psdz-Psdzmin) / (Psdzmax-Psdzmin); wherein Psdg is the normalized value of Psdz; Psdzmax is the maximum value of Psdz in the database, and Psdzmin is the minimum value of Psdz in the database; Calculate the average of Psx of all the final analysis intersection points, which is marked as Psxz, and when Hbx or Hby is 0 in the final analysis intersection points, the value of Psx is 0 when the average is calculated; Normalize Psxz as: Psxg=(psxz-psxzmin) / (psxzmax-psxzmin); wherein Psxg is the normalized value of Psxz; Psxzmax is the maximum value of Psxz in the database, and Psxzmin is the minimum value of Psxz in the database; Mark the overall concave-convex value as Otcz; |Otcg| is normalized as: Otcg= (|Otcz|-|Otczmin|) / (|Otcmax|-|Otczmin|); wherein |Otcg| is the normalized value of |Otcz|, |Otczmax| is the maximum value of |Otcz| in the database, and |Otczmin| is the minimum value of |Otcz| in the database.

7. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 6, characterized in that, The method for obtaining the ecological restoration difficulty value based on the overall slope, the overall slope direction and the overall concave-convex difference further comprises the following steps: An angle between the local wind direction and the overall slope direction is obtained and marked as Fpj; wherein the range of Fpj is [0, 180°]. Fpj is normalized as: Fpjg= (Fpj-Fpjmin) / (Fpjmax-Fpjmin); wherein Fpjg is the normalized value of Fpj, Fpjmax is the maximum value of Fpj in the database, and Fpjmin is the minimum value of Fpj in the database. The method for obtaining the ecological restoration difficulty value based on the overall slope, the overall slope direction and the overall concave-convex difference further comprises the following steps: The maximum and minimum data obtaining method is as follows: all Fpj values of the first number of high and steep slopes in the database are obtained and marked as database Fpj values.

8. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 7, characterized in that, The first number is marked as D1. The database Fpj values are sorted from small to large, and each database Fpj value is set to correspond to a sequence number which is an integer starting from 1. It is judged whether f1*D1 is an integer, if yes, the database Fpj value with the sequence number f1*D1 is marked as the first quantile value, if not, the average value of the database Fpj values corresponding to the sequence numbers on both sides of f1*D1 is calculated and marked as the first quantile value; wherein f1 is the first quantile coefficient, and the range of f1 is (0, 0.5). It is judged whether f2*D1 is an integer, if yes, the database Fpj value with the sequence number f2*D1 is marked as the second quantile value, if not, the average value of the database Fpj values corresponding to the sequence numbers on both sides of f2*D1 is calculated and marked as the second quantile value; wherein f2 is the second quantile coefficient, and f2= [(1 / f1)-1]*f1. The minimum value of the database Fpj is Fpjmin=Fd1-f3*(Fd2-Fd1). The maximum value of the database Fpj is Fpjmax=Fd2+f3*(Fd2-Fd1); wherein Fd1 is the first quantile value, Fd2 is the second quantile value, q1 is the minimum value of the database Fpj, q2 is the minimum value of the database Fpj, and f3 is the equation coefficient. The maximum and minimum data obtaining method is as follows: all Fpj values of the first number of high and steep slopes in the database are obtained and marked as database Fpj values. The method for obtaining the ecological restoration difficulty value based on the overall slope, the overall slope direction and the overall concave-convex difference further comprises the following steps: ​ 9. The data processing method for ecological restoration of high and steep slope based on three-dimensional simulation according to claim 8, characterized in that, ​ The ecological restoration difficulty value is calculated as: Stq= (k1*Psdg+k2*Psxg+k3*|Otcg|+k4*Fpjg) / 4; wherein Stq is the ecological restoration difficulty value, wherein k1, k2, k3 and k4 are respectively: Psdg weight coefficient, Psxg weight coefficient, |Otcg| weight coefficient and Fpjg weight coefficient, the sum of k1, k2, k3 and k4 is 1, and the range of Stq is: [0, 1]; When Stq is between [0, p1], it is a mild ecological restoration difficulty; When Stq is between (p1, p2], it is a moderate ecological restoration difficulty; When Stq is between (p2, 1], it is a severe ecological restoration difficulty; wherein p1 and p2 are difficulty classification levels; the size relationship is: 0<p1<p2<1.

Images