Calculation method, device and equipment for volume of mattress layer and storage medium

Abstract

The invention discloses a calculation method, device and equipment for the volume of a mattress layer and a storage medium, and the method comprises the steps: carrying out the clustering processing of an initial point set of a pile center point of a composite foundation through a clustering algorithm, and obtaining a clustering set of the pile center point set; executing a rolling ball algorithm on the pile center point set clustering set, and searching an outer contour point set of each pile foundation area; the outer contour point sets of all the pile foundation areas are sequentially connected, and the coverage area of all the mattress layers is calculated by externally expanding the preset size; calculating the area volume of each mattress layer according to the coverage area of the mattress layer and the corresponding thickness of the mattress layer, and accumulating to obtain the total volume of the mattress layer. According to the method, the pile foundation area is automatically divided through the clustering algorithm to replace manual grouping, the contour is automatically generated through the ball algorithm to replace manual sketching and external expansion size and thickness parameterized input, an empirical formula is not needed, zero manual intervention is achieved, and missed calculation or repeated calculation caused by manual operation is avoided.

Description

Technical Field

[0001] The present application relates to the field of civil engineering technology, and more specifically, to a method, device, equipment and storage medium for calculating the volume of a mattress layer. Background Art

[0002] During the design process of building construction projects, composite foundations are often used to reinforce weak soils. Composite foundations are artificial foundations composed of natural soil and reinforcements, formed by reinforcing or replacing the natural foundation. The sand and gravel cushion between the composite foundation and the building foundation, called a cushion layer, can address the uneven load between the building foundation and the composite foundation. High-precision volumetric measurement achieved through intelligent algorithms is an inevitable requirement for the digital transformation of modern engineering.

[0003] Currently, the number of cushion layers in composite foundations is often calculated manually. Designers determine the composite foundation's pile diameter, length, and spacing based on the upper load and the characteristic bearing capacity of the undisturbed soil. A pile layout is drawn in AutoCAD. The outermost layer of piles is manually determined. The center of the outermost piles is connected and offset outward by a certain distance, resulting in a closed area representing the cushion layer. The area of ​​this area is measured and added to the cushion layers in other areas to obtain the total cushion layer area. This is then multiplied by the thickness to determine the cushion layer volume.

[0004] However, the traditional method requires manual drawing of the cushion layer contour line. Especially when the pile foundation is arranged in many areas and has irregular shapes, it is impossible to accurately calculate the range of the cushion layer, resulting in large deviations in the statistical quantity of the project. Each area needs to be processed one by one. The process is cumbersome and time-consuming. It is impossible to automatically divide the area or adjust the contour line according to the actual distribution of the pile foundation. It is highly dependent on the subjective judgment of the designer, which is prone to human errors and cannot adapt to the needs of large-scale or complex projects. Summary of the Invention

[0005] In response to at least one defect or improvement need in the prior art, the present invention provides a method, device, equipment and storage medium for calculating the volume of a mattress layer, which are used to solve the problem that the method for calculating the volume of a mattress layer in the prior art relies on manual labor, rule restrictions and lacks automation capabilities, resulting in low efficiency, poor accuracy and insufficient adaptability, and cannot meet the actual needs of mattress volume calculation and engineering quantity statistics in complex projects.

[0006] To achieve the above object, according to a first aspect of the present invention, a method for calculating the volume of a mattress layer is provided, comprising:

[0007] The clustering algorithm is used to cluster the initial point set of the pile center points of the composite foundation to obtain several cluster sets of pile center points.

[0008] The rolling ball algorithm is applied to the clustering set of pile center points to search for the outer contour point set of each pile foundation area;

[0009] Connect the outer contour point sets of each pile foundation area in sequence, and expand the preset size to calculate the area covered by each cushion layer;

[0010] The volume of each mattress layer region is calculated according to the area of ​​the mattress layer coverage and the corresponding mattress layer thickness, and the total volume of the mattress layer is obtained by accumulating them.

[0011] In a possible implementation, a clustering algorithm is used to cluster the initial point set of pile center points of the composite foundation to obtain a plurality of cluster sets of pile center points, which also includes:

[0012] Initializing the pile center points of the composite foundation, and determining an initial point set of the pile center points from the initialized pile center points of the composite foundation using preset parameters;

[0013] Traverse the pile center points in the pile center point initial point set, and cluster them based on preset parameters to obtain the initial cluster point set;

[0014] Traverse the pile center points in the initial cluster point set, and cluster them based on preset parameters to obtain a pile center point cluster set.

[0015] In one possible implementation, the preset parameters include the number of clusters and the cluster radius; traversing the pile center points in the pile center point initial point set, clustering based on the preset parameters to obtain an initial cluster point set, further comprising:

[0016] Randomly select an unvisited point object from the pile center initial point set, and determine a first associated point set based on the distance between the point object and the pile center point in the pile center initial point set and the cluster radius;

[0017] If the number of the first associated point set is not greater than the number of clusters, the point object is set as a noise point;

[0018] If the number of the first associated point set is greater than the number of clusters, the first associated point set is the initial cluster point set, and the corresponding first associated point set is added to the pile center point cluster set.

[0019] In a possible implementation, traversing the pile center points in the initial cluster point set and clustering based on preset parameters to obtain a pile center point cluster set further includes:

[0020] Traverse all the pile center points in the initial cluster point set, change the status of unvisited points to visited, and determine the second associated point set corresponding to each pile center point according to preset parameters;

[0021] If the number of the second associated point set is greater than the number of clusters, all pile center points in the second associated point set that are not included in the cluster set are added to the pile center point cluster set;

[0022] Traverse the pile center points added to the cluster set, change the status of unvisited points to visited, and determine the third associated point set corresponding to each pile center point according to preset parameters;

[0023] Repeat the above process until the status of each point in each round of associated point set is changed to visited, and the pile center point cluster set is obtained;

[0024] Search for unvisited points in the initial point set and repeat the above process to obtain cluster sets of other pile center points.

[0025] In one possible implementation, a rolling ball algorithm is performed on the pile center point cluster set to search for the outer contour point set of each pile foundation area, and further includes:

[0026] Calculate the rolling ball radius and the first adjacent point set corresponding to the pile center point set in the pile center point cluster set, and sort the pile center points in the pile center point set in ascending order according to a preset rule to obtain an ascending pile center point set;

[0027] The pile center point with the smallest horizontal coordinate and the smallest vertical coordinate in the pile center ascending point set is taken as the starting point of the outer contour;

[0028] Traverse the ascending point set of the pile center, and sort the neighboring points of each pile center point according to the preset order to obtain the second neighboring point set;

[0029] The second adjacent point set is traversed, and valid contour points are screened based on the corresponding pile center point and the rolling ball radius to obtain the outer contour point set of each pile foundation area.

[0030] In a possible implementation, traversing the ascending point set of pile centers, sorting the neighboring points of each pile center point according to a preset order to obtain a second neighboring point set, further comprising:

[0031] Traverse the first adjacent point set, and form the first adjacent point direction vector with the center point of the current pile of the contour line and the adjacent point, and form the reference direction vector with the center point of the current pile of the contour line and the center point of the previous pile of the contour line;

[0032] The counterclockwise angle between the first neighboring point direction vector and the reference direction vector is used to reorder the neighboring points of the first neighboring point set in descending order to obtain a second neighboring point set.

[0033] In a possible implementation, traversing the second adjacent point set and screening valid contour points based on the corresponding pile center point and the rolling ball radius to obtain an outer contour point set of each pile foundation area further includes:

[0034] Traverse the second adjacent point set and form the second adjacent point direction vector with the current pile center point and the adjacent points;

[0035] Taking the direction vector of the second neighboring point as the chord, generate a reference circle along the counterclockwise normal direction of the direction vector of the second neighboring point according to the corresponding rolling ball radius;

[0036] If there is no other pile center point within the coverage of the reference circle, the neighboring point in the second adjacent point set is the next pile center point of the outer contour, and the next outer contour point is searched in sequence to obtain the outer contour point set of each pile foundation area.

[0037] According to a second aspect of the present invention, there is also provided a device for calculating the volume of a mattress layer, comprising:

[0038] A clustering module is configured to perform clustering processing on an initial point set of pile center points of the composite foundation using a clustering algorithm to obtain a plurality of cluster sets of pile center point sets;

[0039] A rolling ball module is configured to perform a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area;

[0040] An area calculation module is configured to sequentially connect the outer contour point sets of each pile foundation area and expand the preset size to calculate the area covered by each mattress layer;

[0041] The volume calculation module is configured to calculate the volume of each mattress layer region according to the area of ​​the mattress layer coverage region and the corresponding mattress layer thickness and accumulate the volume to obtain the total volume of the mattress layer.

[0042] According to the third aspect of the present invention, a device for calculating the volume of a mattress layer is also provided, which includes at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the computer program is executed by the processing unit, the processing unit executes the steps of any of the above-mentioned methods for calculating the volume of the mattress layer.

[0043] According to the fourth aspect of the present invention, a storage medium is also provided, which stores a computer program that can be executed by an access authentication device. When the computer program is run on the access authentication device, the access authentication device executes the steps of any of the above-mentioned methods for calculating the volume of the mattress layer.

[0044] In general, the above technical solutions conceived by the present invention can achieve the following beneficial effects compared with the prior art:

[0045] The present invention provides a method for calculating the volume of a cushion layer, which clusters the chaotic pile center points into independent areas according to spatial distribution, avoids repeated calculations of repeated or similar areas, provides a structured local point set for the rolling ball algorithm, reduces interference from invalid points, and ensures the accuracy of contour generation. The rolling ball algorithm automatically generates continuous pile foundation outer contour lines, replacing the rough boundaries drawn by traditional manual methods. For all kinds of scenarios with regular or irregular pile layouts, the boundaries can be effectively extracted without additional preprocessing. By presetting the external expansion size, it adapts to the actual requirements of various pile types for the external expansion area of ​​the cushion layer, avoids the problem of insufficient quantity statistics in actual engineering, converts the problem of statistically calculating the coverage area of ​​the cushion layer into the sum of the areas of multiple polygons, avoids the area deviation caused by missing overlapping areas or large manual statistical errors in traditional methods, and makes the calculation results more reliable. This solution realizes the automation of the entire process from data grouping to volume statistics, solves the core pain points of low efficiency, poor accuracy, and reliance on manual experience in traditional methods, and is suitable for engineering projects with complex pile foundation layouts and high precision requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0047] Figure 1 A schematic flow chart of an embodiment of a method for calculating the volume of a mattress layer provided by the present invention;

[0048] Figure 2 The present invention provides Figure 1 A flow chart of an embodiment of step S101;

[0049] Figure 3 The present invention provides Figure 2 A flow chart of an embodiment of step S202;

[0050] Figure 4 The present invention provides Figure 2 A flow chart of an embodiment of step S203;

[0051] Figure 5 The present invention provides Figure 1 A flow chart of an embodiment of step S102;

[0052] Figure 6 The present invention provides Figure 5 A flow chart of an embodiment of step S504;

[0053] Figure 7A schematic structural diagram of an embodiment of a device for calculating the volume of a mattress layer provided by the present invention;

[0054] Figure 8 A schematic diagram of the structure of a device for calculating the volume of a mattress layer provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0055] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely for the purpose of explaining the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

[0056] The terms "first," "second," "third," and the like in the specification and claims of this application and the accompanying drawings are used to distinguish between different objects, not to describe a particular order. Furthermore, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0057] The present invention provides a method, device, equipment and storage medium for calculating the volume of a mattress layer, which are respectively described below.

[0058] See also Figure 1 , Figure 1 This is a flow chart of an embodiment of a method for calculating the volume of a mattress layer provided by the present invention. In a specific embodiment of the present invention, a method for calculating the volume of a mattress layer is disclosed, comprising:

[0059] S101, clustering an initial point set of pile center points of the composite foundation using a clustering algorithm to obtain a plurality of cluster sets of pile center points;

[0060] S102, performing a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area;

[0061] S103, sequentially connecting the outer contour point sets of each pile foundation area, and expanding the preset size to calculate the area covered by each cushion layer;

[0062] S104: Calculate the volume of each mattress layer region according to the area of ​​the mattress layer coverage region and the corresponding mattress layer thickness, and add them up to obtain the total volume of the mattress layer.

[0063] In the above embodiment, the coordinate data of the pile center point is imported, a structured feature vector is generated for each pile point, and initialization processing is performed. The point object P i Initialize the data structure to P i {int X, int Y, bool visit = false; bool C = 0; bool noise = false}. Where X, Y identify the x and y coordinates of the pile center, visit is the label of whether it has been visited, C is the cluster set number, and noise indicates whether the point can form a cluster. It should be noted that the coordinate data of the pile center point can be the default coordinate data in the CAD software. In this solution, the coordinate data can facilitate the description of subsequent processing, and the specific reference used to establish the coordinates does not affect the results of this solution. Therefore, there is no separate restriction on how to establish the reference of the coordinate system.

[0064] Based on the obtained cluster set of pile center points, the rolling ball algorithm is applied to each cluster area. By simulating a sphere with a fixed radius rolling around the point set and recording all the boundary points touched by the sphere, the outer contour of each pile foundation area is determined. It is necessary to select an appropriate rolling ball radius to accurately capture the actual boundary of the pile foundation area and avoid overfitting or underfitting.

[0065] After extracting the outer contour points, these points are connected into closed polygons to represent the cushion layer coverage area of ​​each pile foundation area. Next, based on the project requirements, each polygon is expanded outward by a certain size (i.e., the expansion in the direction of the outer normal of the edge line) to form the final cushion layer coverage area, and the area of ​​each area is calculated.

[0066] The volume of each area is calculated by multiplying the area covered by each cushion layer by the preset cushion layer thickness (usually uniform, but adjustable based on actual needs). Adding up the volumes of each area gives the total volume of the cushion layer in the entire composite foundation. This not only takes into account the horizontal coverage of the cushion layer, but also accurately reflects its vertical dimensions, ensuring the accuracy of the volume calculation.

[0067] Compared with the prior art, the present embodiment provides a method for calculating the volume of a cushion layer, which clusters the chaotic pile center points into independent areas according to their spatial distribution, avoiding repeated calculations of repeated or similar areas, providing a structured local point set for the rolling ball algorithm, reducing interference from invalid points, and ensuring the accuracy of contour generation. The rolling ball algorithm automatically generates a continuous outer contour line of the pile foundation, replacing the rough boundaries drawn by traditional manual methods. It can effectively extract boundaries for all types of pile layouts, whether regular or irregular, without the need for additional preprocessing. By presetting the external expansion size, it adapts to the actual requirements of various pile types for the external expansion area of ​​the cushion layer, avoiding the problem of insufficient quantity statistics in actual projects, and converting the problem of calculating the coverage area of ​​the cushion layer into the sum of the areas of multiple polygons, avoiding the area deviation caused by missing overlapping areas or large manual statistical errors in traditional methods, and making the calculation results more reliable. This solution realizes the automation of the entire process from data grouping to volume statistics, solving the core pain points of low efficiency, poor accuracy, and reliance on manual experience in traditional methods. It is suitable for engineering projects with complex pile foundation layouts and high precision requirements.

[0068] See also Figure 2 , Figure 2 The present invention provides Figure 1 FIG. 1 is a flow chart of an embodiment of step S101 in FIG. 1 . In some embodiments of the present invention, clustering is performed on an initial point set of pile center points of a composite foundation using a clustering algorithm to obtain a plurality of cluster sets of pile center points, further comprising:

[0069] S201, performing initialization processing on the pile center points of the composite foundation, and determining a pile center point initial point set from the pile center points of the initialized composite foundation using preset parameters;

[0070] S202, traversing the pile center points in the pile center point initial point set, clustering based on preset parameters to obtain an initial cluster point set;

[0071] S203: Traverse the pile center points in the initial cluster point set, and cluster them based on preset parameters to obtain a pile center point cluster set.

[0072] In the above embodiment, according to the preset parameters (number of clusters P min and cluster radius e), filter out the pile center points that meet the conditions from the original data set to form the pile center point initial point set. With the pile center point as the center of the circle, the pile center points within the radius of e are considered as associated points. If the number of associated point sets of a point is greater than P min When , the associated points can form a cluster set, thereby removing abnormal points or too sparse points, ensuring the effectiveness and accuracy of subsequent clustering operations.

[0073] Visit any unvisited pile center point in the initial point set of pile center points, use this point as a sample point, and calculate the number of clusters P. minCluster the other points with the clustering radius e, and classify the points that meet the clustering conditions into one category to obtain the initial cluster point set.

[0074] Visit the pile center points in each initial cluster one by one, and based on the preliminary clustering, according to the number of clusters P min The cluster set is expanded with the cluster radius e, and the initial clusters are further merged until a complete set of pile center clusters that meets the requirements is obtained.

[0075] After obtaining the pile center point cluster set, it is necessary to check whether there are any unvisited points in the pile center point initial point set. If there are unvisited pile center points, it is necessary to re-search the cluster set until all points are visited. It is also necessary to verify and optimize the results, including checking the rationality of the clustering results (such as whether there are isolated points and whether the cluster shape is regular), and adjusting the clustering parameters or strategies according to the actual situation to obtain more accurate clustering results.

[0076] See also Figure 3 , Figure 3 The present invention provides Figure 2 FIG. 1 is a flow chart of an embodiment of step S202. In some embodiments of the present invention, the preset parameters include the number of clusters and the cluster radius; traversing the pile center points in the pile center point initial point set and clustering based on the preset parameters to obtain an initial cluster point set further includes:

[0077] S301, randomly selecting an unvisited point object from the pile center point initial point set, and determining a first associated point set based on the distance between the point object and the unvisited pile center points in the pile center point initial point set and the cluster radius;

[0078] S302: If the number of the first associated point set is not greater than the number of clusters, the point object is set as a noise point;

[0079] S303: If the number of the first associated point set is greater than the number of clusters, the first associated point set is the initial cluster point set, and the corresponding first associated point set is added to the pile center point cluster set.

[0080] In the above embodiment, traversing the pile center points in the pile center point initial point set requires processing each unvisited pile center point. This embodiment is described with one processing process.

[0081] Randomly select a pile center point object P from the pile center point initial point set i As the center point of the current processing, calculate the distance between the point object and all unvisited pile center points in the pile center point initial point set, and determine the point set with a distance less than or equal to the cluster radius as the first associated point set Ω of the point object. (Pi) , is to find the point that is close to the current point object in space.

[0082] Check the first associated point set Ω (Pi) Is the number of clusters not greater than the preset number of clusters P? min If the number of the first associated point set is not greater than the number of clusters, it means that there are not enough points around the current point object to form a valid cluster, so it is marked as a noise point and excluded from subsequent processing (that is, the structural features of the point are set to visit = ture, noise = ture).

[0083] If the number of the first associated point set is greater than the preset number of clusters, it means that there are enough points around the current point object to form a valid cluster. At this time, the first associated point set is regarded as an initial cluster point set Ω n1 . Add the newly formed initial cluster point set to the pile center point cluster set Ω n This set will be used to store the valid clustering set.

[0084] Steps S301 to S303 form the current cluster set, and steps S401 to S405 are required to merge the associated point sets into the current cluster set to avoid missing the pile center points that meet the requirements.

[0085] Repeat the above steps S301 to S303 until all points in the pile center initial point set are visited and processed.

[0086] See also Figure 4 , Figure 4 The present invention provides Figure 2 In a flow chart of an embodiment of step S203, in some embodiments of the present invention, traversing the pile center points in the initial cluster point set and clustering based on preset parameters to obtain a pile center point cluster set further includes:

[0087] S401, traversing all pile center points in the initial cluster point set, changing the status of unvisited points to visited points, and determining a second associated point set corresponding to each pile center point according to preset parameters;

[0088] S402: If the number of the second associated point set is greater than the number of clusters, all pile center points in the second associated point set that are not included in the cluster set are added to the pile center point cluster set;

[0089] S403, traversing the pile center points added to the cluster set, changing the status of unvisited points to visited, and determining the third associated point set corresponding to each pile center point according to preset parameters;

[0090] S404, repeat the above process until the status of each point in each round of associated point set is changed to visited, and a cluster set of pile center points is obtained;

[0091] S405: Search for unvisited points in the initial point set, repeat the above process, and obtain cluster sets of other pile center points.

[0092] In the above embodiment, the initial cluster point set Ω is visited one by one. n1 Each unvisited pile center point P in j , modify its attribute vist = ture. At the same time, according to the number of clusters P min and cluster radius e, will be compared with the current pile center point P j The point whose distance is less than or equal to the cluster radius e is determined as the pile center point P j The second associated point set Ω (Pj) , it is necessary to further investigate whether the cluster point set can be incorporated into this cluster set.

[0093] If the second associated point set Ω (Pj) If the number of is not greater than the number of clusters, the second associated point set will not be processed.

[0094] If the second associated point set Ω (Pj) If the number of points is greater than the preset number of clusters, it means that there are enough points around the current pile center point to form a cluster point set that can be merged and expanded to form the current cluster set. At this time, all pile center points in the second associated point set that are not included in the cluster set are added to the current pile center point cluster set, and closely related points are grouped together. At the same time, these points are retained as seed points for the subsequent formation of new clusters.

[0095] Similarly, when traversing unvisited points in the seed points of the new cluster, the state of the point is changed to a visited point, and the third associated point set corresponding to each pile center point is determined according to the preset parameters.

[0096] Repeat the above steps S401 to S405 until the status of each point in each round of associated point set is changed to visited, that is, the current pile center point cluster set is obtained.

[0097] Search for unvisited points in the initial point set and repeat the above process to obtain cluster sets of other pile center points.

[0098] See also Figure 5 , Figure 5 The present invention provides Figure 1 FIG. 1 is a flow chart of an embodiment of step S102 in FIG. 1 , wherein in some embodiments of the present invention, performing a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area further includes:

[0099] S501, calculating the rolling ball radius and the first adjacent point set corresponding to the pile center point set in the pile center point set cluster set, and sorting the pile center points in the pile center point set in ascending order according to a preset rule to obtain an ascending pile center point set;

[0100] S502, taking the pile center point with the smallest horizontal coordinate and the smallest vertical coordinate in the pile center ascending point set as the starting point of the outer contour;

[0101] S503, traversing the pile center ascending point set, sorting the neighboring points of each pile center point according to a preset order to obtain a second neighboring point set;

[0102] S504 , traversing the second adjacent point set, and filtering valid contour points based on the corresponding pile center point and the rolling ball radius to obtain an outer contour point set of each pile foundation area.

[0103] In the above embodiment, any cluster set Ω i , traverse each point, obtain the nearest neighbor distance {R} of each point, and the rolling ball radius r=max{R}. The rolling ball radius will be used to limit the search range of the contour boundary points. For each pile center point in the pile center point cluster set, the pile center point q j The center of the pile within the radius of 2r is the center of the circle as q j The first adjacent point set Q j .

[0104] The pile center points of the pile center points are concentrated according to the preset rules (as a preferred embodiment, the present invention will Ω i Sort in ascending order according to the x and y coordinates of the pile center points to obtain the pile center ascending point set Ω i The purpose of sorting is to traverse and process the point set in an orderly manner. In the ascending pile center point set, find the pile center point q1 with the smallest horizontal and vertical coordinates, and use it as the starting point for the outer contour search to search for the next contour line pile center point.

[0105] In order to orderly access and process the adjacent points of each pile center point, thereby constructing a continuous outer contour, the pile center ascending point set is traversed. For each pile center point, the adjacent points are sorted according to its first adjacent point set and a preset order (such as clockwise or counterclockwise) to obtain the second adjacent point set.

[0106] Traverse each point in the second set of adjacent points and filter them based on the corresponding pile center point and the rolling ball radius. Specifically, determine, in sorted order, whether the adjacent points meet the criteria for being an outer contour point (e.g., whether there are other points within the rolling ball with a distance equal to the chord length from the current pile center point). Any points that meet the criteria are added to the outer contour point set for the current pile foundation area.

[0107] In the process of screening valid contour points, special attention should be paid to handling boundary conditions, such as the connection between the starting point and the end point, to ensure the closedness of the outer contour.

[0108] After obtaining the outer contour point set of each pile foundation area, verification is performed to ensure the accuracy and rationality of the outer contour, such as checking the continuity, closure and smoothness of the outer contour. According to the verification results, necessary optimization processing is performed on the outer contour, such as smoothing the contour line and removing abnormal points.

[0109] In some embodiments of the present invention, traversing the pile center ascending point set and sorting the neighboring points of each pile center point according to a preset order to obtain a second neighboring point set further includes:

[0110] Traverse the first adjacent point set, and use the current pile center point and the adjacent point to form the first adjacent point direction vector. When the center point of the previous pile of the contour line and the center point of the previous pile of the contour line form the reference direction vector;

[0111] The counterclockwise angle between the first neighboring point direction vector and the reference direction vector is used to reorder the neighboring points of the first neighboring point set in descending order to obtain a second neighboring point set.

[0112] In the above embodiment, after determining the starting point of the outer contour, the contour points can be determined one by one, thereby gradually obtaining the contour line. For the current pile center point q of the contour line, i Each neighboring point q'∈Q in the first neighboring point set j , the vector q formed by the current pile center point and the neighboring point i q' is called the first neighbor direction vector.

[0113] The current pile center point q of the contour line i and the center point q of the previous pile of the contour line i-1 The vector formed is called the reference direction vector q i q i-1 If the current pile center point is the starting point (ie, there is no previous pile center point), the (1, 0) vector can be selected as the reference direction vector.

[0114] For each first neighbor direction vector q i q', calculate its difference from the reference direction vector q i q i-1 The counterclockwise angle of the first adjacent point is the angle between the first and second adjacent points. The size of the angle represents the positional relationship of the adjacent point relative to the reference direction. According to the size of the angle, the adjacent points in the first adjacent point set are sorted in descending order of the counterclockwise angle. In this way, the points in the sorted adjacent point set (i.e., the second adjacent point set) will be arranged in a relatively fixed direction (such as counterclockwise), and the sorted adjacent point set will be used as the second adjacent point set Q of the current pile center point. j '.

[0115] See also Figure 6 , Figure 6 The present invention provides Figure 5FIG. 5 is a flow chart of an embodiment of step S504. In some embodiments of the present invention, traversing the second adjacent point set and filtering valid contour points based on the corresponding pile center point and the rolling ball radius to obtain an outer contour point set for each pile foundation area further includes:

[0116] S601, traverse the second adjacent point set, and form a second adjacent point direction vector with the current pile center point and the adjacent points;

[0117] S602: Using the second neighboring point direction vector as a chord, generate a reference circle along the counterclockwise normal direction of the second neighboring point direction vector according to the corresponding rolling ball radius;

[0118] S603: If there are no other pile center points within the coverage of the reference circle, the adjacent points in the second adjacent point set are outer contour points, and an outer contour point set of each pile foundation area is obtained.

[0119] In the above embodiment, the current pile center point q of the contour line i The second adjacent point set Q j ', examine q'∈Q in turn j 'Whether it can be used as the next contour point. Calculate the vector formed by the current center point of the contour line and the adjacent point, which is called the second adjacent point direction vector q i q'.

[0120] The direction vector q of the second neighbor point i q' is the chord, according to the radius of the rolling ball r, along the direction of the second neighboring point vector q i A reference circle is generated in the counterclockwise normal direction of q' (or other directions according to specific needs) to determine whether the adjacent points are located on a valid outer contour.

[0121] Check whether the reference circle coverage contains other pile center points except the current pile center point. If there are no other pile center points within the reference circle coverage, it means that the current neighboring point is located in a relatively open area and may be a valid outer contour point. It is considered as a valid outer contour next pile center point and added to the outer contour point set of the current pile base area; if there are other pile center points within the reference circle coverage, the point q' cannot be used as an outer contour point, and the point set Q is further examined. i 'Next point in the middle until the next center point of the outer contour line is found.

[0122] If the center point of the outer contour pile is already in the contour line point set, the search ends and the obtained Ω i Outer contour point set Γ. Repeat the above steps until all the pile center point cluster sets are traversed to obtain the outer contour point set of each pile foundation area.

[0123] In order to better implement the method for calculating the volume of the mattress layer in the embodiment of the present invention, based on the method for calculating the volume of the mattress layer, please refer to Figure 7 , Figure 7 This is a schematic structural diagram of an embodiment of a device for calculating the volume of a mattress layer provided by the present invention. The embodiment of the present invention provides a device 700 for calculating the volume of a mattress layer, comprising:

[0124] A clustering module 710 is configured to perform clustering processing on the initial point set of pile center points of the composite foundation using a clustering algorithm to obtain a plurality of cluster sets of pile center point sets;

[0125] A rolling ball module 720 is configured to perform a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area;

[0126] An area calculation module 730 is configured to sequentially connect the outer contour point sets of each pile foundation area and expand the area by a preset size to calculate the area covered by each mattress layer;

[0127] The volume calculation module 740 is configured to calculate the volume of each mattress region according to the area of ​​the mattress coverage region and the corresponding mattress thickness and accumulate the volume to obtain the total volume of the mattress.

[0128] It should be noted here that the device 700 provided in the above embodiment can implement the technical solutions described in the above method embodiments. The specific implementation principles of the above modules or units can be found in the corresponding contents in the above method embodiments, which will not be repeated here.

[0129] See also Figure 8 , Figure 8 This is a schematic diagram of a mattress volume calculation device according to an embodiment of the present invention. Based on the aforementioned mattress volume calculation method, the present invention also provides a mattress volume calculation device. The mattress volume calculation device can be a computing device such as a mobile terminal, desktop computer, notebook, PDA, or server. The mattress volume calculation device 800 includes a processor 810, a memory 820, and a display 830. Figure 8 Only some of the components of the mattress volume calculation device are shown, but it should be understood that it is not required to implement all of the shown components, and more or fewer components may be implemented instead.

[0130] In some embodiments, the memory 820 may be an internal storage unit of the cushion volume calculation device 800, such as the hard drive or memory of the cushion volume calculation device 800. In other embodiments, the memory 820 may be an external storage device of the cushion volume calculation device 800, such as a plug-in hard drive, a Smart Media Card (SMC), a Secure Digital (SD) card, a flash memory card, etc. equipped on the cushion volume calculation device 800. Furthermore, the memory 820 may include both the internal storage unit of the cushion volume calculation device 800 and an external storage device. The memory 820 is used to store application software installed in the cushion volume calculation device 800 and various data, such as the program code of the cushion volume calculation device 800. The memory 820 may also be used to temporarily store data that has been output or is about to be output. In one embodiment, the memory 820 stores a mattress volume calculation program 840 , which can be executed by the processor 810 , thereby implementing the mattress volume calculation method of each embodiment of the present application.

[0131] In some embodiments, the processor 810 may be a central processing unit (CPU), a microprocessor, or other data processing chip, configured to execute program codes or process data stored in the memory 820, such as executing a method for calculating the volume of a mattress layer.

[0132] In some embodiments, display 830 can be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, or an OLED (Organic Light-Emitting Diode) touchscreen. Display 830 is used to display information on the mattress volume calculation device 800 and to display a visual user interface. Components 810-830 of the mattress volume calculation device 800 communicate with each other via a system bus.

[0133] In one embodiment, when the processor 810 executes the mattress volume calculation program 840 in the memory 820 , the steps in the above mattress volume calculation method are implemented.

[0134] This embodiment further provides a computer-readable storage medium storing a mattress volume calculation program. When the mattress volume calculation program is executed by a processor, the following steps are implemented:

[0135] The clustering algorithm is used to cluster the initial point set of the pile center points of the composite foundation to obtain several cluster sets of pile center points.

[0136] The rolling ball algorithm is applied to the clustering set of pile center points to search for the outer contour point set of each pile foundation area;

[0137] Connect the outer contour point sets of each pile foundation area in sequence, and expand the preset size to calculate the area covered by each cushion layer;

[0138] The volume of each mattress layer region is calculated according to the area of ​​the mattress layer coverage and the corresponding mattress layer thickness, and the total volume of the mattress layer is obtained by accumulating them.

[0139] In summary, the present invention provides a method for calculating the volume of a cushion layer, which clusters the chaotic pile center points into independent areas according to spatial distribution, avoids repeated calculations of repeated or similar areas, provides a structured local point set for the rolling ball algorithm, reduces interference from invalid points, and ensures the accuracy of contour generation. The rolling ball algorithm automatically generates continuous pile foundation outer contour lines, replacing the rough boundaries drawn by traditional manual methods. For all kinds of scenes with regular or irregular pile layouts, the boundaries can be effectively extracted without additional preprocessing. By presetting the external expansion size, it adapts to the actual requirements of various pile types for the external expansion area of ​​the cushion layer, avoids the problem of insufficient quantity statistics in actual engineering, and converts the problem of statistically calculating the coverage area of ​​the cushion layer into the sum of the areas of multiple polygons, avoiding the area deviation caused by missing overlapping areas or large manual statistical errors in traditional methods, and the calculation results are more reliable. This solution realizes the automation of the entire process from data grouping to volume statistics, solves the core pain points of low efficiency, poor accuracy, and reliance on manual experience in traditional methods, and is suitable for engineering projects with complex pile foundation layouts and high precision requirements.

[0140] The present application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above method. The computer-readable storage medium may include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a microdrive, a magneto-optical disk, a ROM, a RAM, an EPROM, an EEPROM, a DRAM, a VRAM, a flash memory device, a magnetic card or an optical card, a nanosystem (including a molecular memory IC), or any type of medium or device suitable for storing instructions and / or data.

[0141] It should be noted that for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0142] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0143] In the several embodiments provided in this application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some service interface, and the indirect coupling or communication connection of the device or unit can be electrical or other forms.

[0144] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0145] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0146] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory, including a number of instructions for enabling a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0147] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable memory, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0148] The above is only an exemplary embodiment of the present disclosure and cannot be used to limit the scope of the present disclosure. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure herein, those skilled in the art will easily think of the implementation scheme of the present disclosure. This application is intended to cover any variation, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary technical means in the art that are not recorded in the present disclosure. The description and examples are to be regarded as exemplary only, and the scope and spirit of the present disclosure are defined by the claims.

[0149] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0150] It will be easily understood by those skilled in the art that the above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for calculating the volume of a mattress layer, characterized in that: include: The clustering algorithm is used to cluster the initial point set of the pile center points of the composite foundation to obtain several cluster sets of pile center points. Performing a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area; Connect the outer contour point sets of each pile foundation area in sequence, and expand the preset size to calculate the area covered by each cushion layer; The volume of each mattress layer region is calculated according to the area of ​​the mattress layer coverage region and the corresponding mattress layer thickness, and the total volume of the mattress layer is obtained by accumulating them.

2. The method for calculating the volume of a mattress layer according to claim 1, wherein: The method of clustering the initial point set of pile center points of the composite foundation using a clustering algorithm to obtain a plurality of pile center point cluster sets also includes: Initializing the pile center points of the composite foundation, and determining the pile center point initial point set from the initialized pile center points of the composite foundation using preset parameters; Traversing the pile center points in the pile center point initial point set, and clustering based on the preset parameters to obtain an initial cluster point set; Traversing the pile center points in the initial cluster point set, clustering is performed based on the preset parameters to obtain the pile center point cluster set.

3. The method for calculating the volume of a mattress layer according to claim 2, wherein: The preset parameters include the number of clusters and the cluster radius; the traversing the pile center points in the pile center point initial point set, clustering based on the preset parameters to obtain an initial cluster point set, further comprising: Randomly selecting an unvisited point object from the pile center point initial point set, and determining a first associated point set according to the distance between the point object and the pile center point in the pile center point initial point set and the cluster radius; If the number of the first associated point set is not greater than the number of clusters, setting the point object as a noise point; If the number of the first associated point sets is greater than the number of clusters, the first associated point sets are used as the initial cluster point sets, and the corresponding first associated point sets are added to the pile center point cluster set.

4. The method for calculating the volume of a mattress layer according to claim 3, wherein: The traversing of the pile center points in the initial cluster point set and clustering based on the preset parameters to obtain the pile center point cluster set further includes: Traversing all pile center points in the initial cluster point set, changing the status of unvisited points to visited points, and determining a second associated point set corresponding to each pile center point according to the preset parameters; If the number of the second associated point set is greater than the number of clusters, all pile center points in the second associated point set that are not included in the cluster set are added to the pile center point cluster set; Traversing the pile center points added to the cluster set, changing the status of unvisited points to visited, and determining a third associated point set corresponding to each pile center point according to the preset parameters; Repeat the above process until the status of each point in each round of associated point set is changed to visited, and the pile center point cluster set is obtained; Search for unvisited points in the initial point set and repeat the above process to obtain cluster sets of other pile center points.

5. The method for calculating the volume of a mattress layer according to claim 1, wherein: The method further includes executing a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area: Calculating the rolling ball radius and the first adjacent point set corresponding to the pile center point set in the pile center point set cluster set, and sorting the pile center points in the pile center point set in ascending order according to a preset rule to obtain an ascending pile center point set; The pile center point with the smallest horizontal coordinate and the smallest vertical coordinate in the pile center ascending point set is used as the starting point of the outer contour; Traversing the pile center ascending point set, sorting the neighboring points of each pile center point according to a preset order to obtain a second neighboring point set; The second adjacent point set is traversed, and valid contour points are screened based on the corresponding pile center point and the rolling ball radius to obtain an outer contour point set of each pile foundation area.

6. The method for calculating the volume of a mattress layer according to claim 5, wherein: The traversing the pile center ascending point set and sorting the neighboring points of each pile center point according to a preset order to obtain a second neighboring point set further includes: Traversing the first adjacent point set, the center point of the current pile of the contour line and the adjacent point form a first adjacent point direction vector, and the center point of the current pile of the contour line and the center point of the previous pile of the contour line form a reference direction vector; The counterclockwise angle between the first neighboring point direction vector and the reference direction vector is used to reorder the neighboring points of the first neighboring point set in descending order to obtain a second neighboring point set.

7. The method for calculating the volume of a mattress layer according to claim 5, wherein: The traversing the second adjacent point set and screening valid contour points based on the corresponding pile center point and the rolling ball radius to obtain an outer contour point set of each pile foundation area further includes: Traversing the second set of adjacent points, forming a second adjacent point direction vector with the current pile center point and adjacent points; using the second adjacent point direction vector as a chord, and generating a reference circle along the counterclockwise normal direction of the second adjacent point direction vector according to the corresponding rolling ball radius; If there is no other pile center point within the coverage of the reference circle, the neighboring point in the second adjacent point set is the next pile center point of the outer contour, and the next outer contour point is searched in sequence to obtain the outer contour point set of each pile foundation area.

8. A device for calculating the volume of a mattress layer, characterized in that: include: A clustering module is configured to perform clustering processing on an initial point set of pile center points of the composite foundation using a clustering algorithm to obtain a plurality of cluster sets of pile center point sets; A rolling ball module is configured to perform a rolling ball algorithm on the pile center point cluster set to search for an outer contour point set of each pile foundation area; An area calculation module is configured to sequentially connect the outer contour point sets of each pile foundation area and expand the preset size to calculate the area covered by each mattress layer; The volume calculation module is configured to calculate the volume of each mattress layer region according to the area of ​​the mattress layer coverage region and the corresponding mattress layer thickness and accumulate the volumes to obtain the total volume of the mattress layer.

9. A device for calculating the volume of a mattress layer, characterized in that: The method comprises at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the computer program is executed by the processing unit, the processing unit executes the steps of the method for calculating the volume of the mattress layer according to any one of claims 1 to 7.

10. A storage medium, characterized in that: It stores a computer program that can be executed by an access authentication device. When the computer program runs on the access authentication device, the access authentication device executes the steps of the method for calculating the volume of the mattress layer according to any one of claims 1 to 7.

Images