An airport runway damage calculation method and device

Abstract

The present invention discloses a method and device for calculating airport runway damage. The method includes: establishing an airport runway coordinate system; setting an airport runway area and a damage area according to the airport runway coordinate system; processing the airport runway area and the damage area to obtain a reserved area; and judging the reserved area to obtain an airport runway damage result. The method of the present invention can dynamically change the length and width parameters of the damage range according to the damage type during the simulation process by performing rectangular modeling on the damage area, and enhances its versatility. During the simulation process, the determination and deletion of areas that do not meet the runway takeoff and landing requirements are completed through step-by-step calculation. After reasonably selecting damage points, the number of reserved areas after segmentation will rapidly decrease as the number of damage points increases, enabling the algorithm to converge quickly and meeting the requirements of the solution during simulation operation.

Description

Technical Field

[0001] The present invention relates to the technical field of simulation calculation, and in particular to a method and device for calculating airport runway damage. Background Art

[0002] An airport generally consists of a runway, a parking apron, a group of hangars (shelters), a control tower, an airfield, etc. Since the airport runway has a large area and is exposed on the ground, it is the most vulnerable target to be damaged first in the airport. Conducting airport runway damage calculation has become a research hotspot in the field of airport status assessment. When using a certain method to damage or block the airport runway. Due to too many random factors involved, the number of integral multiplicities required by the analytical method is too large and the numerical calculation is too difficult, and it is basically not practical under the current computer counting conditions.

[0003] Using the Monte Carlo simulation method can avoid the difficulty of numerical calculation of multiple integrals. By performing geometric calculations on the damage points and damage areas, the damage calculation for blocking an airport runway once is completed, and the probability distribution of successful damage blocking is completed through multiple experiments using the Monte Carlo method.

[0004] What the Monte Carlo method outputs is a mapping between the number of damage points and the probability of successfully blocking the airport runway based on the dispersion of damage points and fixed damage conditions, which is mainly used for data analysis, so the requirement for real-time performance is not high.

[0005] Using the Monte Carlo simulation method, it basically cannot meet the requirements of practical applications in terms of operation complexity and operation time. In the face of the system damage simulation process, it is necessary to directly calculate whether the airport runway can be used normally after damage, and the algorithm process used by Monte Carlo cannot be realized. Summary of the Invention

[0006] The technical problem to be solved by the present invention is to provide a method and device for calculating airport runway damage, which can dynamically change the length and width parameters of the damage range according to the damage type during the simulation process by rectangular modeling of the damage area, and enhance its versatility.

[0007] To solve the above technical problem, a first aspect of an embodiment of the present invention discloses a method for calculating airport runway damage, the method comprising:

[0008] S1, establishing an airport runway coordinate system;

[0009] S2, setting an airport runway area and a damage area according to the airport runway coordinate system;

[0010] S3, processing the airport runway area and the damage area to obtain a reserved area;

[0011] S4, judging the reserved area to obtain the airport runway damage result.

[0012] As an alternative implementation, in the first aspect of the embodiments of the present invention, setting the airport runway area and the damage area according to the airport runway coordinate system includes:

[0013] S21. Set the airport runway area as a rectangle with a length of L and a width of W according to the airport runway coordinate system;

[0014] S22. Set the damage area as a regular quadrilateral with a side length of r.

[0015] As an alternative implementation, in the first aspect of the embodiments of the present invention, processing the airport runway area and the damage area to obtain a reserved area includes:

[0016] S31. Create a list of split areas and add the airport runway area to the list of split areas;

[0017] S32. Create a list of damage points, where the list of damage points includes N damage points and N is a positive integer;

[0018] S33. When the list of damage points is not empty, process any one of the damage points to obtain the damage area of the any one of the damage points;

[0019] S34. Use the damage area of the any one of the damage points to split the areas in the list of split areas to obtain split areas;

[0020] S35. Perform a deletion process on the split areas to obtain a reserved area.

[0021] As an alternative implementation, in the first aspect of the embodiments of the present invention, using the damage area of the any one of the damage points to split the areas in the list of split areas to obtain split areas includes:

[0022] S341. When the damage area of the any one of the damage points does not intersect with the airport runway area, perform a first split process on the areas in the list of split areas to obtain split areas;

[0023] S342. When only one vertex of the damage area of the any one of the damage points is within the airport runway area, perform a second split process on the areas in the list of split areas to obtain split areas;

[0024] S343. When two vertices of the damage area of the any one of the damage points are within the airport runway area, perform a third split process on the areas in the list of split areas to obtain split areas;

[0025] S344. When the damage area of any one of the damage points has four vertices within the airport runway area, perform a fourth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0026] S345. When the damage area of any one of the damage points and the airport runway area are in a completely truncated relationship, perform a fifth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0027] S346. When the damage area of any one of the damage points and the airport runway area are in a semi-truncated relationship, perform a sixth segmentation process on the areas in the segmentation area list to obtain segmentation areas.

[0028] As an optional implementation manner, in the first aspect of the embodiments of the present invention, the performing a deletion process on the segmentation areas to obtain remaining areas includes:

[0029] S351. Process the segmentation areas to obtain a set of segmentation graphics;

[0030] S352. Perform a summation operation on the elements in the set of segmentation graphics to obtain a sum graphic;

[0031] S353. Process the set of segmentation graphics to obtain a non-empty subset of the set of segmentation graphics;

[0032] S354. Process the set of segmentation graphics and the non-empty subset of the set of segmentation graphics to obtain remaining areas.

[0033] As an optional implementation manner, in the first aspect of the embodiments of the present invention, the judging the remaining areas to obtain the airport runway damage result includes:

[0034] Judge the remaining areas. When there is an area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is unblocked;

[0035] When there is no area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is successful in blocking.

[0036] As an optional implementation manner, in the first aspect of the embodiments of the present invention, the airport runway coordinate system takes the lower left corner of the airport runway as the origin, takes the long side of the airport runway as the horizontal axis, and the right direction is positive;

[0037] Take the short side of the airport runway as the vertical axis, and the upward direction is positive.

[0038] The second aspect of the embodiments of the present invention discloses an airport runway damage calculation device, and the device includes:

[0039] A coordinate construction module for establishing an airport runway coordinate system;

[0040] A region setting module for setting an airport runway region and a damage region according to the airport runway coordinate system;

[0041] A reserved region extraction module for processing the airport runway region and the damage region to obtain a reserved region;

[0042] A damage result calculation module for judging the reserved region to obtain an airport runway damage result.

[0043] As an optional implementation manner, in the second aspect of the embodiment of the present invention, the setting of the airport runway region and the damage region according to the airport runway coordinate system includes:

[0044] S21. According to the airport runway coordinate system, set the airport runway region as a rectangle with a length of L and a width of W;

[0045] S22. Set the damage region as a regular quadrilateral with a side length of r.

[0046] As an optional implementation manner, in the second aspect of the embodiment of the present invention, the processing of the airport runway region and the damage region to obtain a reserved region includes:

[0047] S31. Create a list of divided regions and add the airport runway region to the list of divided regions;

[0048] S32. Create a list of damage points, and the list of damage points includes N damage points, where N is a positive integer;

[0049] S33. When the list of damage points is not empty, process any one of the damage points to obtain the damage region of the any one of the damage points;

[0050] S34. Use the damage region of any one of the damage points to divide the regions in the list of divided regions to obtain divided regions;

[0051] S35. Perform a deletion process on the divided regions to obtain a reserved region.

[0052] As an optional implementation manner, in the second aspect of the embodiment of the present invention, the using the damage region of any one of the damage points to divide the regions in the list of divided regions to obtain divided regions includes:

[0053] S341. When the damage region of any one of the damage points does not intersect with the airport runway region, perform a first division process on the regions in the list of divided regions to obtain divided regions;

[0054] S342. When only one vertex of the damage area of any one of the damage points is within the airport runway area, perform a second segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0055] S343. When two vertices of the damage area of any one of the damage points are within the airport runway area, perform a third segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0056] S344. When four vertices of the damage area of any one of the damage points are within the airport runway area, perform a fourth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0057] S345. When the damage area of any one of the damage points and the airport runway area are in a completely truncated relationship, perform a fifth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0058] S346. When the damage area of any one of the damage points and the airport runway area are in a half-truncated relationship, perform a sixth segmentation process on the areas in the segmentation area list to obtain segmentation areas.

[0059] As an optional implementation manner, in the second aspect of the embodiments of the present invention, the deleting the segmentation areas to obtain reserved areas includes:

[0060] S351. Process the segmentation areas to obtain a set of segmentation graphics;

[0061] S352. Perform a summation operation on the elements in the set of segmentation graphics to obtain a sum graphic;

[0062] S353. Process the set of segmentation graphics to obtain a non-empty subset of the set of segmentation graphics;

[0063] S354. Process the set of segmentation graphics and the non-empty subset of the set of segmentation graphics to obtain reserved areas.

[0064] As an optional implementation manner, in the second aspect of the embodiments of the present invention, the judging the reserved areas to obtain the airport runway damage result includes:

[0065] Judge the reserved areas. When there is an area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is not blocked;

[0066] When there is no area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is successful in blocking.

[0067] As an alternative embodiment, in the first aspect of the embodiments of the present invention, the airport runway coordinate system takes the lower left corner of the airport runway as the origin, the long side of the airport runway as the horizontal axis, with the right direction being positive;

[0068] and the short side of the airport runway as the vertical axis, with the upward direction being positive.

[0069] The third aspect of the present invention discloses another airport runway damage calculation device, and the device includes:

[0070] a memory storing executable program code;

[0071] a processor coupled to the memory;

[0072] The processor calls the executable program code stored in the memory and executes some or all of the steps in the airport runway damage calculation method disclosed in the first aspect of the embodiments of the present invention.

[0073] The fourth aspect of the present invention discloses a computer-readable storage medium, and the computer-readable storage medium stores computer instructions, which are used to execute some or all of the steps in the airport runway damage calculation method disclosed in the first aspect of the embodiments of the present invention when being called.

[0074] Compared with the prior art, the embodiments of the present invention have the following beneficial effects:

[0075] By performing rectangular modeling on the damaged area, the method of the present invention can dynamically change the length and width parameters of the damaged range according to the damage type during the simulation process, and enhances its generality. During the simulation process, the determination and deletion of the area that does not meet the runway takeoff and landing requirements are completed through step-by-step calculation. After reasonably selecting the damage points, the number of remaining areas after segmentation will rapidly decrease as the number of damage points increases, enabling the algorithm to converge quickly and meeting the requirements of the solution during the simulation operation. BRIEF DESCRIPTION OF THE DRAWINGS

[0076] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present invention, and those of ordinary skill in the art can also obtain other drawings based on these drawings without creative efforts.

[0077] Figure 1 is a flowchart of an airport runway damage calculation method disclosed in an embodiment of the present invention;

[0078] Figure 2 is a schematic diagram showing that the damaged area of the damage point does not intersect with the airport runway area disclosed in an embodiment of the present invention;

[0079] Figure 3Schematic diagram when only one vertex of the damage area of the damage point disclosed in the embodiment of the present invention is within the airport runway area;

[0080] Figure 4 Schematic diagram when two vertices of the damage area of the damage point disclosed in the embodiment of the present invention are within the airport runway area;

[0081] Figure 5 Schematic diagram when four vertices of the damage area of the damage point disclosed in the embodiment of the present invention are within the airport runway area;

[0082] Figure 6 Schematic diagram when the damage area of the damage point disclosed in the embodiment of the present invention and the airport runway area are in a completely truncated relationship;

[0083] Figure 7 Schematic diagram when the damage area of the damage point disclosed in the embodiment of the present invention and the airport runway area are in a semi-truncated relationship;

[0084] Figure 8 Schematic diagram of the addition sum of the connection relationship graphics disclosed in the embodiment of the present invention;

[0085] Figure 9 Schematic diagram of the addition sum of the non-connection relationship graphics disclosed in the embodiment of the present invention;

[0086] Figure 10 Schematic diagram of the flow of another method for calculating airport runway damage disclosed in the embodiment of the present invention;

[0087] Figure 11 Schematic diagram of the structure of an airport runway damage calculation device disclosed in the embodiment of the present invention;

[0088] Figure 12 Schematic diagram of the structure of another airport runway damage calculation device disclosed in the embodiment of the present invention. Detailed implementation manners

[0089] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0090] In the description, claims and above-mentioned drawings of the present invention, terms such as "first", "second", etc. are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, device, product or equipment that includes a series of steps or units is not limited to the listed steps or units, but optionally further includes steps or units not listed, or optionally further includes other steps or units inherent to these processes, methods, products or equipment.

[0091] Reference to "embodiment" herein means that a particular feature, structure or characteristic described in connection with the embodiment can be included in at least one embodiment of the present invention. The phrase appears in various places in the specification and does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment mutually exclusive with other embodiments. Those skilled in the art will explicitly and implicitly understand that the embodiments described herein can be combined with other embodiments.

[0092] The present invention discloses an airport runway damage calculation method and device. The method includes: establishing an airport runway coordinate system; setting an airport runway area and a damage area according to the airport runway coordinate system; processing the airport runway area and the damage area to obtain a reserved area; and judging the reserved area to obtain an airport runway damage result. By rectangularly modeling the damage area, the method of the present invention can dynamically change the length and width parameters of the damage range according to the damage type during the simulation process, and enhance its versatility. During the simulation process, the determination and deletion of areas that do not meet the runway takeoff and landing requirements are completed through step-by-step calculation. After reasonably selecting the damage points, the number of reserved areas after segmentation will rapidly decrease as the number of damage points increases, enabling the algorithm to converge quickly and meeting the requirements of the solution during the simulation operation. The following will be described in detail respectively.

[0093] Embodiment 1

[0094] Please refer to Figure 1 , Figure 1 which is a schematic flowchart of an airport runway damage calculation method disclosed in an embodiment of the present invention. Among them, Figure 1 the described airport runway damage calculation method is applied to the field of simulation calculation technology. By rectangularly modeling the damage area, the length and width parameters of the damage range can be dynamically changed according to the damage type during the simulation process, and its versatility is enhanced. The embodiments of the present invention are not limited. As Figure 1 shown, the airport runway damage calculation method may include the following operations:

[0095] S1, establish an airport runway coordinate system;

[0096] S2, set an airport runway area and a damage area according to the airport runway coordinate system;

[0097] S3. Process the airport runway area and the damage area to obtain a reserved area;

[0098] S4. Judge the reserved area to obtain the damage result of the airport runway.

[0099] Optionally, setting the airport runway area and the damage area according to the airport runway coordinate system includes:

[0100] S21. According to the airport runway coordinate system, set the airport runway area as a rectangle with a length of L and a width of W; the length L and the width W are set according to the actual simulation scenario;

[0101] S22. Set the damage area as a regular quadrilateral with a side length of r. The side length r is set according to the actual simulation experiment.

[0102] Optionally, processing the airport runway area and the damage area to obtain a reserved area includes:

[0103] S31. Create a list of divided areas and add the airport runway area to the list of divided areas;

[0104] S32. Create a list of damage points. The list of damage points includes N damage points, and N is a positive integer;

[0105] S33. When the list of damage points is not empty, process any one of the damage points to obtain the damage area of the any one of the damage points;

[0106] S34. Use the damage area of any one of the damage points to divide the areas in the list of divided areas to obtain divided areas;

[0107] S35. Perform a deletion process on the divided areas to obtain a reserved area.

[0108] Optionally, using the damage area of any one of the damage points to divide the areas in the list of divided areas to obtain divided areas includes:

[0109] S341. When the damage area of any one of the damage points does not intersect with the airport runway area, perform a first division process on the areas in the list of divided areas to obtain divided areas;

[0110] Figure 2 It is a schematic diagram showing that the damage area of the damage point disclosed in the embodiment of the present invention does not intersect with the airport runway area;

[0111] Define A divides B (B is divided by A), denoted as B / A; use X to represent the set of divided figures.

[0112] The damage point's damage area (rectangle A) damages the airport runway (target rectangle B), and it is set that the side length r of A is not greater than the serviceable runway length l of rectangle B. In Figure 2 the scenario, B / A = {B}.

[0113] S342. When only one vertex of the damage area of any one damage point is within the airport runway area, perform a second segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0114] Figure 3 is a schematic diagram when only one vertex of the damage area of the damage point disclosed in the embodiment of the present invention is within the airport runway area; a regular quadrilateral has only one vertex within rectangle B. In this case, A divides B into B1 and B2.

[0115] S343. When two vertices of the damage area of any one damage point are within the airport runway area, perform a third segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0116] Figure 4 is a schematic diagram when two vertices of the damage area of the damage point disclosed in the embodiment of the present invention are within the airport runway area; in this case, A divides B into B1, B2, and B3.

[0117] S344. When four vertices of the damage area of any one damage point are within the airport runway area, perform a fourth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0118] Figure 5 is a schematic diagram when four vertices of the damage area of the damage point disclosed in the embodiment of the present invention are within the airport runway area; in this case, A divides B into B1, B2, B3, and B4.

[0119] S345. When the damage area of any one damage point and the airport runway area are in a completely truncated relationship, perform a fifth segmentation process on the areas in the segmentation area list to obtain segmentation areas;

[0120] Figure 6 is a schematic diagram when the damage area of the point disclosed in the embodiment of the present invention and the airport runway area are in a completely truncated relationship; as the segmentation progresses, the area becomes fragmented, and there is a situation where the divided area A divides B into B1 and B2.

[0121] S346. When the damage area of any one damage point and the airport runway area are in a half-truncated relationship, perform a sixth segmentation process on the areas in the segmentation area list to obtain segmentation areas.

[0122] Figure 7Schematic diagram when the damage area of the damage point disclosed in the embodiment of the present invention and the airport runway area are in a semi-cut-off relationship;

[0123] Optionally, the process of deleting the divided area to obtain the reserved area includes:

[0124] S351. Process the divided area to obtain a set of divided graphics;

[0125] S352. Perform a summation operation on the elements in the set of divided graphics to obtain a sum graphic;

[0126] Define the graphic addition rule as follows:

[0127] Define: an empty graphic ○, the length and width of the empty graphic are both 0.

[0128] The result of adding a graphic and an empty graphic is the original graphic

[0129] A + ○ = ○

[0130] (1) Adjacent

[0131] Graphics A1 and A2 are adjacent, and the graphic X = A1 + A2 is as Figure 8 shown.

[0132] (2) Non - adjacent

[0133] Graphics A1 and A2 are non - adjacent

[0134] A1 + A2 = ○

[0135] Figure 9 Schematic diagram of the addition and of non - adjacent relationship graphics disclosed in the embodiment of the present invention;

[0136] Addition satisfies the associative law and supports cumulative superposition; the new graphic generated by the result of addition has the characteristics that the width is monotonically non - decreasing and the length is monotonically non - increasing.

[0137] S353. Process the set of divided graphics to obtain a non - empty subset of the set of divided graphics;

[0138] S354. Process the set of divided graphics and the non - empty subset of the set of divided graphics to obtain the reserved area.

[0139] The set of N + 1 graphics retained in the divided area is S{A, B1, B2... BN}. Let the set of divided graphics X = {x|x ∈ S, x ≠ A}. Define the sum of the elements of the set X as a graphic T(X) = ∑x(x ∈ X). The non - empty subsets of X have 2 n - 1, which are Y(1), Y(2), …, Y(2 n - 1) respectively.

[0140] Among the following conditions that A in S satisfies, A can be deleted if it meets one of them:

[0141] (1) The length of A is less than l;

[0142] (2) For any non-empty Y(i), when A + T(Y(i)) cannot cover S.

[0143] (3) Since graphic addition does not satisfy the commutative law, the images in Y(i) need to be sorted by the bottom edge for addition in order.

[0144] Optionally, the judgment on the reserved area to obtain the damage result of the airport runway includes:

[0145] When judging the reserved area, if there is an area with a length greater than or equal to l and a width greater than or equal to w, the damage result of the airport runway is unblocked;

[0146] When there is no area with a length greater than or equal to l and a width greater than or equal to w, the damage result of the airport runway is successful block. The values of l and w are set by actual simulation experiments and are not limited in this embodiment.

[0147] Optionally, the airport runway coordinate system takes the lower left corner of the airport runway as the origin, the long side of the airport runway as the horizontal axis, and the right direction as the positive direction;

[0148] The short side of the airport runway is used as the vertical axis, and the upward direction is the positive direction.

[0149] Optionally, the method for judging the reserved area to obtain the damage result of the airport runway is:

[0150] Calculate whether there is a minimum takeoff and landing window on the airport runway. The problem is to use an algorithm to judge the damage result of the airport runway (whether there is a minimum takeoff and landing area) under the known length and width of the airport runway, the reserved area (position, length and width), and the length and width of the minimum takeoff and landing area (an area with a length greater than or equal to l and a width greater than or equal to w).

[0151] It can be seen that the method of the present invention can dynamically change the length and width parameters of the damage range according to the damage type by rectangular modeling of the damaged area during the simulation process, and enhances its versatility. During the simulation process, the determination and deletion of the area that does not meet the runway takeoff and landing requirements are completed through step-by-step calculation. After reasonably selecting the damage points, the number of reserved areas after segmentation will rapidly decrease as the number of damage points increases, enabling the algorithm to converge quickly and meeting the requirements of the solution during the simulation operation.

[0152] Embodiment 2

[0153] Please refer to Figure 10 , Figure 10 which is a schematic flowchart of another method for calculating the damage of an airport runway disclosed in the embodiment of the present invention. Among them, Figure 10The described method for calculating airport runway damage is applied to the field of simulation calculation technology. By modeling the damaged area as a rectangle, the length and width parameters of the damaged range can be dynamically changed according to the damage type during the simulation process, and its versatility is enhanced. The embodiments of the present invention are not limited. As Figure 10 shown, the method for calculating airport runway damage may include the following operations:

[0154] 1. Element modeling

[0155] (1) The damaged area is abstracted as a regular quadrilateral with side length r.

[0156] (2) The airport runway is abstracted as a rectangle with length L and width W;

[0157] (3) For the airport runway to be serviceable, it is required that there exists an area with a length not less than l and a width not less than w.

[0158] 2. Coordinate system and concept description

[0159] Taking the lower left corner of the runway as the origin, with the long side as the horizontal axis (positive to the right) and the short side as the vertical axis (positive upwards), a rectangular coordinate system is established.

[0160] Graph. In this embodiment, the operation object is a graph, and an image is a rectangular area in the above coordinate system. It is represented by ((lower left coordinate), (upper right coordinate)). As the graph G = ((x l , y b ), (x r , y t ))

[0161] 3. Algorithm process

[0162] In the initial state, the airport runway is a rectangle. Under the segmentation of the damaged area, by judging the relationship between the damaged area and the segmented area, the airport runway (the segmented area) is divided into several new areas, called reserved areas.

[0163] Judge the reserved areas to see if they can cover a serviceable runway graph. If so, it means not blocked; otherwise, the blocking is successful.

[0164] 4. Segmentation rules

[0165] Define A divides B (B is divided by A), denoted as B / A; use X to represent the set of graphs after segmentation.

[0166] The damage point damage area (rectangle A) to the airport runway (target rectangle B), and it is set that the side length r of A is greater than the serviceable runway length l of rectangle B. The segmentation methods include the following:

[0167] (1) Disjoint relationship or adjacent (non - intersecting), as Figure 2 shown.

[0168] The non - intersection condition is expressed as:

[0169] B / A = {B}

[0170] The small rectangle does not divide the target rectangle.

[0171] (2) Single - interior - point division

[0172] The square has exactly one vertex inside rectangle B. In this case, A divides B into B1 and B2. As Figure 3 shown.

[0173] (3) Double - interior - point division, as Figure 4 shown.

[0174] (4) Complete division, as Figure 5 shown.

[0175] (5) Full truncation, as Figure 6 shown.

[0176] As the division progresses, the region becomes fragmented and divided regions appear.

[0177] (6) Half truncation, as Figure 7 shown.

[0178] 5. Addition of graphics

[0179] The division method determines that there will be no horizontal connection along the x - axis among all the remaining graphics. The goal of graphic addition is to combine the connections between vertically - connected graphics to generate a graphic result for judgment.

[0180] Define the graphic addition rules as follows:

[0181] Definition: The empty graphic ○, the length and width of the empty graphic are both 0.

[0182] (1) The result of adding a graphic and the empty graphic is the original graphic

[0183] A + ○ = ○

[0184] (2) Connection

[0185] Graphics A1 and A2 are connected. The graphic X = A1 + A2, as Figure 8 shown.

[0186] (3) Non - connection

[0187] Graphics A1 and A2 are not connected, as Figure 9 shown.

[0188] A1 + A2 = ○

[0189] Addition satisfies the associative law and supports cumulative superposition. The new figure generated by the result of addition has the following characteristics: the width is monotonically non-decreasing, and the length is monotonically non-increasing.

[0190] 6. Determine the deletion conditions for the figures after segmentation

[0191] The set of N + 1 retained figures is S{A, B1, B2... BN}. Let the set X = {x|x|x ∈ S, x ≠ A}. Define the sum of the elements of the set X as a figure T(X) = Σx (x ∈ X). The non-empty subsets of X have 2 n -1, which are Y(1)... Y(2 n -1).

[0192] A in S can be deleted if it satisfies one of the following conditions:

[0193] (1) The length of A is less than l, i.e., Ax < l;

[0194] (2) For any non-empty Y(i), when A + T(Y(i)) cannot cover S, where Y(i) represents the i-th non-empty subset.

[0195] (3) Since the figure addition does not satisfy the commutative law, the addition needs to be sorted according to the bottom edges of the images in Y(i) and added in order.

[0196] 7. Deletion judgment process

[0197] Define a recursively called process BOOL P(A), with a parameter of an image A and a return value of a boolean value used to indicate whether to retain (true) or delete (false). The pseudo-code of the process is as follows:

[0198] BOOL P(A)

[0199] {

[0200] if (the length of A is less than l)

[0201] {

[0202] Delete the figure A;

[0203] return FALSE;

[0204] } / / end the length of A is less than l

[0205] else if (the length of A is greater than l and the width of A is greater than w)

[0206] {

[0207] return TRUE;

[0208] }

[0209] else (the width of A is less than w)

[0210] {

[0211] Obtain the set s of adjacent graphics;

[0212] if (the set S is empty) return the deletion flag;

[0213] else

[0214] {

[0215] Traverse each adjacent graphic B and execute

[0216] {

[0217] Generate a new graphic A' from A + B

[0218] return execute P(A');

[0219] }

[0220] }

[0221] }

[0222] }

[0223] It can be seen that the method of the present invention can dynamically change the length and width parameters of the damage range according to the damage type during the simulation process by modeling the damaged area as a rectangle, and enhances its versatility. During the simulation process, the determination and deletion of the area that does not meet the runway takeoff and landing requirements are completed through step-by-step calculation. After reasonably selecting the damage points, the number of remaining areas after segmentation will rapidly decrease as the number of damage points increases, enabling the algorithm to converge quickly and meeting the requirements of the solution during the simulation operation.

[0224] Embodiment 3

[0225] Please refer to Figure 11 , Figure 11 which is a schematic structural diagram of an airport runway damage calculation device disclosed in an embodiment of the present invention. Among them, Figure 11 The described airport runway damage calculation device is applied to the field of simulation calculation technology. By modeling the damaged area as a rectangle, it can dynamically change the length and width parameters of the damage range according to the damage type during the simulation process, and enhances its versatility. The embodiments of the present invention are not limited. As Figure 11 shown, the airport runway damage calculation device may include the following operations:

[0226] S301, a coordinate construction module, for establishing an airport runway coordinate system;

[0227] S302, a region setting module, for setting the airport runway region and the damage region according to the airport runway coordinate system;

[0228] S303, a reserved area extraction module, is configured to process the airport runway area and the damage area to obtain a reserved area;

[0229] S304, a damage result calculation module, is configured to judge the reserved area to obtain an airport runway damage result.

[0230] Embodiment Four

[0231] Please refer to Figure 12 , Figure 12 , which is a schematic structural diagram of another airport runway damage calculation device disclosed in the embodiments of the present invention. Among them, Figure 12 The described airport runway damage calculation device is applied to the field of simulation calculation technology. By performing rectangular modeling on the damage area, the length and width parameters of the damage range can be dynamically changed according to the ammunition type during the simulation process, and its versatility is enhanced. The embodiments of the present invention are not limited. As Figure 12 shown, the airport runway damage calculation device may include the following operations:

[0232] A memory 401 storing executable program code;

[0233] A processor 402 coupled to the memory 401;

[0234] The processor 402 calls the executable program code stored in the memory 401 to execute the steps in the airport runway damage calculation method described in Embodiment One and Embodiment Two.

[0235] Embodiment Five

[0236] The embodiments of the present invention disclose a computer-readable storage medium storing a computer program for electronic data exchange, wherein the computer program enables a computer to execute the steps in the airport runway damage calculation method described in Embodiment One and Embodiment Two.

[0237] The device embodiments described above are merely illustrative. The modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed to multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. A person of ordinary skill in the art can understand and implement it without creative labor.

[0238] Through the specific descriptions of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on such an understanding, the above technical solution, in essence, or the part that contributes to the prior art can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, and the storage medium includes read-only memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), one-time programmable read-only memory (OTPROM), electrically-erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc memories, magnetic disk memories, tape memories, or any other computer-readable medium that can be used to carry or store data.

[0239] Finally, it should be noted that: The airport runway damage calculation method and device disclosed in the embodiments of the present invention only disclose the preferred embodiments of the present invention, and are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements on some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for calculating airport runway damage, characterized in that: The method comprises: S1, establish the airport runway coordinate system; S2, setting an airport runway area and a damage area according to the airport runway coordinate system; S3, processing the airport runway area and the damaged area to obtain a reserved area, including: S31, creating a segmented area list, and adding the airport runway area to the segmented area list; S32, creating a damage point list, wherein the damage point list includes N damage points, where N is a positive integer; S33, when the damage point list is not empty, processing any damage point to obtain a damage area of ​​the any damage point; S34, using the damaged area of ​​any one of the damaged points, segmenting the area in the segmented area list to obtain segmented areas, including: S341, when the damage area of ​​any one of the damage points does not intersect with the airport runway area, performing a first segmentation process on the area in the segmentation area list to obtain segmentation areas, including: B / A={B} Among them, B / A means A divides B, A represents the damage point and damage area, and B represents the airport runway; S342: When the damage area of ​​any one of the damage points has only one vertex in the airport runway area, performing a second segmentation process on the area in the segmentation area list to obtain segmentation areas, including: A splits B into B1 and B2; S343: When the damage area of ​​any one of the damage points has two vertices within the airport runway area, a third segmentation process is performed on the area in the segmentation area list to obtain segmentation areas, including: A divides B into B1, B2 and B3; S344: When the damage area of ​​any one of the damage points has four vertices within the airport runway area, a fourth segmentation process is performed on the area in the segmentation area list to obtain segmentation areas, including: A divides B into B1, B2, B3 and B4; S345, when the damage area of ​​any one of the damage points is in a completely truncated relationship with the airport runway area, performing a fifth segmentation process on the area in the segmentation area list to obtain segmentation areas, including: A splits B into B1 and B2; S346, when the damage area of ​​any one of the damage points is in a semi-truncation relationship with the airport runway area, performing a sixth segmentation process on the area in the segmentation area list to obtain a segmentation area; S35, deleting the segmented area to obtain a reserved area, including: S351, processing the segmented area to obtain a segmented graph set; S352, performing a sum operation on the elements in the segmentation graph set to obtain a sum graph, including: Define the graphic addition rule as follows: Definition: Empty shape ○, the length and width of the empty shape are both 0; The result of adding a graphic to an empty graphic is the original graphic: A+○＝○ (1) Connection Figures A1 and A2 are connected, and figure X = A1 + A2; (2) Not connected Figures A1 and A2 are not connected; A1+A2=○ S353, processing the segmentation graphic set to obtain a non-empty subset of the segmentation graphic set; S354, processing the segmentation graphic set and the non-empty subset of the segmentation graphic set to obtain a reserved area, including: The set of N+1 graphics retained in the segmented area is S{A, B1, B2...BN}; let the segmented graphics set X = {x|x∈S, x≠A}; define the sum of the elements of the set X as a graph T(X) = ∑x, x∈X; the non-empty subsets of X have 2 n -1, namely Y(1), Y(2), ..., Y(2 n -1); Graph A in S can be deleted if one of the following conditions is met: (1) The length of A is less than l; (2) For any non-empty Y(i), when A+T(Y(i)) cannot cover S; (3) Since graphic addition does not satisfy the commutative law, the addition requires that the images in Y(i) be sorted according to the bottom edge and added in order; the deletion process is: Define a recursive procedure BOOL P(A), with an image A as a parameter and a return value of a Boolean value used to indicate whether to keep true or delete false. The pseudo code of the procedure is as follows: BOOL P(A) { if(the length of A is less than l) { Delete figure A; return FALSE; } / / end The length of A is less than l else if (the length of A is greater than l, and the width of A is greater than w) { return TRUE; } else(the width of A is less than w) { Get the connected graphics set s; if (set S is empty) return the deletion flag; else { Traverse each connected graph B and execute { A+B generates a new graph A' return execute P(A'); } } } } S4, judging the reserved area to obtain the airport runway damage result.

2. The airport runway damage calculation method according to claim 1, characterized in that: The setting of the airport runway area and the damage area according to the airport runway coordinate system includes: S21, according to the airport runway coordinate system, setting the airport runway area to a rectangle with a length of L and a width of W; S22, set the damage area to a regular quadrilateral with a side length of r.

3. The airport runway damage calculation method according to claim 1, characterized in that: The step of judging the reserved area to obtain the airport runway damage result includes: The reserved area is judged, and when there is an area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is unblocked; When there is no area with a length greater than or equal to l and a width greater than or equal to w, the airport runway damage result is a successful blockade.

4. The airport runway damage calculation method according to claim 1, characterized in that: The airport runway coordinate system takes the lower left corner of the airport runway as the origin, the long side of the airport runway as the horizontal axis, and the right side is positive; The short side of the airport runway is the vertical axis, with upward being positive.

5. An airport runway damage calculation device, characterized in that: The device comprises: Coordinate construction module, used to establish the airport runway coordinate system; An area setting module, used for setting an airport runway area and a damage area according to the airport runway coordinate system; The reserved area extraction module is used to process the airport runway area and the damaged area to obtain a reserved area, including: S31, creating a segmented area list, and adding the airport runway area to the segmented area list; S32, creating a damage point list, wherein the damage point list includes N damage points, where N is a positive integer; S33, when the damage point list is not empty, processing any damage point to obtain a damage area of ​​the any damage point; S34, using the damaged area of ​​any one of the damaged points, segmenting the area in the segmented area list to obtain segmented areas, including: S341, when the damage area of ​​any one of the damage points does not intersect with the airport runway area, performing a first segmentation process on the area in the segmentation area list to obtain segmentation areas, including: B / A={B} Among them, B / A means A divides B, A represents the damage point and damage area, and B represents the airport runway; S342: When the damage area of ​​any one of the damage points has only one vertex in the airport runway area, performing a second segmentation process on the area in the segmentation area list to obtain segmentation areas, including: A splits B into B1 and B2; S343: When the damage area of ​​any one of the damage points has two vertices within the airport runway area, a third segmentation process is performed on the area in the segmentation area list to obtain segmentation areas, including: A divides B into B1, B2 and B3; S344: When the damage area of ​​any one of the damage points has four vertices within the airport runway area, a fourth segmentation process is performed on the area in the segmentation area list to obtain segmentation areas, including: A divides B into B1, B2, B3 and B4; S345, when the damage area of ​​any one of the damage points is in a completely truncated relationship with the airport runway area, performing a fifth segmentation process on the area in the segmentation area list to obtain segmentation areas, including: A splits B into B1 and B2; S346, when the damage area of ​​any one of the damage points is in a semi-truncation relationship with the airport runway area, performing a sixth segmentation process on the area in the segmentation area list to obtain a segmentation area; S35, deleting the segmented area to obtain a reserved area, including: S351, processing the segmented area to obtain a segmented graph set; S352, performing a sum operation on the elements in the segmentation graph set to obtain a sum graph, including: Define the graphic addition rule as follows: Definition: Empty shape ○, the length and width of the empty shape are both 0; The result of adding a graphic to an empty graphic is the original graphic: A+○＝○ (1) Connection Figures A1 and A2 are connected, and figure X = A1 + A2; (2) Not connected Figures A1 and A2 are not connected; A1+A2=○ S353, processing the segmentation graphic set to obtain a non-empty subset of the segmentation graphic set; S354, processing the segmentation graphic set and the non-empty subset of the segmentation graphic set to obtain a reserved area, including: The set of N+1 graphics retained in the segmented area is S{A, B1, B2...BN}; let the segmented graphics set X = {x|x∈S, x≠A}; define the sum of the elements of the set X as a graph T(X) = ∑x, x∈X; the non-empty subsets of X have 2 n -1, namely Y(1), Y(2), ..., Y(2 n -1); Graph A in S can be deleted if any of the following conditions are met: (1) The length of A is less than l; (2) For any non-empty Y(i), when A+T(Y(i)) cannot cover S; (3) Since graphic addition does not satisfy the commutative law, the addition requires that the images in Y(i) be sorted according to the bottom edge and added in order; the deletion process is: Define a recursive procedure BOOL P(A), with an image A as a parameter and a return value of a Boolean value used to indicate whether to keep true or delete false; the pseudo code of the procedure is as follows: else(the width of A is less than w) { Get the connected graphics set s; if (set S is empty) return the deletion flag; else { Traverse each connected graph B and execute { A+B generates a new graph A' return execute P(A'); } } } } The damage result calculation module is used to judge the reserved area and obtain the airport runway damage result.

6. An airport runway damage calculation device, characterized in that: The device comprises: A memory storing executable program code; a processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the airport runway damage calculation method as described in any one of claims 1-4.

7. A computer storable medium, characterized in that: The computer storable medium stores computer instructions, and when the computer instructions are called, they are used to execute the airport runway damage calculation method as described in any one of claims 1-4.

Images