How to search for parts of a 3D CAD model
The 3D CAD model partial search method employs three-dimensional Radon transformation to efficiently and accurately compare subassembly models within assembly models, addressing inefficiencies in existing search methods by reducing data volume and improving geometric consideration.
Patent Information
- Application Number
- JP2021009110
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-01-22
- Publication Date
- 2024-12-17
- Estimated Expiration
- 2041-01-22
AI Technical Summary
Existing 3D CAD model search methods are inefficient and inaccurate due to the large amount of data required for feature quantity calculations, particularly when dealing with complex assembly models composed of multiple subassembly models.
A 3D CAD model partial search method that utilizes three-dimensional Radon transformation to calculate feature quantities for both the search and comparison models, considering the relative positional relationship of subassembly models within the assembly, by performing Radon transformation on individual subassembly models and the assembly models excluding them, and normalizing the results by volume to reduce data volume and enhance accuracy.
Enables quick and highly accurate retrieval of partial 3D CAD models by reducing data volume and improving calculation efficiency while considering the geometric arrangement of subassembly models, thus enhancing the accuracy of similarity comparisons.
Smart Images

Figure 0007601378000004 
Figure 0007601378000005 
Figure 0007601378000006
Abstract
Description
[Technical field]
[0001] The present invention relates to a three-dimensional CAD model part search method. [Background technology]
[0002] In recent years, in the manufacturing industry and other fields, model design is being carried out using 3D computer design tools (CAD: Computer-Aided Design). In order to improve the efficiency of design work, it is essential to utilize accumulated 3D model data. For this reason, research and development of various technologies such as search, clustering, classification, and detection of 3D model data is being conducted.
[0003] One of the common requirements for technologies that utilize 3D model data is the calculation of similarity between models. In addition, much research has been conducted into model search techniques as a way of calculating similarity between models. Although there has been active research into 3D model search techniques up to now, most of the research has been focused on search techniques that only consider information about the shape of the model, and no search techniques have been found that can strictly compare the layout of parts.
[0004] 3D models created for machine design and other purposes are often assembly models made up of multiple parts. In particular, in the design of large, complex machines such as automobiles, parts are assembled across multiple layers, resulting in the creation of huge models containing a huge number of parts. Such models that combine multiple parts are called assembly models, and each grouping at each layer is called a subassembly model. With the smallest unit of a 3D CAD model being a part, a subassembly model is a collection of parts, and an assembly model is a collection of subassembly models. It has been difficult to apply partial search technology to assembly models due to their complexity.
[0005] As a search method for searching for such subassembly models, Patent Document 1 proposes a 3D CAD model search method in which a search is performed for each component that makes up the 3D CAD data, and the 3D CAD data that is the finished product is accessed from each component. [Prior art documents] [Patent documents]
[0006] [Patent Document 1] JP 2018-136946 A Summary of the Invention [Problem to be solved by the invention]
[0007] However, in the previously proposed search methods, partial searches were achieved by performing a 2D Radon transform on the projection image of 3D CAD data and then using the properties of the resulting sinogram to perform comparisons, which resulted in a problem that the amount of data for features calculated from the 3D data was large and was still insufficient in terms of rapid searches.
[0008] An object of the present invention is to provide a three-dimensional CAD model part search method capable of performing a quick and highly accurate search. [Means for solving the problem]
[0009] The present invention relates to a three-dimensional CAD model part search method for comparing a search model with a comparison model stored in a database and evaluating a degree of difference, the search model and the comparison model being three-dimensional CAD data of an assembly model composed of a plurality of subassembly models, The computer A first calculation step of calculating a feature amount of the search model; The computer, A second calculation step of calculating a feature amount of the comparison model; The computer,and a comparison step of comparing features of the search model and the comparison model and calculating the degree of difference between the search model and the comparison model, wherein in the first calculation step and the second calculation step, for all subassembly models constituting the search model and the comparison model, the subassembly models and the assembly model excluding the subassembly models are each subjected to a three-dimensional Radon transform, and the feature values are derived from the transformed values. Effect of the Invention
[0010] According to the present invention, a three-dimensional CAD model part search method capable of performing a quick and highly accurate search can be provided. [Brief description of the drawings]
[0011] [Figure 1] FIG. 1 is a perspective view of an assembly model shown as an example of a search model. [Diagram 2] FIG. 2 is a perspective view of an assembly model shown as an example of a comparative model. [Diagram 3] FIG. 3 is a perspective view of an assembly model shown as an example of a comparative model. [Figure 4] FIG. 4 is a schematic diagram showing an example of a three-dimensional CAD model part search method according to this embodiment, and mainly shows a comparison step. [Diagram 5] FIG. 5 is a schematic diagram showing an example of the three-dimensional CAD model part search method of this embodiment, and mainly shows the first direction fixing step of the comparison step. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0012] The three-dimensional CAD data (hereinafter simply referred to as CAD data) targeted in the three-dimensional CAD model part search method (hereinafter simply referred to as part search method) of this embodiment is an assembly model including a plurality of subassembly models.
[0013] The partial search method of this embodiment is a method of comparing a search model with a comparison model stored in a database and evaluating the degree of difference. Note that the partial search method of this embodiment can be used in either case, whether the search model includes a part of the comparison model or the comparison model includes a part of the search model. In this embodiment, a case will be described where one included in the search model is found from among multiple comparison models stored in a database.
[0014] The search model and the comparison model are three-dimensional CAD data of an assembly model composed of multiple subassembly models. Moreover, the dissimilarity is an index that indicates the extent to which the comparison model is not included in the search model (how conceptually distant the search model and the comparison model are). The dissimilarity takes a positive value of 0 or greater. If the search model includes the comparison model, the dissimilarity is 0. Therefore, the smaller the dissimilarity value, the higher the extent to which the comparison model is included in the search model.
[0015] In this specification, an assembly model is a three-dimensional model that is configured by combining multiple sub-assembly models. Also, in this specification, a sub-assembly model is a three-dimensional model that constitutes a part of an assembly model. Therefore, an assembly model has multiple different or identical sub-assembly models. A sub-assembly model is a three-dimensional model that is configured by combining multiple parts. Also, a sub-assembly model may be a three-dimensional model that has only a single part.
[0016] <Illustrative explanation> The partial search method of this embodiment will be exemplarily described with reference to Fig. 1 to Fig. 3. The description here is merely an exemplary description of the concept of the partial search method, and in the strict sense, the method is different from the partial search method of the embodiment described later.
[0017] 1 to 3 are perspective views of first to third assembly models 11, 12, and 13. In Fig. 1 to Fig. 3, sub-assembly models included in each assembly model are classified by pattern.
[0018] The first assembly model 11 shown in FIG. 1 has a base portion 10, a first sub-assembly model 21, a second sub-assembly model 22, a third sub-assembly model 23, and a fourth sub-assembly model 24. The second assembly model 12 shown in FIG. 2 has a base portion 10, a first sub-assembly model 21, a second sub-assembly model 22, and a fifth sub-assembly model 25. The third assembly model 13 shown in FIG. 3 has a base portion 10, a first sub-assembly model 21, a fifth sub-assembly model 25, and a sixth sub-assembly model . The base portion 10 is also considered to be one of the subassembly models.
[0019] Here, we consider determining the degree of difference between the first assembly model 11 and the second and third assembly models 12, 13. That is, in this example, the first assembly model 11 corresponds to the search model, and the second and third assembly models 12, 13 correspond to the comparison models.
[0020] The second assembly model 12 has a fifth sub-assembly model 25 that is not included in the first assembly model 11. In addition, the third assembly model 13 has a fifth sub-assembly model 25 and a sixth sub-assembly model 26 that are not included in the first assembly model 11.
[0021] A fifth sub-assembly model 25 included in the second and third assembly models 12, 13 is a part of a third sub-assembly model 23 included in the first assembly model 11. On the other hand, a sixth sub-assembly model 26 included in the third assembly model 13 is composed of the same parts as the sub-assembly model 22 included in the first assembly model 11, but has a different positional relationship with other sub-assembly models than the first assembly model 11.
[0022] As a result of comparing the first assembly model 11 with the second and third assembly models 12 and 13, all of the parts included in the second assembly model 12 are included in the first assembly model 11 in the same arrangement. In contrast, all of the parts included in the third assembly model 13 are included in the first assembly model 11, but the arrangement of the sixth subassembly model 26 is different from that of the second subassembly model 22 included in the first assembly model 11. In this example, it is determined that the second assembly model 12 has a high similarity (i.e., a low degree of difference) with the first assembly model 11. In this way, the partial search method of this embodiment takes into consideration the arrangement of the subassembly models.
[0023] The first to third assembly models 11, 12, and 13 illustrated here have the same orientation. However, the data of the assembly models actually created may have different reference directions for each model. For this reason, the partial search method needs to consider the relative positional relationship between the assembly models when the relative orientation is changed.
[0024] <Embodiment> The following describes the embodiments. In this embodiment, the assembly model to be searched is called a search model, and the assembly model to be searched that is stored in the database is called a comparison model.
[0025] The partial search method of this embodiment includes a first calculation step, a second calculation step, a comparison step, and an output step. The order of the first calculation step and the second calculation step may be reversed. In addition, the comparison step uses the values (feature amounts) obtained in the first and second calculation steps, so it is performed after the first and second calculation steps.
[0026] The first calculation step and the second calculation step are performed mainly in the same manner, but the CAD data to be calculated are different. The first calculation step is a step of calculating the feature amount from the search model to be searched. On the other hand, the second calculation step is a step of calculating the feature amount of the comparison model stored in the database.
[0027] The algorithm of the partial search method of this embodiment is shown in Table 1 as the main algorithm.
[0028] [Table 1]
[0029] We now define the main algorithm and the symbols used below. M comp represents the search model. M part represents the comparison model. Search Model M comp and comparison model M part is a set of subassembly models sa. V comp and V part are sets of directions along which the 3D Radon transform is performed. V comp and V part The elements v of are two-dimensional vectors that represent directions in spatial polar coordinates, or more specifically, at points uniformly distributed on the unit sphere.
[0030] In this embodiment, the number of directions in which the three-dimensional Radon transform is performed in the first calculation step (V compThe number of elements in V part In general, the step of calculating the feature quantities from the search model (first calculation step) is performed online, and the step of calculating the feature quantities from the comparison model (second calculation step) is performed in advance and stored in the same server. By suppressing the number of directions for which the 3D Radon transform is performed in the first calculation step, the feature quantities can be calculated online at high speed, and by increasing the number of directions for which the 3D Radon transform is performed in the second calculation step, the accuracy of the search results can be ensured.
[0031] The main algorithm performs the dissimilarity calculation between the search model and the comparison model in three steps: (1) First calculation step (2) Second calculation step (3) Comparison step Each step will now be described in more detail.
[0032] <First and second calculation steps> In the first calculation step, the feature amount is calculated by performing a three-dimensional Radon transform on a search model from multiple directions. Similarly, in the second calculation step, the feature amount is calculated by performing a three-dimensional Radon transform on a comparison model from multiple directions.
[0033] Search Model M comp Compare with Model M part When a set of subassembly models is given, the correspondence between the subassembly models of two assembly models (a search model and a comparison model) is generally unknown. The relationship between the positions and orientations of the two assembly models is also unknown. Therefore, in the partial search method of this embodiment, all combinations of subassembly models and all combinations of orientations are compared, and among them, a combination that minimizes the degree of difference between the assembly models is selected.
[0034] Here, the algorithm of the three-dimensional Radon transform is shown as the first sub-algorithm in Table 2. The first sub-algorithm is a part of the first and second calculation steps, and is an algorithm for deriving the three-dimensional Radon transform. The first sub-algorithm is the algorithm expressed as Radon3D in the main algorithm shown in Table 1.
[0035] [Table 2]
[0036] In the first sub-algorithm, when performing a 3D Radon transform along a direction v∈V, first the model is rotated so that v is in the positive direction of the x-axis. In the first sub-algorithm, the function sa' = Rotate(sa, v) in the second line rotates the sub-assembly model sa before rotation so that v is in the positive direction of the x-axis of sa'.
[0037] Next, calculate the cross-sectional area of the model on a plane perpendicular to the x-axis along the positive x-axis direction. The function calculateCrossSectionArea(sa',x) on the fourth line of the first sub-algorithm calculates the cross-sectional area of the model sa' where the value in the x-axis direction is x. Here, x changes at each specified sampling interval, and the section in which the model exists is scanned.
[0038] Actual 3D CAD models are stored in a variety of data formats. One of the standard shape description formats is the STL (Standard Triangulated Language) data format. The STL file format is a polygon format that represents the surface of a 3D solid as a collection of small triangular faces. The STL data format can be converted from all major 3D data formats. In this format, the cross-sectional area can be calculated from geometric calculations. The feature quantity obtained in this way, "feature", is a quadratic real array of (number of directions) × (number of samples) with non-negative values.
[0039] In the first calculation step, a comparison model M is calculated by executing a first sub-algorithm. part The feature quantity F part In the first calculation step, the first sub-algorithm is executed to calculate a search model M comp The feature quantity F comp is calculated.
[0040] According to this embodiment, in the first calculation step and the second calculation step, the feature amount is calculated by performing a three-dimensional Radon transform on the three-dimensional CAD model. The three-dimensional Radon transform is a calculation method for calculating the cross-sectional area of the three-dimensional CAD model in the direction (coordinates on a spherical surface) relative to the origin and the distance from the origin. Therefore, the feature amount obtained by the three-dimensional Radon transform is a scalar value associated with the direction and distance relative to the origin, and the amount of data can be reduced compared to the search method disclosed in Patent Document 1. As a result, the calculation time of the feature amount in the first calculation step and the second calculation step, as well as the calculation time in the comparison step described later, can be significantly reduced. In addition, since the calculation time is reduced, it becomes easier to increase the number of samples, and the accuracy of the evaluation of the dissimilarity can be improved.
[0041] According to this embodiment, in the first calculation step and the second calculation step, the cross-sectional area is calculated from a plurality of directions, and therefore, even when a search model and a comparison model having different poses are compared, a feature amount that allows a difference to be effectively evaluated is calculated.
[0042] In the first and second calculation steps of this embodiment, it is required to calculate the relative positional relationship of the subassembly model included in the assembly model as a feature amount. Therefore, the inventors have come up with the idea of combining values obtained by performing three-dimensional Radon transform on the subassembly model to be compared and the assembly model excluding the subassembly model, and treating the combined values as a feature amount.
[0043] According to this embodiment, in the first calculation step and the second calculation step, for all constituent subassembly models, the subassembly model and the assembly model excluding the subassembly model are each subjected to a 3D Radon transform, and the transformed values are regarded as feature quantities. That is, the feature value f comp is the result of the 3D Radon transform of the subassembly model sa (f comp , sa ) and the result of the 3D Radon transform of the assembly model excluding the subassembly model sa (f comp , others ) and Similarly, the feature value f part is the result of the 3D Radon transform of the subassembly model sa (f part , sa ) and the result of the 3D Radon transform of the assembly model excluding the subassembly model sa (f part , others ) and
[0044] In the first calculation step and the second calculation step, the feature quantities of the subassembly model and the assembly model excluding the subassembly model are normalized, thereby making it possible to suppress the influence of the size of each part on the feature quantities. More specifically, in the first calculation step and the second calculation step, the feature quantities of the subassembly model and the assembly model excluding the subassembly model are the sums of values obtained by individually performing a 3D Radon transform on all included parts and dividing the values by an approximation of the volume of the parts.
[0045] 4 and 5 are schematic diagrams showing an example of the 3D CAD model part search method of this embodiment. In each diagram, subassembly models 31 and 32 of a comparison model 30 and subassembly models 41, 42, and 43 of a search model 40 are shown. In each diagram, one cube represents one part. A set of cubes represented by the same pattern represents one subassembly.
[0046] In this example, the comparative model 30 has a first subassembly model 31 and a second subassembly model 32. The first subassembly 31 of the comparative model 30 is made up of two parts 31a and 31b. The second subassembly 32 of the comparative model 30 is made up of one part 32a.
[0047] In this example, the search model 40 has a first subassembly model 41, a second subassembly model 42, and a third subassembly model 43. The first subassembly 41 of the search model 40 consists of one part 41a. The second subassembly 42 of the search model 40 consists of two parts 42a and 42b. The third subassembly 43 of the search model 40 consists of one part 43a.
[0048] 4 is a diagram showing combinations B1, B2, B3, B4, B5, and B6 to be compared in a comparison step described later of the subassembly models of the comparison model 30 and the search model 40. In the comparison step, all combinations B1, B2, B3, B4, B5, and B6 in FIG. 4 are compared in sequence.
[0049] Fig. 5 is a diagram showing how to handle the respective feature quantities when comparing the first subassembly model 31 of the comparison model 30 with the first subassembly 41 of the search model 40 in a comparison step described later. Fig. 5 is a diagram showing a comparison process in the comparison step for combination B1 in the table of Fig. 4, in which the first subassemblies 31, 41 of the comparison model 30 and the search model 40 are compared.
[0050] 5, the feature amount of the first subassembly model 31 and the feature amount of the assembly model excluding the first subassembly model 31 (i.e., the second subassembly model 32) are calculated as the feature amount of the comparison model 30. The step of calculating the feature amount of the comparison model 30 is the first calculation step.
[0051] As described above, the features of the compared subassembly model and the assembly model excluding the compared subassembly model are the sum of the values obtained by individually performing a 3D Radon transform on all included parts and dividing the results by an approximate value of the part volume.
[0052] The first subassembly model 31 of the comparative model 30 includes two parts 31a and 31b. Therefore, the feature amount of the first subassembly model 31 of the comparative model 30 is the sum of values obtained by individually performing three-dimensional Radon transform on the two parts 31a and 31b and dividing the results by the approximate values of the volumes of the respective parts.
[0053] On the other hand, an assembly model excluding the first subassembly model 31 of the comparative model 30 (i.e., the second subassembly model 32) includes only one part 32a. Therefore, the value obtained by dividing the value obtained by performing the three-dimensional Radon transform on the part 32a by the approximate value of the volume of the part 32a becomes the feature amount of the assembly model excluding the second subassembly model 31.
[0054] Further, as the feature amount of the retrieval model 40, the feature amount of the first subassembly model 41 and the feature amount of the assembly model excluding the first subassembly model 41 (i.e., the second and third subassembly models 42 and 43) are calculated. Note that the step of calculating the feature amount of the retrieval model 40 is the second calculation step.
[0055] Only one part 41a is included in the first subassembly model 41 of the search model 40. Therefore, the value obtained by dividing the value obtained by three-dimensional Radon transform of the part 41a by an approximate value of the volume of the part 41a becomes the feature amount of the first subassembly model 41 of the search model 40.
[0056] On the other hand, the assembly model excluding the first subassembly model 41 of the search model 40 (i.e., the second and third subassembly models 42 and 43) includes a total of three parts 42a, 42b, and 43a. Therefore, the three parts 42a, 42b, and 43a are individually subjected to three-dimensional Radon transformation, and the sum of the values obtained by dividing the results by the approximate values of the volumes of the respective parts becomes the feature amount of the assembly model excluding the first subassembly model 41.
[0057] According to this embodiment, a subassembly model and an assembly model other than the subassembly model are individually subjected to a three-dimensional Radon transform to obtain feature quantities. By simultaneously comparing these two feature quantities, it is possible to calculate feature quantities that take into account the relative positional relationship of the subassembly model with respect to the assembly model. As a result, it is possible to calculate the degree of difference between a search model and a comparison model, taking into account the geometric arrangement of the subassembly model.
[0058] According to this embodiment, the value obtained by 3D Radon transform of the subassembly model and the value obtained by 3D Radon transform of the assembly model excluding the subassembly model are treated as feature quantities separately. Therefore, compared to the case where the sum of these values is used (see Patent Document 1), the information representing the relative positional relationship is not diluted, and it is easy to clearly determine the degree of difference by the feature quantity. According to this embodiment, the data capacity of the feature amount can be made smaller relative to the amount of information by adopting the 3D Radon transform as a method for calculating the feature amount, as compared with the search method disclosed in Patent Document 1. Therefore, even if the value obtained by 3D Radon transform of the subassembly model and the value obtained by 3D Radon transform of the assembly model excluding the subassembly model are each used as the feature amount individually, it is possible to prevent the overall data capacity from becoming too large.
[0059] <Comparison step> The comparison step is a step of comparing the feature amounts of the search model and the comparison model and calculating the degree of difference between the search model and the comparison model.
[0060] As shown in the main algorithm of Table 1, the (3) comparison step includes a (3-1) direction fixing first step, a (3-2) direction fixing second step, and a (3-3) decision step. (3-1) Fixing the Orientation The first step is to fix the orientation and then calculate the dissimilarity between the search model and the comparison model (specific combination dissimilarity) for all possible correspondences between subassemblies based on the features of the search model and the comparison model. (3-2) The second direction fixing step is a step of selecting the smallest value from among the multiple specific combination dissimilarities derived in the first direction fixing step, and setting the dissimilarity in this direction (specific direction dissimilarity). (3-3) The decision step is a step of selecting the smallest specific direction dissimilarity in each direction derived in the second direction fixation step, and deriving the dissimilarity between the comparison model and the search model.
[0061] (First step of fixing direction) The first direction fixing step is a step of calculating the dissimilarity for all combinations of subassembly models of the search model and the comparison model for a specific direction. In the first direction fixing step, the dissimilarity between all subassembly models of the search model and all subassembly models of the comparison model is calculated in a brute force manner.
[0062] In the first direction fixing step, the search model and the comparison model are compared for a specific fixed direction. As shown in the determination step described later, the specific fixed direction is changed to all directions, and the search model and the comparison model are finally compared for all directions.
[0063] Here, the dissimilarity of each of the combinations of the subassembly models calculated in the first direction fixing step is called a “specific combination dissimilarity.” In the first direction fixing step, the same number of specific combination dissimilarity is calculated as the number of combinations of the subassembly models calculated in the fixed direction by the brute force method.
[0064] That is, the first direction fixing step is a step in which the direction is fixed and the sum of the differences in the features for all combinations of all subassembly models of the search model and all subassembly models of the comparison model is calculated as a specific combination dissimilarity.
[0065] This point will be explained with reference to the schematic diagram of FIG. In this example, the comparison model 30 has two subassembly models (first and second subassembly models 31 and 32). On the other hand, the search model 40 has three subassembly models (first, second and third subassembly models 41, 42 and 43). In the first direction fixing step, the first subassembly model 31 of the comparison model 30 is compared with the first, second and third subassembly models 41, 42 and 43 of the search model 40 in a fixed specific direction, and the second subassembly model 32 of the comparison model 30 is compared with the first, second and third subassembly models 41, 42 and 43 of the search model 40. As a result, a number of specific combination dissimilarity degrees corresponding to the product (2×3 in FIG. 4) of the number of subassembly models of the comparison model 30 and the number of subassembly models of the search model 40 is calculated.
[0066] In the first and second calculation steps, the search model M comp and comparison model M part The feature value f to be compared comp ,f part When is determined, the algorithm for calculating the specific combination dissimilarity is shown in Table 3 as the second sub-algorithm. The second sub-algorithm is an algorithm expressed as ComputePartialDissimilarity in the main algorithm shown in Table 1.
[0067] [Table 3]
[0068] In general, the posture and position of an assembly model in a three-dimensional space differ depending on the data. Therefore, in order to derive the difference in feature quantities that are robust against rotation and translation, the feature quantities are translated while deriving the difference. However, since the relative position information of the subassembly model within the assembly is necessary, the feature quantities (f comp , others , f part , others ) are translated at the same time, and the difference in feature amounts is similarly derived for these.
[0069] That is, in the comparison step, the features to be compared are translated relatively to each other, and the value that minimizes the sum of the differences between the features is taken as the dissimilarity.
[0070] According to this embodiment, the dissimilarity is calculated by relatively translating the features of the search model and the comparison model, so that the relative positional relationship between the search model and the comparison model can be comprehensively checked to calculate the optimal dissimilarity, and any deviation in the relative positional relationship can be offset.
[0071] Feature value f of the subassembly model of the comparison model part , sa and the feature value f of the subassembly model of the search model comp , sa contains the shape and arrangement information of the sub-assembly model in question, and the difference (f part , sa -f comp , sa ) is a value that represents the difference in shape and arrangement. When the comparison model is completely included in the search model, (f part , sa -f comp , sa ) elements do not contain positive values, only zero or negative values.
[0072] In this case, as in lines 7 and 8 of the second sub-algorithm, by adopting the greater of the difference value and 0, if there is a perfect partial match, the value is set to 0; otherwise, the non-zero difference represents the extent to which it is not included in the search model, and the value of the excess part becomes the difference between the features.
[0073] In addition, the feature value f of the search model excluding the subassembly model is comp , others and the feature value f of the comparison model excluding the subassembly model part , others As explained based on Figure 5, these are calculated using the sum of the feature quantities of the parts that make up the target subassembly model.
[0074] In lines 10 and 11 of the second sub-algorithm, the difference between the feature quantities of the sub-assembly model and the assembly model excluding the sub-assembly model are each divided by the number of parts included in the sub-assembly model of the comparison model. The divided values are then used to compare the differences in the feature quantities in the comparison step. This makes it possible to suppress the effect of the number of parts included in the sub-assembly model on the difference in the feature quantities.
[0075] As shown diagrammatically in FIG. 5, in the comparison step, it is preferable to use, as feature quantities of the subassembly model calculated in the first calculation step and the second calculation step and the assembly model excluding the subassembly model, the sum of values obtained by performing a three-dimensional Radon transform on the components constituting each model and dividing the result by an approximate value of the volume of the component.
[0076] That is, in the first direction fixing step, for the search model and the comparison model, the specific combination dissimilarity is calculated based on the sum of the difference in feature between the subassembly models to be compared and the difference in feature between the assembly models excluding the subassembly models to be compared. The value of the feature by the three-dimensional Radon transform is affected by the volume of the model. In this embodiment, the specific combination dissimilarity is calculated based on the sum of the results of three-dimensional Radon transform of the parts divided by an approximate value of the volume of the parts, thereby reducing the effect of the volume of the parts on the calculation of the specific combination dissimilarity.
[0077] As an approximation of the volume, the sum (integral value) of the cross-sectional areas calculated by the three-dimensional Radon transform can be used. This allows normalization to be performed without a separate volume calculation, thereby shortening the processing time.
[0078] Furthermore, in the first direction fixing step, it is preferable to calculate the specific combination dissimilarity by dividing the sum of the difference in feature amounts between the subassembly models to be compared for the search model and the comparison model and the difference in feature amounts between the assembly models excluding the subassembly model to be compared by the number of parts of the subassembly model to be compared in the comparison model. By dividing the above sum by the number of parts of the subassembly model of the comparison model, the influence of the number of parts on the calculation of the specific combination dissimilarity can be reduced.
[0079] This point will be explained with reference to the schematic diagram of FIG. The first direction fixing step is a step of fixing the direction and calculating the sum of the differences in the feature amounts for all combinations of subassembly models of the comparison model 30 and the search model 40 as a specific combination dissimilarity.
[0080] In FIG. 5, a first sub-assembly model 31 of the comparison model 30 and a first sub-assembly model 41 of the search model 40 are compared.
[0081] The feature amount of the first subassembly 31 of the comparison model 30 is the sum of two parts 31a and 31b individually subjected to three-dimensional Radon transform, divided by the approximate value of the volume of each part, and normalized. On the other hand, the feature amount of the first subassembly 41 of the search model 40 is the part 41a subjected to three-dimensional Radon transform, divided by the approximate value of the volume of the part 41a, and normalized. In this step, the difference (first difference D1) between the feature amount of the first subassembly 31 of the comparison model 30 and the feature amount of the first subassembly 41 of the search model 40 is calculated.
[0082] The feature amount of the assembly model excluding the first subassembly model 31 of the comparison model 30 (i.e., the second subassembly model 32) is obtained by performing a three-dimensional Radon transform on the part 32a, dividing and normalizing the result by an approximate value of the volume of the part 32a. On the other hand, the feature amount of the assembly model excluding the first subassembly model 41 of the search model 40 (i.e., the second and third subassembly models 42, 43) is obtained by performing a three-dimensional Radon transform on the three parts 42a, 42b, 43a individually, dividing and normalizing the result by an approximate value of the volume of each part. In this step, the difference (second difference D2) between the feature quantities of the assembly model excluding the first subassembly model 31 of the comparison model 30 and the assembly model excluding the first subassembly model 41 of the search model 40 is calculated.
[0083] In the direction fixing step, the sum of the first difference D1 and the second difference D2 is further divided by the number of parts of the first subassembly model 31 to be compared in the comparison model 30 to calculate the specific combination dissimilarity. In the example of Fig. 5, the number of parts of the first subassembly model 31 to be compared in the comparison model 30 is 2. Therefore, in this example, the sum of the first difference D1 and the second difference D2 is divided by 2.
[0084] According to this embodiment, in the first calculation step, the feature amount of the first subassembly model 31 of the comparison model 30 and the assembly model excluding the subassembly model 31 (i.e., the subassembly model 32) is the sum of values obtained by individually performing three-dimensional Radon transform on all included parts and dividing the result by an approximate value of the volume of the part. Similarly, in the second calculation step of this embodiment, the feature amount of the first subassembly model 41 of the search model 40 and the assembly model excluding the subassembly model 41 (i.e., the subassembly models 42, 43) is the sum of values obtained by individually performing three-dimensional Radon transform on all included parts and dividing the result by an approximate value of the volume of the part. Also, in the first direction fixing step of this embodiment, for the comparison model 30 and the search model 40, a specific combination dissimilarity is calculated based on the sum of the difference in feature amount between the subassembly models (first subassembly models 31, 41) to be compared and the difference in feature amount between the assembly models excluding the subassembly model to be compared. More specifically, the specific combination dissimilarity is calculated by further dividing this sum by the number of parts (two in this configuration) of the first subassembly model 31 compared with the comparison model 30. By carrying out these operations, all subassembly models are evaluated with equal weighting, regardless of the volume and number of parts included in the subassembly models, and the dissimilarity between assembly models can be accurately evaluated.
[0085] (Second step of fixing direction) The second step of direction fixing is to select the dissimilarity for a specific direction (hereafter referred to as the "specific direction dissimilarity"). The specific direction dissimilarity derived in this step represents the dissimilarity between the search model and the comparison model when limited to a specific direction.
[0086] In the second direction fixing step, the minimum value is selected from the multiple specific combination dissimilarity values derived in the first direction fixing step, and the selected minimum value is then defined as the dissimilarity in this direction (specific direction dissimilarity).
[0087] In other words, the second direction fixing step is a step of deriving a combination of subassembly models that minimizes the specific combination dissimilarity calculated in the first direction fixing step, and setting the specific combination dissimilarity at this time as the specific direction dissimilarity for that direction.
[0088] This point will be explained with reference to the schematic diagram of FIG. In this example, the comparison model 30 has two subassembly models 31 and 32, and the search model 40 has three subassembly models 41, 42, and 43. For this reason, the comparison model 30 and the search model 40 compare the specific combination dissimilarity of the combinations B1, B2, B3, B4, B5, and B6 of the six subassembly models, and further select the minimum value of the specific combination dissimilarity of each of the six combinations B1, B2, B3, B4, B5, and B6 as the specific direction dissimilarity.
[0089] The second step of the main algorithm, shown in Table 1, for fixing the orientation is described in detail below. First, in line 16 of the main algorithm, the feature f obtained by the previous processing is comp ,f part About,sa comp ∈M comp andsa part ∈M part Among all the combinations of the above, the combination that minimizes the sum of the differences between the feature quantities is solved. In this embodiment, the number of subassemblies in the comparison model is smaller than the number of subassemblies in the search model. In this case, all the combinations mean all the one-to-one injections (mappings) from the set of subassemblies in the comparison model to the set of subassemblies in the search model.
[0090] The sum of the differences between the features in the second direction fixing step is taken as the sum of the differences between the assemblies. The problem of finding this optimal combination is formulated and solved as a combinatorial optimization problem called an assignment problem.
[0091] (Decision step) The determination step is a step of determining the smallest dissimilarity for all possible directions. Through the determination step, a dissimilarity indicating the dissimilarity between the search model and the comparison model is calculated. In this embodiment, the number of directions (V comp The number of elements included in is the number of directions (V part The dissimilarity is V comp From V part The injective step to minimize the dissimilarity is found, and the dissimilarity between the final assemblies is derived from the dissimilarity at that point. The injective step to minimize the dissimilarity is formulated and solved as an assignment problem.
[0092] In the determination step, first, the first direction fixing step and the second direction fixing step are performed for all directions. In other words, the first direction fixing step and the second direction fixing step are repeated while changing the direction. In this way, the specific direction dissimilarity is obtained for all combinations of directions. Next, the smallest specific direction dissimilarity is selected from these. Furthermore, the smallest specific direction dissimilarity is divided by the number of subassemblies in the comparison model to obtain the dissimilarity.
[0093] In other words, the determination step is a step in which a first direction fixing step and a second direction fixing step are performed for all directions, the direction in which the specific direction dissimilarity is smallest is derived, and the dissimilarity between the search model and the comparison model is derived from the specific direction dissimilarity at this time.
[0094] In this embodiment, as shown in line 19 of the main algorithm (see Table 1), the result obtained in the determination step (the degree of difference between the search model and the comparison model) is calculated based on the number of subassemblies included in the comparison model (|M part|). That is, according to this embodiment, the dissimilarity is normalized by the number of subassemblies included in the comparison model. This makes it possible to suppress the number of subassemblies in the comparison model from affecting the dissimilarity. When comparing the dissimilarity between a search model and multiple comparison models, accurate search results can be calculated even if the comparison models differ in the number of subassemblies.
[0095] The search performed based on the dissimilarity thus obtained is robust against the orientation and position of the model, does not depend on the identifier of the subassembly model, and is a partial search that takes into account both the shape and arrangement of the model.
[0096] Here, a case where one comparison model is prepared as a search target has been described. However, in an actual implementation, a plurality of comparison models are stored in the database as search targets. It is preferable that the feature amount of each comparison model is calculated in advance and stored as related information.
[0097] When searching a search model against multiple assembly models in a database, the search model is compared with multiple comparison models in the database in order to derive the comparison model with the smallest degree of difference, thereby providing the searcher with one of the comparison models in the database that is most similar to the search model.
[0098] Although various embodiments of the present invention have been described above, the configurations and combinations thereof in each embodiment are merely examples, and additions, omissions, substitutions, and other modifications of the configurations are possible without departing from the spirit of the present invention. Furthermore, the present invention is not limited to the embodiments. [Explanation of symbols]
[0099] 10...base part, 11...first assembly model, 12...second assembly model, 13...third assembly model, 21...first sub-assembly model, 22...second sub-assembly model, 23...third sub-assembly model, 24...fourth sub-assembly model, 25...fifth sub-assembly model, 26...sixth sub-assembly model
Claims
1. a method for retrieving a part of a 3D CAD model, the method comprising: comparing a retrieved model with a comparison model stored in a database and evaluating the degree of difference; the search model and the comparison model are three-dimensional CAD data of an assembly model composed of a plurality of subassembly models; A first calculation step in which a computer calculates a feature amount of the retrieval model; a second calculation step in which the computer calculates a feature amount of the comparison model; a comparison step in which the computer compares the feature amounts of the search model and the comparison model and calculates a degree of difference between the search model and the comparison model; In the first calculation step and the second calculation step, for all subassembly models constituting the search model and the comparison model, the subassembly models and an assembly model excluding the subassembly models are each subjected to a three-dimensional Radon transform, and the feature quantity is derived from the transformed value. A method for retrieving parts of a three-dimensional CAD model.
2. In the first calculation step and the second calculation step, the computer performs a three-dimensional Radon transform from a plurality of directions. The method for searching a part of a three-dimensional CAD model according to claim 1.
3. The comparison step comprises: a first direction fixing step in which the computer fixes the direction and calculates a sum of the differences in the feature amounts as a specific combination dissimilarity for all combinations of subassembly models of the search model and the comparison model; a second direction fixing step in which the computer derives a combination of subassembly models that minimizes the specific combination dissimilarity calculated in the first direction fixing step, and sets the specific combination dissimilarity at this time as a specific direction dissimilarity for the direction; The method further comprises a determination step in which the computer performs the first direction fixing step and the second direction fixing step for all directions, derives the direction in which the specific direction dissimilarity is the smallest, and derives the dissimilarity between the search model and the comparison model from the specific direction dissimilarity at this time. The three-dimensional CAD model part searching method according to claim 2.
4. In the determining step, the computer derives the direction in which the specific direction dissimilarity is minimized, and derives the dissimilarity by dividing the specific direction dissimilarity at this time by the number of subassemblies of the comparison model. The three-dimensional CAD model part searching method according to claim 3.
5. In the first calculation step and the second calculation step, The feature quantities of the subassembly model and the assembly model excluding the subassembly model are sums of values obtained by performing three-dimensional Radon transform on all included parts individually and dividing the results by an approximate value of the volume of the parts. The three-dimensional CAD model part searching method according to claim 4.
6. In the first direction fixing step, the computer calculates the specific combination dissimilarity degree based on a sum of a difference in feature amounts between subassembly models to be compared and a difference in feature amounts between assembly models excluding the subassembly model to be compared, for the search model and the comparison model. The three-dimensional CAD model part searching method according to claim 5.
7. In the first direction fixing step, the computer further divides the sum by the number of parts of the subassembly model to be compared of the comparison model to calculate the specific combination dissimilarity. The three-dimensional CAD model part searching method according to claim 6.
8. In the comparing step, the computer relatively translates the feature amounts to be compared to obtain a value that minimizes a sum of differences between the feature amounts. The three-dimensional CAD model part search method according to any one of claims 1 to 7.
9. The database stores a plurality of comparison models to be searched; The computer sequentially compares the search model with a plurality of the comparison models to derive the comparison model with the smallest degree of difference. The three-dimensional CAD model part search method according to any one of claims 1 to 8.
Citation Information
Patent Citations
Texture describtion method in frequency domain, and texture-based retrieval method
JP2001067462A
Three-dimensional shape comparison program and three-dimensional similar shape retrieval program
JP2006277166A
Three-dimensional CAD model similarity search method
JP2015158752A
Three-dimensional CAD model part search method and three-dimensional CAD model search method
JP2018136946A
Three-dimensional assembly model retrieval system, method and program
JP2020135902A
