Exploration hole distribution method

Abstract

The invention relates to the technical field of geotechnical engineering investigation, and discloses an exploration hole distribution method, which comprises the following steps of: obtaining the side length of each side of an exploration area; an exploration hole control interval is determined; boundary constraint is carried out on each edge of the exploration area; obtaining all corner points and constraint points of the exploration area, and numbering all corner points and constraint points; drawing an auxiliary square capable of wrapping all points of the exploration area, connecting one diagonal line, extracting four corner points of the square, and numbering the four corner points; triangulation is carried out by taking all corner points and equal division points of the exploration area and four corner points of the square as control points, and all edges taking the square corner points as vertexes and the square corner points are deleted; according to the method, automatic generation of finite elements and computer image processing are facilitated, rapid and automatic arrangement of fewer exploration holes can be realized under boundary constraint and spacing control, and efficiency and hole arrangement quality are greatly improved.

Description

Technical Field

[0001] The invention relates to the technical field of geotechnical engineering investigation, and in particular to an exploration hole arrangement method. Background Art

[0002] Geotechnical engineering investigation refers to the activities of identifying, analyzing, and evaluating the geological, environmental characteristics and geotechnical conditions of the construction site and preparing investigation documents according to the requirements of the construction project.

[0003] In geotechnical engineering investigation, the layout of exploration holes needs to meet certain requirements. For exploration areas such as regular parallelograms or rectangles, the layout of exploration holes is relatively simple. It only requires parallel lines of each edge to form a grid layout to achieve boundary constraints and spacing control requirements.

[0004] In the prior art, for an irregular convex polygonal exploration area, the number of exploration holes arranged on each edge is inconsistent and the spacing is inconsistent. Therefore, the spacing between exploration holes can only be controlled by manually making circles of a specified radius in sequence, which is labor-intensive, inefficient, and prone to errors. Summary of the invention

[0005] In view of this, the present invention provides an exploration hole layout method to solve the problem of large workload and low efficiency in exploration hole layout in irregular convex polygonal exploration areas.

[0006] The present invention provides a method for arranging exploration holes, comprising the following steps:

[0007] Get the length of each side of the exploration area;

[0008] Determine the control spacing of exploration holes;

[0009] Apply boundary constraints to each side of the exploration area;

[0010] Obtain all corner points and constraint points in the exploration area and number all corner points and constraint points;

[0011] Draw an auxiliary square that can enclose all points in the exploration area, connect one of the diagonals, extract the four corner points of the square and number them;

[0012] All corner points, equal division points and four corner points of the square in the exploration area are used as control points for triangulation, and all edges and square corner points with square corner points as vertices are deleted;

[0013] Get the coordinates of all triangle corner points, use the coordinates of each point as the exploration hole, and complete the hole layout.

[0014] Beneficial effects: The present invention uses triangulation to divide the exploration area into multiple non-overlapping triangles. By determining the relative positions and size relationships of these triangles, the positions of the exploration holes are determined. The triangulated triangles can better approximate complex boundaries, which is convenient for automatic finite element generation and computer image processing. This method can achieve fast and automatic arrangement of fewer exploration holes under boundary constraints and spacing control, greatly improving efficiency and hole layout quality.

[0015] In an optional implementation, the step of performing boundary constraints on each side of the exploration area includes:

[0016] Calculate the ratio of each side length to the control spacing, use the ratio as the equal division point of each side, and the constraint point as the equal division point.

[0017] Beneficial effect: The present invention adopts the ratio of each side length to the control spacing as the equal division point of each side, which can make the uniformity of the side length of the triangle formed after the segmentation the best, thereby making the layout of the exploration holes more reasonable.

[0018] In an optional implementation, the step of calculating the ratio of each side length to the control spacing and using the ratio as an equal fraction of each side includes:

[0019] Determine whether the ratio of each side length to the control spacing is an integer;

[0020] If the ratio is an integer, divide the corresponding side into equal parts of that integer;

[0021] If the ratio is a decimal, round it up to the nearest integer and use it as the equal fraction of the side.

[0022] Beneficial effect: The present invention rounds off the decimal value of the ratio as an equal fraction, thereby simplifying the calculation process. This simplification can significantly improve the calculation efficiency.

[0023] In an optional implementation, the step of numbering all corner points and constraint points includes:

[0024] All corner points and one of the constraint points are numbered in a counterclockwise or clockwise direction.

[0025] Beneficial effect: The present invention sequentially numbers all corner points and constraint points in a counterclockwise order, so that the direction in the coordinate system is always consistent with the mathematical positive direction, which is convenient for surveyors to accurately determine the position and direction of the points, thereby facilitating surveyors to accurately arrange holes in the exploration area.

[0026] In an optional implementation, the triangulation step uses a Delaunay triangulation method to perform triangulation.

[0027] Beneficial effects: The present invention adopts the Delaunay triangulation method, and the formed triangles do not overlap with each other, the formed triangles can cover the entire plane, and each point is not located in the circumscribed circle of the triangle that does not contain the point. The uniformity of the side lengths of the generated triangles is the best and is closest to an equilateral triangle.

[0028] In an optional implementation, all corner points, equally divided points and four corner points of the square in the exploration area are used as control points to perform triangulation, and all edges and square corner points with square corner points as vertices are deleted, and the steps of obtaining the coordinates of all triangle corner points, using the coordinates of each point as an exploration hole, and completing the hole arrangement step also include:

[0029] Calculate the side lengths of all triangles and determine the relationship between the side lengths of all triangles and the control spacing of the exploration holes;

[0030] If the side lengths of all triangles are less than or equal to the exploration hole control spacing, the coordinates of all triangle corner points are obtained, the coordinates of each point are used as the exploration hole, and the hole arrangement step is completed;

[0031] If there is a triangle with a side length greater than the exploration hole control spacing, the dimensionless radius of the circumscribed circle of all triangles with a side length greater than the exploration hole control spacing is calculated;

[0032] Insert a new point into the triangle with the largest dimensionless radius of the circumscribed circle, use this point as the center of the circumscribed circle of the triangle, and connect this point to the three corner points of the triangle.

[0033] Beneficial effect: The present invention calculates the dimensionless radius of the circumscribed circle of a triangle whose side length is greater than the control spacing of the exploration hole, inserts new points, and divides the triangle again, thereby improving the uniformity of the side length of the divided triangle.

[0034] In an optional implementation, the step of taking the point as the center of the circumscribed circle of the triangle and connecting the point with the three corner points of the triangle further includes:

[0035] Determine whether the point is within the circumcircle of a triangle;

[0036] If the point is within the circumscribed circle of a triangle, proceed to connect the point to the three corner points of the triangle;

[0037] If the point is within the circumscribed circles of multiple triangles, the common line is eliminated and the point is connected to all corner points of the cavity that eliminate the common line.

[0038] Beneficial effect: The present invention improves the uniformity of the side lengths of the divided triangles by eliminating common lines from points within the circumscribed circles of multiple triangles and connecting the points with all corner points of the cavities from which the common lines are eliminated.

[0039] In an optional implementation, the new point is the center of the circumscribed circle of a triangle with a side length exceeding the exploration hole control interval and having the largest dimensionless radius.

[0040] In an optional implementation, if there is a triangle with a side length greater than the exploration hole control spacing, then the step of calculating the dimensionless radius of the circumscribed circle of all triangles with a side length greater than the exploration hole control spacing, and the step of inserting a new point into the triangle with the largest dimensionless radius of the circumscribed circle, using the point as the center of the circumscribed circle of the triangle, and connecting the point to the three corner points of the triangle also include:

[0041] Sort the dimensionless radii of the circumscribed circles from largest to smallest.

[0042] Beneficial effect: The present invention sorts the dimensionless radii of the circumscribed circle from large to small, so as to facilitate obtaining the dimensionless radius of the maximum circumscribed circle.

[0043] In an optional embodiment, after sorting, the triangle that is most deviated from an equilateral triangle among the triangles whose side lengths exceed the control spacing of the exploration holes is obtained.

[0044] Beneficial effect: The present invention inserts a new point into the triangle that deviates most from an equilateral triangle and divides it again, so that the side length of the triangle after division is the most uniform and closest to an equilateral triangle.

[0045] In an optional embodiment, the exploration hole arrangement method further includes:

[0046] Check the side lengths of all triangles again. If the side lengths of all triangles are less than or equal to the exploration hole control spacing, return to the step of obtaining the coordinates of all triangle corner points, taking the coordinates of each point as the exploration hole, and completing the hole arrangement step. Otherwise, return to the step of calculating the dimensionless radius of the circumscribed circle of all triangles whose side lengths are greater than the exploration hole control spacing.

[0047] In an optional implementation, the exploration area is located in an auxiliary square, and two initial right-angled isosceles triangles formed by connecting diagonal vertices in the auxiliary square meet the Delaunay triangulation requirements.

[0048] In an optional implementation, all edges and square corner points with square corner points as vertices are deleted, and the edges of the exploration area are used as boundaries. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0050] Figure 1 A schematic diagram of a flow chart of an exploration hole arrangement method according to an embodiment of the present invention;

[0051] Figure 2 It is a schematic diagram of a method for arranging exploration holes in an embodiment of the present invention, after equally dividing each side of a convex polygon, extracting each point and adding an auxiliary square;

[0052] Figure 3 for Figure 2 Schematic diagram after Delaunay triangulation;

[0053] Figure 4 for Figure 3 Schematic diagram after removing the auxiliary square and numbering the triangles;

[0054] Figure 5 for Figure 4 Schematic diagram of the triangle with the largest dimensionless radius R after inserting new points and re-dividing it;

[0055] Figure 6 for Figure 5 Schematic diagram of the final layout of exploration holes. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0057] Combine the following Figures 1 to 6 , describing an embodiment of the present invention.

[0058] According to an embodiment of the present invention, a method for arranging exploration holes is provided, comprising the following steps:

[0059] Get the length of each side of the exploration area;

[0060] Determine the control spacing of exploration holes;

[0061] Apply boundary constraints to each side of the exploration area;

[0062] Obtain all corner points and constraint points in the exploration area and number all corner points and constraint points;

[0063] Draw an auxiliary square that can enclose all points in the exploration area, connect one of the diagonals, extract the four corner points of the square and number them;

[0064] All corner points, equal division points and four corner points of the square in the exploration area are used as control points for triangulation, and all edges and square corner points with square corner points as vertices are deleted;

[0065] Get the coordinates of all triangle corner points, use the coordinates of each point as the exploration hole, and complete the hole layout.

[0066] Specifically, in this embodiment, the exploration area is a convex polygon. Figure 1 As shown, the exploration hole arrangement method includes the following steps:

[0067] S1: Obtain the coordinates of each side of the convex polygon exploration area, calculate the length of each side through the coordinate values, determine the exploration hole control spacing m, and constrain all the side lengths of the convex polygon using the exploration hole control spacing m;

[0068] S2: extract all corner points and constraint points of the convex polygon, number all corner points and constraint points, then draw an auxiliary square that can enclose all points of the convex polygon, connect one of the diagonals, extract the four corner points of the square and number them;

[0069] S3: Use all corner points, equal division points and four corner points of the convex polygon as control points to perform triangulation, and delete all edges and corner points of the square that have the corner points of the square as vertices;

[0070] S4: Obtain the coordinates of all triangle corner points, use the coordinates of each point as the exploration hole, and complete the hole layout.

[0071] The present invention uses triangulation to divide the exploration area into multiple non-overlapping triangles. By determining the relative positions and size relationships of these triangles, the positions of the exploration holes are determined. The triangulated triangles can better approximate complex boundaries, which is convenient for automatic finite element generation and computer image processing. This method can achieve fast and automatic arrangement of fewer exploration holes under boundary constraints and spacing control, greatly improving efficiency and hole layout quality.

[0072] In one embodiment, the step of applying boundary constraints to each side of the exploration area includes:

[0073] Calculate the ratio of each side length to the control spacing, use the ratio as the equal division point of each side, and the constraint point as the equal division point.

[0074] Specifically, the step of performing boundary constraints on each side of the exploration area in step S1 of this embodiment includes:

[0075] S101: Divide all the side lengths of the convex polygon by m, and use the result as the equal division number of each side, and the constraint point is the equal division point.

[0076] The present invention adopts the ratio of each side length to the control spacing as the equal division point of each side, which can make the uniformity of the side length of the triangle formed after the segmentation the best, thereby making the hole layout position of the exploration hole more reasonable.

[0077] In one embodiment, the step of calculating the ratio of each side length to the control spacing and using the ratio as an equal fraction of each side includes:

[0078] Determine whether the ratio of each side length to the control spacing is an integer;

[0079] If the ratio is an integer, divide the corresponding side into equal parts of that integer;

[0080] If the ratio is a decimal, round it up to the nearest integer and use it as the equal fraction of the side.

[0081] Specifically, in this embodiment, the length of all sides of the convex polygon is divided by m, and the result is n. If n is an integer, the side is divided into n equal parts. If n is a decimal, the integer is rounded up to obtain the equal parts of the side.

[0082] The present invention rounds off the decimal value of the ratio as an equal fraction, thereby simplifying the calculation process. This simplification can significantly improve the calculation efficiency.

[0083] In one embodiment, the step of numbering all corner points and constraint points includes:

[0084] All corner points and one of the constraint points are numbered in a counterclockwise or clockwise direction.

[0085] Specifically, in this embodiment, the constraint points are the equally divided points in step S101, and in step S2, all corner points and equally divided points of the convex polygon are extracted and numbered in sequence counterclockwise from the upper leftmost point.

[0086] The present invention sequentially numbers all corner points and constraint points in a counterclockwise order, so that the direction in the coordinate system is always consistent with the mathematical positive direction, which is convenient for surveyors to accurately determine the position and direction of the points, thereby facilitating surveyors to accurately arrange holes in the exploration area.

[0087] In one embodiment, the triangulation step uses a Delaunay triangulation method to perform triangulation.

[0088] Specifically, the triangulation step in step S3 of this embodiment uses the Delaunay triangulation method to perform triangulation.

[0089] The present invention adopts the Delaunay triangulation method, and the formed triangles do not overlap with each other, the formed triangles can cover the entire plane, and each point is not located in the circumscribed circle of the triangle that does not contain the point. The uniformity of the side lengths of the generated triangles is the best and is closest to an equilateral triangle.

[0090] In one embodiment, all corner points, equally divided points and four corner points of the square in the exploration area are used as control points to perform triangulation, and all edges and square corner points with square corner points as vertices are deleted, and the steps of obtaining the coordinates of all triangle corner points, using the coordinates of each point as an exploration hole, and completing the hole arrangement step also include:

[0091] Calculate the side lengths of all triangles and determine the relationship between the side lengths of all triangles and the control spacing of the exploration holes;

[0092] If the side lengths of all triangles are less than or equal to the exploration hole control spacing, the coordinates of all triangle corner points are obtained, the coordinates of each point are used as the exploration hole, and the hole arrangement step is completed;

[0093] If there is a triangle with a side length greater than the exploration hole control spacing, the dimensionless radius of the circumscribed circle of all triangles with a side length greater than the exploration hole control spacing is calculated;

[0094] Insert a new point into the triangle with the largest dimensionless radius of the circumscribed circle, use this point as the center of the circumscribed circle of the triangle, and connect this point to the three corner points of the triangle.

[0095] Specifically, in this embodiment, between step S3 and step S4, the following steps are also included:

[0096] S301: Calculate the side lengths of all triangles, and determine the relationship between the side lengths of all triangles and the exploration hole control spacing m;

[0097] S302: If the side lengths of all triangles are less than or equal to the exploration hole control spacing m, the coordinates of all triangle corner points are obtained, the coordinates of each point are used as the exploration hole, and the hole arrangement step is completed;

[0098] S303: If there is a triangle with a side length greater than m, then for all triangles △k with a side length greater than m, calculate the dimensionless radius R(△k) of the circumscribed circle;

[0099] Among them, R (△ k) is calculated according to the length scale L (△ k) of the center of the circumscribed circle and the radius r (△ k) of the circumscribed circle according to the following formula:

[0100]

[0101] In this embodiment, the circle center length scale L(△k) is calculated based on the length scales of the three vertices of triangle △k, and the formula is as follows:

[0102]

[0103] In this embodiment, the vertex length scale L(△k1) is the average of the distances from vertex 1 to vertex 2 and vertex 3 of triangle △Sk. times.

[0104] S304: Insert a new point X(i) into the triangle with the largest dimensionless radius R(△k) of the circumscribed circle, use the point as the center of the circumscribed circle of the triangle, connect the point X(i) with the three corner points of the triangle, and perform step S301 again.

[0105] The present invention calculates the dimensionless radius of the circumscribed circle of a triangle whose side length is greater than the control spacing of the exploration holes, inserts new points, and divides the triangle again, thereby improving the uniformity of the side length of the divided triangle.

[0106] In one embodiment, the step of taking the point as the center of the circumscribed circle of the triangle and connecting the point to the three corner points of the triangle further includes:

[0107] Determine whether the point is within the circumcircle of a triangle;

[0108] If the point is within the circumscribed circle of a triangle, proceed to connect the point to the three corner points of the triangle;

[0109] If the point is within the circumscribed circles of multiple triangles, the common line is eliminated and the point is connected to all corner points of the cavity that eliminate the common line.

[0110] Specifically, step S304 in this embodiment includes:

[0111] Insert a new point X(i) into the triangle with the largest dimensionless radius R(△k) of the circumscribed circle, and use the point X(i) as the center of the circumscribed circle of the triangle. Determine whether the point X(i) is inside the circumscribed circle of a triangle. If the point X(i) is inside the circumscribed circle of a triangle, connect the point X(i) with the three corner points of the triangle. If the point X(i) is inside the circumscribed circles of multiple triangles, eliminate the common line and connect the point X(i) with all corner points of the cavity where the common line is eliminated.

[0112] The present invention eliminates common lines from points within the circumscribed circles of multiple triangles and connects the points with all corner points of the cavities from which the common lines are eliminated, thereby improving the uniformity of the side lengths of the divided triangles.

[0113] In one embodiment, the new point is the center of the circumscribed circle of a triangle with a side length exceeding the control interval of the exploration hole and having the largest dimensionless radius.

[0114] Specifically, in step S304 of this embodiment, a new point X(i) is inserted as the center of the circumscribed circle of the triangle with the largest dimensionless radius X(i) among the triangles with a side length exceeding m.

[0115] In one embodiment, if there is a triangle whose side length is greater than the exploration hole control spacing, then the step of calculating the dimensionless radius of the circumscribed circle of all triangles whose side length is greater than the exploration hole control spacing, and the step of inserting a new point into the triangle with the largest dimensionless radius of the circumscribed circle, taking the point as the center of the circumscribed circle of the triangle, and connecting the point with the three corner points of the triangle also include:

[0116] Sort the dimensionless radii of the circumscribed circles from largest to smallest.

[0117] Specifically, step S303 in this embodiment includes: if there is a triangle with a side length greater than m, then calculating the dimensionless radius R(△k) of the circumscribed circle of all triangles △k with a side length greater than m, and sorting R(△k) from large to small.

[0118] The present invention sorts the dimensionless radii of the circumscribed circle from large to small, so as to obtain the dimensionless radius of the maximum circumscribed circle.

[0119] In one embodiment, after sorting, the triangle most deviating from an equilateral triangle among the triangles whose side lengths exceed the control interval of the exploration holes is obtained.

[0120] Specifically, step S303 in this embodiment also includes: calculating the dimensionless radius R(△k) of the circumscribed circle of all triangles with side lengths greater than m and sorting them, and after sorting, finding the triangle that is most deviated from the regular triangle among the triangles with side lengths exceeding the control spacing m.

[0121] The present invention inserts a new point into the triangle that deviates most from the equilateral triangle and divides it again, so that the side length of the divided triangle is the most uniform and closest to the equilateral triangle.

[0122] In one embodiment, the exploration hole arrangement method further comprises:

[0123] Check the side lengths of all triangles again. If the side lengths of all triangles are less than or equal to the exploration hole control spacing, return to the step of obtaining the coordinates of all triangle corner points, taking the coordinates of each point as the exploration hole, and completing the hole arrangement step. Otherwise, return to the step of calculating the dimensionless radius of the circumscribed circle of all triangles whose side lengths are greater than the exploration hole control spacing.

[0124] Specifically, this embodiment further includes after step S304:

[0125] S305: Check the side lengths of all triangles again. If the side lengths of all triangles are less than or equal to m, return to step S302; otherwise, return to step S303.

[0126] In one embodiment, the exploration area is located in the auxiliary square, and two initial right-angled isosceles triangles formed by connecting diagonal vertices in the auxiliary square meet the Delaunay triangulation requirements.

[0127] Specifically, in step S2 of this embodiment, the auxiliary square can enclose the convex polygon, and two initial right-angled isosceles triangles formed by connecting one of the diagonal vertices meet the Delaunay triangulation requirements and can be used as the initial boundary conditions.

[0128] In one embodiment, all edges and square corners with the square corners as vertices are deleted, and the edges of the survey area are used as boundaries.

[0129] Specifically, in step S3 of this embodiment, all edges and square corner points with square corner points as vertices are deleted, and after the deletion, the edges of the convex polygon can be used as boundaries.

[0130] The exploration hole arrangement method of the present invention is applied to an actual embodiment, and the steps are as follows:

[0131] For example, taking a convex quadrilateral as an example, the lengths of the four sides are 149.34m, 260.92m, 310.88m and 275.473m respectively.

[0132] Step 1: Determine the exploration hole control spacing as 100m, divide the lengths of the four sides by 100 respectively, and since the results are all decimals, use the rounding method to divide the four sides into 2, 3, 4 and 3 parts respectively.

[0133] Step 2: Figure 2 As shown, all corner points and equally divided points of the convex polygon are extracted, and they are numbered counterclockwise from the upper leftmost point. An auxiliary square is drawn that can cover all points of the convex polygon, and one of the diagonals is connected. The four corner points of the square are extracted and numbered.

[0134] Step 3: Figure 3 and Figure 4 As shown, all corner points, equal division points and four corner points of the convex polygon are used as control points, and triangulation is performed using the Delaunay triangulation method.

[0135] Step 4: Calculate the side lengths of all triangles. In this example, there are multiple triangles with side lengths greater than 100m, so proceed to step 5.

[0136] Step 5. Calculate the dimensionless radius R(△k) of the circumscribed circle of all triangles △k with a side length greater than 100m. The lengths of the three sides of triangle △8 are 79.72m, 96.82m and 154.57m respectively, the radius of the circumscribed circle of triangle △8 is 91.07m, the length scale of the center of the circumscribed circle of triangle △8 is 95.58, and the dimensionless radius R of the circumscribed circle of triangle △8 is the largest among all triangles, and the result is 0.95.

[0137] Step 6: Figure 5 , insert the center X(1) of the circumscribed circle of triangle △8. Since it is located inside the circumscribed circle of triangles △8, △4 and △5, eliminate two common lines (side 36 and side 26), and connect X(1) with all corner points of the cavity after eliminating the common lines (point 2, point 3, point 5, point 6, point 10).

[0138] Step 7: Figure 6 , check all triangles again, if there are still triangles with side lengths greater than 100m, execute step 5 again until all triangle side lengths are no greater than 100m. Extract the coordinates of all triangle corner points, and name them in sequence according to the specified exploration hole number naming rules, which are the exploration holes arranged by boundary constraints and spacing control.

[0139] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for arranging exploration holes, characterized in that: The following steps are involved: Get the length of each side of the exploration area; Determine the control spacing of exploration holes; Apply boundary constraints to each side of the exploration area; Obtain all corner points and constraint points in the exploration area and number all corner points and constraint points; Draw an auxiliary square that can enclose all points in the exploration area, connect one of the diagonals, extract the four corner points of the square and number them; All corner points, equal division points and four corner points of the square in the exploration area are used as control points for triangulation, and all edges and square corner points with square corner points as vertices are deleted; Get the coordinates of all triangle corner points, use the coordinates of each point as the exploration hole, and complete the hole layout.

2. The exploration hole arrangement method according to claim 1, characterized in that: The step of performing boundary constraints on each side of the exploration area comprises: The ratio of each side length to the control spacing is calculated, and the ratio is used as the equal division point of each side, and the constraint point is the equal division point.

3. The exploration hole arrangement method according to claim 2, characterized in that: The step of calculating the ratio of each side length to the control spacing and using the ratio as an equal fraction of each side comprises: Determine whether the ratio of each side length to the control spacing is an integer; If the ratio is an integer, divide the corresponding side into equal parts of that integer; If the ratio is a decimal, round it up to the nearest integer and use it as the equal fraction of the side.

4. The exploration hole arrangement method according to claim 1, characterized in that: The step of numbering all corner points and constraint points comprises: All corner points and one of the constraint points are numbered in a counterclockwise or clockwise direction.

5. The exploration hole arrangement method according to claim 1, characterized in that: The triangulation step uses the Delaunay triangulation method to perform triangulation.

6. The exploration hole arrangement method according to claim 1, characterized in that: The step of using all corner points, equal points and four corner points of the square in the exploration area as control points to perform triangulation, and deleting all edges and square corner points with the square corner points as vertices, and the step of obtaining the coordinates of all triangle corner points, using the coordinates of each point as the exploration hole, and completing the hole arrangement step also includes: Calculating the side lengths of all triangles, and determining the relationship between the side lengths of all triangles and the control spacing of the exploration holes; If the side lengths of all triangles are less than or equal to the exploration hole control spacing, the coordinates of all triangle corner points are obtained, the coordinates of each point are used as the exploration hole, and the hole arrangement step is completed; If there is a triangle with a side length greater than the exploration hole control spacing, then the dimensionless radius of the circumscribed circle of all triangles with a side length greater than the exploration hole control spacing is calculated; Insert a new point into the triangle with the largest dimensionless radius of the circumscribed circle, use this point as the center of the circumscribed circle of the triangle, and connect this point to the three corner points of the triangle.

7. The exploration hole arrangement method according to claim 6, characterized in that: The step of taking the point as the center of the circumscribed circle of the triangle and the step of connecting the point with the three corner points of the triangle also includes: Determine whether the point is within the circumcircle of a triangle; If the point is within the circumscribed circle of a triangle, then the step of connecting the point to the three corner points of the triangle is performed; If the point is within the circumscribed circles of multiple triangles, the common line is eliminated and the point is connected to all corner points of the cavity that eliminate the common line.

8. The exploration hole arrangement method according to claim 6, characterized in that: The new point is the center of the circumscribed circle of the triangle with the largest dimensionless radius among the triangles whose side length exceeds the exploration hole control spacing.

9. The exploration hole arrangement method according to claim 6, characterized in that: The step of calculating the dimensionless radius of the circumscribed circle of all triangles whose side lengths are greater than the exploration hole control spacing if there are triangles whose side lengths are greater than the exploration hole control spacing, inserting a new point into the triangle with the largest dimensionless radius of the circumscribed circle, taking the point as the center of the circumscribed circle of the triangle, and connecting the point to the three corner points of the triangle also includes: Sort the dimensionless radii of the circumscribed circles from largest to smallest.

10. The exploration hole arrangement method according to claim 8, characterized in that: After sorting, the triangle most deviating from the regular triangle among the triangles whose side lengths exceed the control spacing of the exploration holes is obtained.

11. The method for arranging exploration holes according to any one of claims 6 to 10, characterized in that: Also includes: Check the side lengths of all triangles again. If the side lengths of all triangles are less than or equal to the exploration hole control spacing, return to the step of obtaining the coordinates of all triangle corner points, taking the coordinates of each point as the exploration hole, and completing the hole arrangement step. Otherwise, return to the step of calculating the dimensionless radius of the circumscribed circle of all triangles with side lengths greater than the exploration hole control spacing if the side lengths of all triangles are less than or equal to the exploration hole control spacing.

12. The exploration hole arrangement method according to claim 1, characterized in that: The exploration area is located in the auxiliary square, and two initial right-angled isosceles triangles formed by connecting diagonal vertices in the auxiliary square meet the Delaunay triangulation requirements.

13. The exploration hole arrangement method according to claim 1, characterized in that: The deletion of all edges and square corner points with the square corner points as vertices uses the edges of the exploration area as boundaries.

Images