Search method, system, device and storage medium for bolt-related nodes

Abstract

The application discloses a search method for bolt-associated nodes, which comprises the following steps: S1, acquiring unit nodes of a whole vehicle simulation model and geometric information of bolts to be processed; S2, sorting the unit nodes of the whole vehicle simulation model according to X-direction coordinate values to obtain a first array, determining a first boundary in the first array, and taking the unit nodes within the first boundary as a first reconstruction array; S3, sorting the unit nodes in the first reconstruction array according to Y-direction coordinate values of the unit nodes to obtain a second array, determining a second boundary in the second array, and taking the unit nodes within the second boundary as a second reconstruction array; S4, sorting the unit nodes in the second reconstruction array according to Z-direction coordinate values of the unit nodes to obtain a third array, determining a third boundary in the third array, and taking the unit nodes within the third boundary as a third reconstruction array; and S5, traversing and solving the Euclidean distances between a search center point and each unit node in the third reconstruction array to realize the association between the bolts and the nodes.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of bolt modeling, and particularly relates to a search method, system, device and storage medium for bolt associated nodes. BACKGROUND

[0002] In a whole vehicle numerical model, there are a large amount of bolt data, and the bolt data is generated into a plurality of small lattices according to certain rules, as shown in FIG. 1, each lattice is a unit, and the connection points between the units are nodes. In order to perform simulation analysis, it is necessary to convert the geometric connection data into simulation unit data, and the generated bolt needs to be associated with the unit nodes around the bolt. At present, the search method is mainly through brute force search to traverse, but for a model like a whole vehicle with a number of unit nodes of millions or tens of millions, this method makes the search efficiency of the bolt associated nodes relatively low. Figure 1 SUMMARY In view of the problem of low search efficiency of the bolt associated nodes in the prior art, the present application provides a search method, system, device and storage medium for bolt associated nodes, which quickly determines a first range by searching and boundary determination in X, Y and Z directions respectively, and then determines the final associated nodes through threshold judgment, thereby improving the search efficiency.

[0003] In order to achieve the above-mentioned purpose, the present application provides the following technical solutions:

[0004] A search method for bolt associated nodes, specifically comprising the following steps:

[0005] S1: obtaining unit nodes of a whole vehicle simulation model and geometric information of a bolt to be processed;

[0006] S2: sorting the unit nodes of the whole vehicle simulation model according to the X-direction coordinate values of the unit nodes to obtain a first array, setting the center point of the bolt to be processed as a search center point, determining a first boundary in the first array, and taking the unit nodes within the first boundary as a first reconstruction array;

[0007] S3: sorting the unit nodes in the first reconstruction array according to the Y-direction coordinate values of the unit nodes to obtain a second array, determining a second boundary in the second array, and taking the unit nodes within the second boundary as a second reconstruction array;

[0008] S4: sorting the unit nodes in the second reconstruction array according to the Z-direction coordinate values of the unit nodes to obtain a third array, determining a third boundary in the third array, and taking the unit nodes within the third boundary as a third reconstruction array;

[0009] S5: traversing to solve the Euclidean distance 1 between the search center point and each unit node in the third reconstruction array, and taking the unit nodes with a distance less than a search radius R as the final associated nodes of the bolt to be processed.

[0010] S5: traversing to solve the Euclidean distance 1 between the search center point and each unit node in the third reconstruction array, and taking the unit nodes with a distance less than a search radius R as the final associated nodes of the bolt to be processed.max If l>R, then remove the corresponding element node, if l≤R, then keep the corresponding element node, thus obtaining the first node cluster, and realizing the association of the bolt and the node. max max

[0011] Preferably, in S1, the geometric information includes the bolt radius, the bolt length, and the bolt center point.

[0012] Preferably, in S2, the determination method of the first boundary is as follows: taking the coordinate value of the search center point in the X direction as the median center1, taking center1-R max as the first lower boundary, taking center1+R max as the first upper boundary, and adding the element nodes between the first lower boundary and the first upper boundary to the first reconstruction array.

[0013] Preferably, in S3, the determination method of the second boundary is as follows: taking the coordinate value of the search center point in the Y direction as the median center2, taking center2-R max as the second lower boundary, taking center2+R max as the second upper boundary, and adding the element nodes between the second lower boundary and the second upper boundary to the second reconstruction array.

[0014] Preferably, in S4, the determination method of the third boundary is as follows: taking the coordinate value of the search center point in the Z direction as the median center3, taking center3-R max as the third lower boundary, taking center3+R max as the third upper boundary, and adding the element nodes between the third lower boundary and the third upper boundary to the third reconstruction array.

[0015] Preferably, the search radius R max =R+ERROR or R max =L+ERROR, R represents the maximum radius from the nut center to the nut periphery, L represents the maximum distance from the search center point to the nut periphery, and ERROR represents a preset gap value.

[0016] Preferably, S6 is further included:

[0017] If the bolt to be processed is a cylinder, the height h and the bottom radius r of the cylinder are obtained, and the axis vector of the cylinder is unitized and set as The vector formed between the search center point and each element node in the third reconstruction array is obtained and set as and the unitization is set as

[0018] is obtained according to formula (1) ​​

[0019]

[0020] In formula (1), d1 represents the vertical length of a unit node to an axis; d2 represents the projection length of the line connecting the search center point and the unit node on the axis; represents the module of the vector formed between the search center point O and the unit node in the reconstruction array ; represents the unitization of the axis vector of the cylinder; represents the unitization of .

[0021] If d1>r and d2>h, the corresponding unit node is removed from the reconstruction array, that is, the unit node with d1≤r or d2≤h is retained, so as to obtain the second node cluster.

[0022] In summary, compared with the prior art, the present application has at least the following beneficial effects:

[0023] The present application sequentially performs multi-directional sorting search and boundary determination in X, Y and Z directions, so as to quickly determine the first range (i.e. the third reconstruction array), and then determine the final associated node (the first node cluster and the second node cluster) through threshold judgment, so as to gradually and quickly reduce the search range and achieve the purpose of fast search, improve the search efficiency, realize the fast generation of bolt weld points and the like in the simulation pre-processing stage, and the present application also provides a basic support for model automatic construction. BRIEF DESCRIPTION OF DRAWINGS

[0024] Figure 1 FIG. 1 is a schematic diagram of a unit node model according to an exemplary embodiment of the present application.

[0025] Figure 2 FIG. 2 is a schematic diagram of a search method for bolt associated nodes according to an exemplary embodiment of the present application.

[0026] Figure 3 FIG. 3 is a schematic diagram of a search system for bolt associated nodes according to an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0027] The present application will be further described in detail below in combination with embodiments and specific implementation manners. However, this should not be understood as limiting the scope of the above-mentioned subject matter of the present application to the following embodiments, and any technology realized based on the content of the present application is within the scope of the present application.

[0028] In the description of the present application, it should be understood that the terms "longitudinal", "transverse", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer" and the like indicate the orientation or positional relationship shown in the drawings, which are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as a limitation of the present application.

[0029] As shown in Figure 2 , the present application provides a search method for bolt-related nodes, which specifically comprises the following steps:

[0030] S1: Obtain the unit node of the whole vehicle simulation model and the geometric information of the bolt to be processed.

[0031] In this embodiment, the unit node model of the whole vehicle has been constructed by software, as shown in Figure 1 , a component generates a small grid as shown in the figure through certain rules, and each grid is a unit, and the connection point between units is a node.

[0032] In this embodiment, the geometric information includes bolt radius, bolt length, and screw center point 0, and the whole vehicle simulation model is obtained according to the geometric information and through CAE modeling.

[0033] S2: Sort the unit nodes of the whole vehicle simulation model in the X direction coordinate value of the unit node to obtain a first array, set the screw center point of the bolt to be processed as a search center point, determine a first boundary in the first array, and take the unit nodes within the first boundary as a first reconstruction array.

[0034] S3: Sort the unit nodes in the first reconstruction array in the Y direction coordinate value of the unit node to obtain a second array, set the screw center point 0 of the bolt to be processed as a search center point, determine a second boundary in the second array, and take the unit nodes within the second boundary as a second reconstruction array.

[0035] S4: Sort the unit nodes in the second reconstruction array in the Z direction coordinate value of the unit node to obtain a third array, set the screw center point 0 of the bolt to be processed as a search center point, determine a third boundary in the third array, and take the unit nodes within the third boundary as a third reconstruction array.

[0036] In this embodiment, the coordinates of each unit node can be directly obtained on the unit node model of the whole vehicle, so sorting can be directly performed. For example, sorting the unit nodes in the X direction to obtain a first array, sorting the unit nodes in the Y direction to obtain a second array, and sorting the unit nodes in the Z direction to obtain a third array.

[0037] In this embodiment, the effective screw is defined as the screw between the nut and the screw thread, and its length is defined as the effective length of the screw. The center point of the effective screw is the search center point O. The maximum radius from the center of the nut to the periphery of the nut is R, and the maximum distance from the search center point O to the periphery of the nut (i.e., the edge point of the nut) is L. Therefore, the search radius R max R is the sum of the larger of R and L and the safety boundary value ERROR. max =R+ERROR or R max =L+ERROR, where the safety boundary value ERROR is a preset gap value, which can be 0.1 times R or 1mm.

[0038] In this embodiment, the method for determining the first boundary is as follows: using the search center point's X-direction coordinate as the median center1, and center1-R... max As the first lower boundary, with center1+R max The first upper boundary is defined, and the cell nodes located between the first lower boundary and the first upper boundary are added to the first reconstruction array.

[0039] The second boundary is determined as follows: using the Y-coordinate of the search center point as the median value center2, and center2-R... max As the second lower boundary, with center2+R max The second upper boundary is defined, and the cell nodes located between the second lower boundary and the second upper boundary are added to the second reconstruction array.

[0040] The method for determining the third boundary is as follows: using the search center point's Z-direction coordinate as the median value center3, and center3-R... max As the third lower boundary, with center3+R max The third upper boundary is defined, and the cell nodes located between the third lower boundary and the third upper boundary are added to the third reconstruction array.

[0041] The present invention uses steps S1-S4 (which can be defined as a cube search method) to perform multi-directional sorting search and boundary determination in the X, Y, and Z directions respectively, thereby quickly determining the first range.

[0042] S5: Iterate through the search center point O and calculate the Euclidean distance l between each cell node in the third reconstruction array, and then compare l with the search radius R. max Comparison, if l>R max Then remove the corresponding element node if l≤R max Then the corresponding unit nodes are retained, thus obtaining the first node cluster.

[0043] In this embodiment, each unit node in the first node cluster is associated with the bolt to be processed.

[0044] S6: If the bolt to be processed is a cylinder, obtain the height h and base radius r of the cylinder, and normalize the axis vector of the cylinder to set it to... Traverse the array to obtain the vector formed between the search center point O and each cell node in the reconstructed array, and let it be... and normalize it to

[0045] According to formula (1), we can obtain

[0046]

[0047] In formula (1), d1 represents the perpendicular length of the unit node to the axis; d2 represents the projection length of the line connecting the search center point and the unit node onto the axis. This represents the vector formed between the search center point O and the cell nodes in the reconstructed array. The model; Normalization of the axis vector of a cylinder; express The unitization of .

[0048] If d1>r and d2>h, then the corresponding cell nodes are removed from the reconstruction array, that is, the cell nodes with d1≤r or d2≤h are retained, thus obtaining the second node cluster.

[0049] This invention, through steps S5-S6 (S5 can be defined as a spherical search method, and S6 can be defined as a cylindrical search method), determines the first range and then performs threshold judgment to quickly obtain the associated nodes (the first node cluster and the second node cluster), thereby gradually and rapidly narrowing the search range, achieving the purpose of fast search, and improving search efficiency.

[0050] like Figure 3 As shown, the present invention also provides a search system for bolt-related nodes, including a data acquisition unit, an array reconstruction unit, and an output unit; the output end of the data acquisition unit is connected to the input end of the array reconstruction unit, and the output end of the array reconstruction unit is connected to the input end of the output unit.

[0051] The data acquisition unit is used to acquire the geometric information of the unit nodes of the whole vehicle simulation model and the bolts to be processed. The geometric information includes bolt radius, bolt length, bolt center point 0, etc.

[0052] The array reconstruction unit is used to perform multi-directional sorting in the X, Y, and Z directions to determine the first range, i.e., the third reconstructed array;

[0053] The output unit is used to quickly obtain the associated nodes, including the first node cluster and the second node cluster, based on the first range and by judging through a threshold.

[0054] Iterate through the search center point O and calculate the Euclidean distance l between each cell node in the reconstructed array. Then, compare l with the search radius R. max Comparison, if l>R max Then remove the corresponding element node if l≤R max Then the corresponding unit nodes are retained, thus obtaining the first node cluster.

[0055] If the bolt to be processed is a cylinder, then obtain the height h and base radius r of the cylinder, and normalize the axis vector of the cylinder to set it to... Traverse the array to obtain the vector formed between the search center point O and each cell node in the reconstructed array, and let it be... and normalize it to

[0056] According to formula (1), we can obtain

[0057]

[0058] In formula (1), d1 represents the perpendicular length of the unit node to the axis; d2 represents the projection length of the line connecting the search center point and the unit node onto the axis. This represents the vector formed between the search center point O and the cell nodes in the reconstructed array. The model; Normalization of the axis vector of a cylinder; express The unitization of .

[0059] If d1>r and d2>h, then the corresponding cell nodes are removed from the reconstruction array, that is, the cell nodes with d1≤r or d2≤h are retained, thus obtaining the second node cluster.

[0060] The present invention also provides an electronic device, the electronic device including a processor, the processor being configured to run a computer program stored in a memory, so that the electronic device performs the steps of the method described in the above embodiments.

[0061] The present invention also provides a computer-readable storage medium storing a computer program that, when run on a processor, implements the steps of the methods described in the above embodiments.

[0062] Computer programs include computer program code, which can be in the form of source code, object code, executable files, or some intermediate form. Computer-readable media can include at least: any entity or device capable of carrying computer program code to an electronic device, recording media, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media. Examples include USB flash drives, portable hard drives, magnetic disks, or optical disks. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electrical carrier signals or telecommunication signals.

[0063] Those skilled in the art will understand that the above embodiments are specific examples of implementing the present invention, and in practical applications, various changes in form and detail may be made without departing from the spirit and scope of the present invention.

Claims

1. A method for searching bolt-associated nodes, characterized in that, Specifically, the following steps are included: S1: Obtain the geometric information of the unit nodes and bolts to be processed in the whole vehicle simulation model; S2: Sort the unit nodes of the whole vehicle simulation model by the X-direction coordinate value of the unit node to obtain the first array, then set the screw center point of the bolt to be processed as the search center point, determine the first boundary in the first array, and take the unit nodes within the first boundary as the first reconstruction array; S3: Sort the cell nodes in the first reconstruction array according to the Y-direction coordinate value of the cell nodes to obtain the second array, determine the second boundary in the second array, and take the cell nodes within the second boundary as the second reconstruction array; S4: Sort the cell nodes in the second reconstruction array according to the Z-direction coordinate values ​​of the cell nodes to obtain the third array. Determine the third boundary in the third array and use the cell nodes within the third boundary as the third reconstruction array. S5: Iterate through the search center point and calculate the Euclidean distance *l* between each cell node in the third reconstruction array. Then, compare *l* with the search radius. In comparison, if Then remove the corresponding unit node, if The corresponding unit nodes are then retained to obtain the first node cluster, thus realizing the association between bolts and nodes; S6: If the bolt to be processed is a cylinder, obtain the height h and base radius r of the cylinder, and normalize the axis vector of the cylinder to set it to... Traverse the array to obtain the vector formed between the search center point and each cell node in the third reconstruction array, and set it as... ; like and If the corresponding cell node is removed from the reconstructed array, then... or The unit nodes are retained, thus obtaining the second node cluster; Represents the perpendicular length of a unit node to the axis; This represents the projection length of the line connecting the search center point and the unit node onto the axis.

2. The method for searching bolt-associated nodes as described in claim 1, characterized in that, In S1, the geometric information includes bolt radius, bolt length, and screw center point.

3. The method for searching bolt-associated nodes as described in claim 1, characterized in that, In S2, the first boundary is determined by using the median value of the X-direction coordinate of the search center point. ,by As the first lower boundary, with The first upper boundary is defined, and the cell nodes located between the first lower boundary and the first upper boundary are added to the first reconstruction array.

4. The method for searching bolt-associated nodes as described in claim 1, characterized in that, In S3, the second boundary is determined by using the median value of the Y-axis coordinate of the search center point. ,by As the second lower boundary, with The second upper boundary is defined, and the cell nodes located between the second lower boundary and the second upper boundary are added to the second reconstruction array.

5. The method for searching bolt-associated nodes as described in claim 1, characterized in that, In S4, the third boundary is determined by using the median value of the Z-direction coordinate of the search center point. ,by As the third lower boundary, with As the third upper boundary, add the cell nodes between the third lower boundary and the third upper boundary to the third reconstruction array.

6. A method for searching bolt-associated nodes as described in claim 3, 4, or 5, characterized in that, Search radius R max =R+ERROR or R max =L+ERROR, where R represents the maximum radius from the center of the nut to the perimeter of the nut, L represents the maximum distance from the search center point to the perimeter of the nut, and ERROR represents the preset gap value.

7. The method for searching bolt-associated nodes as described in claim 1, characterized in that, According to formula (1), we can obtain In formula (1), This represents the vector formed between the search center point O and the cell nodes in the reconstructed array. The model; Normalization of the axis vector of a cylinder; express The unitization of .

Images