Method and appafaratus for processing b-rep geometric model
By processing non-shared faces in parallel, the method enhances the efficiency of B-Rep geometric model processing by avoiding data races and synchronization, thus accelerating overall processing.
Patent Information
- Application Number
- PCT/RU2025/000140
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-05-07
- Publication Date
- 2026-11-12
AI Technical Summary
Efficiency of parallelization in processing three-dimensional B-Rep geometric models is hindered by data races and corruption due to shared vertices and edges, leading to slowed overall processing.
Process faces in parallel that do not share vertices or edges, determining independent faces using a set of vertices and edges to avoid synchronization, allowing parallel execution without blocking.
Improves the efficiency of parallelization by preventing data races and accelerating overall processing of B-Rep geometric models.
Smart Images

Figure RU2025000140_12112026_PF_FP_ABST
Abstract
Description
METHOD AND APPAFARATUS FOR PROCESSING B-REP GEOMETRIC MODELTECHNICAL FIELD
[0001] Embodiments of the present application relate to the field of computer, and more specifically, to a method and an apparatus for processing boundary representation (B-Rep) geometric model.BACKGROUND
[0002] In computer field, when processing a three-dimensional B-Rep geometric model, a typical need is to run particular geometry processing operations on all or a part of entities (such as, faces, edges, vertices) of the B-Rep geometric model. Processing multiple entities of the B-Rep geometric model in parallel can reduce the time required to process the B-Rep geometric model, which is an important goal in development of software tools for processing B-Rep geometric models.
[0003] However, entities of a B-Rep geometric model may have connections. For example, some edges may have shared vertices, and / or some faces may have shared edges and / or shared vertices. In this case, processing an entity of the B-Rep geometric model may affect other entities having connection with it, which may require special treatment to prevent data races or corruption. Such treatment may reduce efficiency of parallelization and slow down the overall processing of the B-Rep geometric model.
[0004] Therefore, how to improve efficiency of parallelization in processing the B-Rep geometric model becomes an urgent problem to be solved.SUMMARY
[0005] Embodiments of the present application provide a method and an apparatus for processing B-Rep geometric model. The technical solutions can avoid execution threads fromiblocking each other when processing faces of a B-Rep geometric model in parallel. Thereby, efficiency of parallelization in processing the B-Rep geometric model can be improved.According to a first aspect, an embodiment of the present application provides a method for processing B-Rep geometric model. The method includes: obtaining a to-be-processed B-Rep geometric model, where the B-Rep geometric model includes multiple faces; determining a first set, where the first set includes at least two faces among the multiple faces, any two faces in the first group do not have a shared vertex and / or a shared edge; and processing the at least two faces in the first set in parallel.
[0006] According to the above technical solution, there is no connection between any two faces among two or more faces processed in parallel. Thereby, modification occurred during processing of one face does not need to be synchronized with other faces being processed in parallel, which allows parallel execution threads to be executed without blocking each other. Thus, efficiency of parallelization in processing the B-Rep geometric model can be improved and the overall processing of the B-Rep geometric model can be accelerated.
[0007] With reference to the first aspect, in a possible design, the determining a first set includes: obtaining the first set and a second set, where the second set includes multiple first entities of the B-Rep geometric model, the first entity comprises vertex and / or edge, each face in the first set corresponds to a subset of the second set, the subset includes all first entities of a corresponding face.
[0008] In other words, an intersection of subsets corresponding to any two faces in the first set is empty.
[0009] According to the above technical solution, faces that are not connected to each other can be selected according to a set of vertices and / or edges of the B-Rep geometric model (i.e. the second set). Thereby, faces to be processed in parallel can be determined easily without complex analysis of dependency graph. Thus, cost of processing the B-Rep geometric model can be reduced.
[0010] With reference to the first aspect, in a possible design, the second set includes all first entities of the B-Rep geometric model.
[0011] According to the above technical solution, as many faces to be processed in parallel as possible can be selected. Thus, efficiency of parallelization in processing the B-Repgeometric model can be further improved.
[0012] With reference to the first aspect, in a possible design, the obtaining the first set and a second set includes: determining whether any first entity of a first face is included in the second set, where the first face is a face among the multiple faces of the B-Rep geometric model; if all first entities of the first face are determined not to be included in the second set, adding the first face into the first set; and adding all first entities of the first face into the second set.
[0013] In other words, if any first entity of the first face is determined to be included in the second set, the first face will not be added into the first set, and first entities of the first face (except for those have already included in the second set) will not be added into the second set.
[0014] According to the above technical solution, it is easy to add elements to the first set based on the elements in the second set. That is, it is not necessary to rely on complex analysis to determine whether a face can be processed in parallel with other faces. Thus, cost of processing the B-Rep geometric model can be reduced.
[0015] With reference to the first aspect, in a possible design, the obtaining the first set and a second set further includes: initializing, before the determining whether any first entity of a first face is included in the second set, the first set and the second set, where the first set after initialization is empty, and the second set after initialization is empty; and repeating the determining whether any first entity of a first face is included in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
[0016] According to the above technical solution, by initialization and loop execution, as many faces as possible can be added to the first set. That is, through one cycle, all faces in the B-Rep geometric model that can be processed in parallel can be determined
[0017] With reference to the first aspect, in a possible design, the processing the at least two faces in the first set includes at least one of the following: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
[0018] According to the above technical solution, multiple processing operations which are requested directly by a user or occupy majority of total processing time of the user’s operation can be supported.
[0019] With reference to the first aspect, in a possible design, after the processing the at least two faces in the first set in parallel, the method further includes: determining a third set, where the third set includes at least two faces among multiple remaining faces, the multiple remaining faces are faces among the multiple faces other than faces that have been processed, and any two faces in the third set do not have a shared vertex and / or a shared edge, and; processing the at least two faces in the third set in parallel.
[0020] With reference to the first aspect, in a possible design, the method further includes: repeating the determining a third set and processing the at least two faces in the third set in parallel until all of the multiple faces have been processed.
[0021] According to the above technical solution, after processing two or more faces in parallel, method provided by this present application can be repeated to continue select faces to be processed from remaining faces of the B-Rep geometric model. Thus, the method can be iteratively executed to complete processing of the entire B-Rep geometric model.
[0022] With reference to the first aspect, in a possible design, the B-Rep geometric model includes two or more solid bodies and / or shell bodies, and the first set includes faces belonging to different solid bodies and / or shell bodies.
[0023] According to the above technical solution, when there are multiple bodies in the model, faces belonging to different bodies can also be processed in parallel. Thus, efficiency of parallelization in processing the B-Rep geometric model can be further improved.
[0024] According to a second aspect, an embodiment of the present application provides an apparatus for processing B-Rep geometric model. The apparatus includes: an obtaining module, configured to obtain a to-be-processed B-Rep geometric model, where the B-Rep geometric model includes multiple faces; a determining module, configured to determine a first set, where the first set includes at least two faces among the multiple faces, any two faces in the first set do not have a shared vertex and / or a shared edge; and a processing module, configure to process the at least two faces in the first set in parallel.
[0025] With reference to the second aspect, in a possible design, the determining module is configured to: obtain the first set and a second set, where the second set includes multiple first entities of the B-Rep geometric model, the first entity includes vertex and / or edge, each face in the first set corresponds to a subset of the second set, the subset includes all first entities of acorresponding face.
[0026] With reference to the second aspect, in a possible design, the second set includes all first entities of the B-Rep geometric model.
[0027] With reference to the second aspect, in a possible design, the determining module is configured to: determine whether any first entity of a first face is included in the second set, where the first face is a face among the multiple faces of the B-Rep geometric model; if all first entities of the first face are determined not to be included in the second set, add the first face into the first set; and add all first entities of the first face into the second set.
[0028] With reference to the second aspect, in a possible design, the determining module is further configured to: initialize, before the determining whether any first entity of a first face is included in the second set, the first set and the second set, where the first set after initialization is empty, and the second set after initialization is empty; and repeat the determining whether any first entity of a first face is included in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
[0029] With reference to the second aspect, in a possible design, the processing the at least two faces in the first set includes at least one of the following: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
[0030] With reference to the second aspect, in a possible design, the determining module is further configured to: determine a third set, where the third set includes at least two faces among multiple remaining faces, the multiple remaining faces are faces among the multiple faces other than faces that have been processed, and any two faces in the third set do not have a shared vertex and / or a shared edge; and, the processing module is further configured to: process the at least two faces in the third set in parallel.
[0031] With reference to the second aspect, in a possible design, the determining module and the processing module are further configured to: repeat the determining a third set and processing the at least two faces in the third set in parallel until all of the multiple faces have been processed.
[0032] With reference to the second aspect, in a possible design, the B-Rep geometricmodel includes two or more solid bodies and / or shell bodies, and the first set includes faces belonging to different solid bodies and / or shell bodies.
[0033] According to a third aspect, a computing device is provided. The computing device includes a processor and a memory. The processor of the computing device is configured to execute instructions stored in the memory of the computing device, so that the computing device performs the method according to the first aspect or any one of the possible embodiments of the first aspect.
[0034] According to a fourth aspect, a computing device cluster is provided. The computing device cluster includes at least one computing device and each computing device includes a processor and a memory. The processor of the at least one computing device is configured to execute instructions stored in the memory of the at least one computing device, so that the computing device cluster performs the method according to the first aspect or any one of the possible embodiments of the first aspect.
[0035] According to a fifth aspect, a computer-readable storage medium is provided. The computer-readable storage medium includes one or more instructions. When the one or more instructions are executed by a computing device and / or a computing device cluster, the computing device and / or the computing device cluster performs the method according to the first aspect or any one of the possible embodiments of the first aspect.
[0036] According to a sixth aspect, a computer program product including instructions is provided. When the instructions are executed by a computing device and / or a computing device cluster, the computing device and / or the computing device cluster performs the method according to the first aspect or any one of the possible embodiments of the first aspect.
[0037] This application encompasses various embodiments, including not only method embodiments, but also other embodiments such as apparatus embodiments and embodiments related to non-transitory computer readable storage media. Embodiments may incorporate, individually or in combinations, the features disclosed herein.DESCRIPTION OF DRAWINGS
[0038] FIG. 1 illustrates a schematic flowchart of a method according to an embodiment ofthis application.
[0039] FIG. 2 illustrates an example of the parallel processing applied in multiple threading pattern.
[0040] FIG. 3 illustrates a flowchart of an example of a method according to an embodiment of this application.
[0041] FIG. 4 illustrates an example of a B-Rep geometric model.
[0042] FIG. 5 illustrate an example of B-Rep topology hierarchy dependency graph.
[0043] FIG. 6 illustrates a flowchart of another example of a method according to an embodiment of this application.
[0044] FIG. 7 illustrates PTR of models processed by the method provided in this application.
[0045] FIGs. 8-11 are schematic block diagrams of possible devices according to embodiments of the present application.DESCRIPTION OF IMPLEMENTATIONS
[0046] The following describes technical solutions of the present application with reference to the accompanying drawings.
[0047] The embodiments of the present invention may be applied to B-Rep geometric model processing tasks. For example, a computer aided design (CAD) data exchange engine may be used to perform processing operations on a three-dimensional (3D) CAD model, such as one or more of the following: constructing tessellated representations, converting between different formats and / or representations, detecting and / or healing geometric problems, and / or updating attributes and / or data assigned to entities constituting the 3D CAD model.
[0048] Such processing operations may either be requested directly by a user or occupy majority of total processing time of the user’s operation. Therefore, reducing time used for such processing operations is an important goal in development of CAD software tools, as it helps provide faster feedback to the user, smoother user experience, and ability to process larger B-Rep geometric models in reasonable time.
[0049] A 3D CAD model may be defined by boundary representation (B-Rep) topology. B-Rep is a method for representing a B-Rep geometric model by a set of lower-dimension entities defining its boundary. For example, a 3D B-Rep geometric model (i.e. a 3D model defined by B-Rep topology) may be constituted by the following entities: bodies (solid or shell), faces, edges, and / or vertices. For a solid body of the 3D B-Rep geometric model, it may be represented by a set of connected faces comprising its external boundary.
[0050] When processing a 3D B-Rep geometric model, processing operations mentioned above need to be run on all or a part of entities (such as, faces, edges, vertices) of the model separately. In multi-processor, cluster and / or cloud environments, to achieve the goal of reducing time used for the above processing operations, such processing operations may be run on multiple entities of the B-Rep geometric model in parallel.
[0051] However, entities of a 3D B-Rep geometric model may have connections. For example, some edges may have shared vertices, and / or some faces may have shared edges and / or shared vertices. In this case, running processing operations on a face may not only lead to modifications of itself but also lead to modification of edges and vertices defining this face. Therefore, modifications occurred during processing multiple faces, which may affect their shared edges and / or vertices, need to be synchronized to avoid data races or inconsistent results. Such synchronization may lead to situation when parallel threads of execution block each other, which reduce efficiency of parallelization and slow down the overall processing of the B-Rep geometric model.
[0052] Therefore, how to improve efficiency of parallelization in processing the B-Rep geometric model becomes an urgent problem to be solved.
[0053] In some implementations, to avoid the above problem, only non-shared entities are processed in parallel, while shared entities are processed in sequence. Such solution may result in a decrease in the degree of parallel processing, which may slow down the overall processing of the B-Rep geometric model.
[0054] In some other implementations, sequence of processing multiple entities and entities can be processing in parallel may be determined based on B-Rep topology hierarchy dependency graph. Such solution may achieve good parallel processing results, but it will result in high overhead costs in the following aspects: synchronization of modifications to shared edges and vertices, generation of data structures to determine the processing sequence of faces,and / or restoration of hierarchical connections considering changes in shared entities.
[0055] Therefore, this application provides a method for processing B-Rep geometric model. This method involves processing the faces included in a body in sets of independent faces. Such independent faces in each set do not share edges and vertices, thus faces in the same set can be processed in parallel without additional synchronization.
[0056] FIG. 1 illustrates a schematic flowchart of a method 100 according to an embodiment of this application. The method 100 may be applied to data exchange engine, for example a 3D CAD data exchange software development kit (SDK) and / or a 3D CAD data exchange platform.
[0057] It should be noted that the method 100 can also be used in any software application that performs modification of data associated with faces, edges, and vertices of 3D solid or shell models defined by the B-Rep topology. The following text take application in the data exchange engine as an example to explain. The data exchange engine can also be referred to as an engine in the following text.
[0058] At step 110, the engine obtains a to-be-processed B-Rep geometric model.
[0059] The to-be-processed B-Rep geometric model may be a 3D B-Rep geometric model. For a 3D B-Rep geometric model, the B-Rep geometric model needs to meet the following requirements.
[0060] The B-Rep geometric model may include one or more bodies. Each body may include one or more faces, and the B-Rep geometric model includes multiple faces in general case. However, different bodies shall not have shared faces, edges, and / or vertices. The bodies included in the B-Rep geometric model may include solid bodies and / or shell bodies.
[0061] If different faces, edges and / or vertices share a common geometry, such common geometry shall not be modified by processing operations. However, such common geometry can be replaced by new geometries by creating a new instance of geometry for each entity.
[0062] If an operation is processed in parallel on the level of assembly or other aggregation where the same body can be encountered more than once, such operation must ensure that each body is processed only once.
[0063] It should be noted that the B-Rep geometric model is not limited to the 3D B-Rep geometric model. The B-Rep geometric model may be a 2D model or other types of B-Repgeometric models, which is not limited in this application. For example, the B-Rep geometric model may be a 2D model formed by splicing multiple faces located on the same plane.
[0064] At step 120, the engine determines a first set.
[0065] The first set includes at least two faces among the multiple faces of the B-Rep geometric model. The at least two faces in the first set are faces to be processed in parallel. The at least two faces in the first set should not share any lower-dimension entities. For a face, its lower-dimension entities may include vertices and / or edges. That is, any two of the at least two faces do not have a shared vertex and / or a shared edge.
[0066] It should be noted that, in some implementations, the condition that any two of the at least two faces do not share a vertex may be a necessary and sufficient condition to ensure that the at least two faces can be processed in parallel. In some implementations, the condition that any two of the at least two faces do not share an edge may be also a necessary and sufficient condition to ensure that the at least two faces can be processed in parallel. The above implementations can be, for example, the case where each edge of the B-Rep geometric model has at least a vertex. However, in some other implementations, a B-Rep geometric model may have one or more closed edges which have no vertices. In this case, such closed edges without vertices should be considered with other vertices of the model. That is, in such implementations, the necessary and sufficient condition to ensure that the at least two faces can be processed in parallel may be that any two of the at least two faces neither share a vertex nor a closed edge.
[0067] It should be noted that, unless otherwise specified, terms “set” and “group” can be used interchangeably in this application.
[0068] In some implementations, the at least two faces in the first set may be faces belonging to the same solid body or the same shell body. For example, the engine may select faces to be processed in parallel from one of bodies of the B-Rep geometric model.
[0069] In some other implementations, the at least two faces in the first set may include faces belonging to different solid bodies and / or shell bodies. For example, the engine may select faces to be processed in parallel from all faces of all bodies of the B-Rep geometric model.
[0070] In some embodiments of this application, the at least two faces to be processed in parallel can be selected according to a set of vertices and / or edges of the B-Rep geometric model. For example, the engine may obtain a second set, where the second set includes multipleiovertices and / or edges of the B-Rep geometric model. It should be noted that the elements of the second set are entities used to determine whether two faces are connected. For example, in some implementations, all elements of the second set may be vertices of the model. For another example, in some implementations, all elements of the second set may be edges of the model. For another example, in some implementations, all elements of the second set may include both vertices and edges of the model.
[0071] The engine may determine the first set according to the second set. As mentioned above, all elements in the first set are faces of the model. Each element of the first set corresponds to a subset of the second set. That is, all elements in each subset of the second set are vertices and / or edges of the corresponding face (i.e. corresponding element in the first set). For example, if all elements in the second set are vertices of the model, for a face including three vertices, the subset corresponds to this face may include three elements representing the three vertices of this face. For another example, if all elements in the second set are vertices and closed edges of the model, for a face including a closed edge and no vertex, the subset corresponds to this face may include an element representing the closed edge of this face. Furthermore, in some implementations, an intersection of subsets corresponding to any two faces in the first set is empty. Thus, the faces corresponding to elements in the second set are faces that are not connected to each other.
[0072] In some embodiments of this application, the second set may include all first entities of the B-Rep geometric model.. The first entity is a lower-dimension entity used to determine whether two faces are connected. The all first entities of the B-Rep geometric model refer to all lower-dimension entity of the B-Rep geometric model used to determine whether two faces are connected. For example, vertices are used to determine whether two faces are connected, then the first entity only includes vertices. For another example, if edges and vertices are used together to determine whether two faces are connected, then the first entity includes both edges and vertices. Therefore, the engine may select faces to be processed in parallel as many as possible, until no more faces can be selected for parallel processing with the selected faces.
[0073] For example, the engine may determine whether any first entity of a first face is included in the second set, where the first face is a face among the multiple faces of the B-Rep geometric model. If all first entities of the first face are determined not to be included in thensecond set, the engine may add a elements representing the first face into the first set, and then, add one or more elements representing first entities of the first face into the first set. In other words, if any first entity of the first face is determined to be included in the second set, the first face will not be added into the first set, and first entities of the first face (except for those have already included in the second set) will not be added into the second set.
[0074] Optionally, before determining whether any first entity of a first face is included in the second set, the engine may initialize the first set and the second set as empty. For example, the engine may create an empty set as the first set and / or create an empty set as the second set. For another example, the engine may clear elements in the existing first set and / or clear elements in the existing second set.
[0075] Optionally, the determining whether any first entity of a first face is included in the second set can be executed in a loop. For example, the engine may repeat the determining whether any first entity of a first face is included in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
[0076] At step 130, the engine processes the at least two faces in the first set in parallel.
[0077] For example, the engine processes all faces in the first set, which are selected at step 120, in parallel.
[0078] When the method 100 is applied to systems on different levels, the parallel processing may be implemented in different ways. For example, for a system on the level of central processing unit (CPU), the at least two faces selected as S120 may be processed simultaneously by a corresponding number of execution threads, or CPU cores, or CPUs. For another example, for a system on the level of cluster, the at least two faces may be processed simultaneously by a corresponding number of computing devices in the cluster. For another example, for a system on the level of cloud, the at least two faces may be processed simultaneously by a corresponding number of servers.
[0079] The parallel processing to the at least two faces may include but not be limited to: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
[0080] According to the above technical solution, there is no connection between any two faces among two or more faces processed in parallel. Thereby, modification occurred during processing of one face does not need to be synchronized with other faces being processed in parallel, which may avoid parallel execution threads from blocking each other. Thus, efficiency of parallelization in processing the B-Rep geometric model can be improved and the overall processing of the B-Rep geometric model can be accelerated.
[0081] In some embodiments of this application, the steps S120 and S130 can be repeated to continue select faces to be processed from remaining faces of the B-Rep geometric model. For example, after the above step S130, the engine may determine a third set comprising at least two faces among multiple remaining faces of the B-Rep geometric model, where any two of the at least two remaining faces do not have a shared vertex and / or a shared edge. The multiple remaining faces are faces other than the at least two faces selected in the above step S 120 among the multiple faces of the B-Rep geometric model. Then the engine may process the at least two remaining faces in parallel.
[0082] Optionally, the determining a third set and processing the at least two faces in the third set in parallel can be repeated until all of the multiple faces have been processed. Thus, the method can be iteratively executed to complete processing of the entire B-Rep geometric model.
[0083] FIG. 2 illustrates an example of the parallel processing applied in multiple threading pattern. As shown in FIG. 2, essential part of the operation may be executed in parallel, utilizing all or most of the available CPUs. There are several batches of parallel execution interleaved by short synchronization periods (not parallel), the number of such batches is equal or greater than degree of connectivity of the B-Rep geometric model being processed. During each parallel batch phase, different threads do not block each other because there is no need for synchronization between threads executed in parallel. Threads executed in parallel within all batch phases may run the same operation.
[0084] An overall procedure of the method provided in this application is illustrated with FIG. 1. In conjunction with FIGs. 3-5 below, the method provided in this application will be explained in detail using an embodiment as an example.
[0085] FIG. 3 illustrates a flowchart of an example of a method according to an embodimentof this application. As shown in FIG. 3, the processing of each body in a B-Rep geometric model may be organized as follows.
[0086] At step 1, a set of all faces of the body, which can be named as “faces”, is constructed. In initial state, elements in the set “faces” correspond one-to-one with all faces of the model. When the set “faces” is not empty, the following steps 2 to 6 are looped through.
[0087] At step 2, a set of faces to be processed, which can be named as “faces_to_proc”, and a set of their vertices, which can be named as “vertices listed”, are initialized to empty. That is, if there are currently no such two sets, two empty sets named “faces_to_proc” and “vertices listed” are created respectively. If there are such two sets, for example, if they have already been created in a previous loop, then these two sets are reset to empty.
[0088] At step 3, the set “faces” is iterated. That is, elements currently in the set “faces” are traversed. For each element (named as “face” in FIG. 3) in the set “faces”, it is determined whether vertices of face corresponding to this element already exists in the set “vertices listed”. If the set “vertices listed” does not include any element corresponding any vertex of a face, an element corresponding to such face will be added in the set “faces_to_proc”. Then, elements corresponding to all vertices of this face will be added in the set “vertices listed”, and the element corresponding to such face will be removed from the set “face”.
[0089] At step 4, faces corresponding to all element collected in the set “faces_to_proc” are processed in parallel.
[0090] At step 5 (not shown in FIG. 3), optionally, results of processing can be collected and remaining elements in the set “faces” can be updated to account for changes made in step 4.
[0091] At step 6, it is determined whether the set “faces” is empty after step 5. If not, steps 2 to 6 are repeat.
[0092] FIG. 4 is an example of a B-Rep geometric model and FIG. 5 illustrate a B-Rep topology hierarchy dependency graph of this B-Rep geometric model. In this B-Rep geometric model, “A” is used to represent aggregation entity which is composed of one of more bodies. “B” is used to represent body entities which are associated with one of more faces. “F” is used to represent face entities which are associated with one of more edges. “E” is used to represent edge entities which associated with one of more vertices. “V” is used to represent vertex entities.The graph links shown in FIG. 5 indicate dependency relation between entities and are directed from higher level to lower level of B-Rep topology hierarchy (higher level entities depend on, or are built upon, lower level entities).
[0093] Taking the B-Rep geometric model shown in FIG. 4 as an example, according to the above algorithm shown in FIG. 3, faces belonging to Bi will be processed in two iterations of the loop. First, a group of faces {Fn, FB, FU} will be processed in parallel. Then, a group of faces {F12, F15} will be processed in parallel after the group {Fn, F13, F14}. Within B2, faces will be processed in three iterations of the outer loop. First, a group of faces {F21, F25} will be processed in parallel. Then a group of faces {F22, F24} will be processed in parallel. Finally, a group of faces {F23, F26} will be processed in parallel.
[0094] It should be noted that, in the example shown in FIG. 4, all edges have at least one vertex. So, in such example, currently processed face does not have common vertices with faces already listed in the group to be processed (i.e. the set “faces_to_proc” shown in FIG. 3) is necessary and sufficient to ensure that faces in the group do not share common entities (i.e. edges and vertices). However, for B-Rep geometric model where closed edges may have no vertices, such edges should be also considered in the above algorithm shown in FIG. 3.
[0095] FIG. 6 illustrates a flowchart of another example of a method according to an embodiment of this application. The algorithm shown in FIG. 6 can be applied to open CASCADE technology (OCCT).
[0096] As shown in FIG. 6, for processing faces in the parallel mode, an auxiliary class (denoted by “Manager”) is used. The “Manager” may create an instance of tool class named “ShapeFix Face” for each face to avoid locking during processing faces. After each batch of fixes, such class may update current states of all faces in the shell.
[0097] To exclude unnecessary duplication of data, a dynamic array (named as “faces idxs”) of indexes of the face array elements can be responsible for listing in faces in the same group for processing in parallel. The container “faces idxs” in the “Manager” may be cleared after parallel processing of all faces from the group is completed. In other word, after the outer loop iteration begins, the set “faces to proc” does not need to be created as shown in FIG. 3. Furthermore, to exclude faces from the general set of faces (i.e. the purpose of step 3 of example shown in FIG. 3), there is an additional unordered set data structure to store indices of facesobjects that have already gone through the processing process. Thus, processed faces may not be directly removed from the dynamic array. To organize storage of a set of the updated vertices (i.e. the purpose of “vertices listed” shown in FIG. 3) and quick access to them, a hash set data structure (not shown in FIG. 6) may be used in this example.
[0098] To store changes made during the processing of each face in the group, the object “Manager” may store a container named “modifications”, through which all faces that have been processed in the faces array, as well as all contained sub-entities, can be updated to the current state.
[0099] The object “Manager” may also contain information of thread local operator and data of modifications on B-Rep topology elements happened within this thread while processing faces. Such information is stored in form of dynamic arrays named “operator”. The “operator”, as entities, are responsible for directly processing the face and the lower topological entities contained in it (edges, vertices), as well as for registering changes in the entities of the B-Rep geometric model into modifications.
[0100] To parallelize the execution of face heeling processing tasks, the thread pool pattern of the native implementation of the OCCT kernel is used in this example.
[0101] In some implementations, the parallelization of face heeling processing tasks can also be applied to other technology, which is not limited in this application.
[0102] For example, threading building blocks (TBB) product can be used to parallelize the healing of faces process. That is, TBB parallelization machineries may be used to substitute the OCCT thread pool mentioned in the above example. Operator objects can be stored for each thread and be accessed from the corresponding thread using the TBB functionality, instead of standard data structures. Furthermore, unordered hash map data structure with face’s index keys of integer type and values the faces itself may be used to replace the dynamic array faces container of “Manager”.
[0103] The method provided in this application is tested in the data exchange engine (iDEE) product where parallel processing of faces is used on the stage of healing of the B-Rep geometric model after translation from external CAD file. FIG. 7 illustrated values of restoring time ratio (PTR), which can be defined as follows:
[0105] where 7 is restoring time of 3D model with proposed solution (i.e. method provided in this application), and T2is restoring time of 3D model with predecessor’s solution. The predecessor is a previous method used in the iDEE product used for testing.
[0106] As shown in FIG. 7, a total of 71 3D models were involved in the comparison. The mean PTR of the 71 models is 0.87, which means the method provided in this application saves an average of 17% of time in restoring 3D models. Up to 60% of time in restoring a 3D model is saved by the method provided in this application (the test model with index of 24). Furthermore, the median PTR of the 71 models is 0.83. That is, the method provided in this application can save time of restoring for most tested models, and in a few cases, it leads to small degradation of performance which is however quite negligible (within 5%).
[0107] To sum up, efficiency of parallelization in processing the B-Rep geometric model can be improved according to the method provided in this application.
[0108] The method according to the embodiments of the present application is described in detail above, and the apparatus according to the embodiments of the present application will be described below with reference to FIGs. 8-11. The apparatus described below is capable of performing the methods described in the embodiments of the present application. For brevity, the repeated description is appropriately omitted when introducing the apparatus in the embodiments of the present application.
[0109] FIG. 8 is a schematic block diagram of an apparatus 800 according to an embodiment of the present application. The apparatus 800 shown in FIG. 8 may be used to perform the methods shown in FIG. 1.
[0110] As shown in FIG. 8, the apparatus 800 includes:
[0111] an obtaining module 810, configured to obtain a to-be-processed B-Rep geometric model, where the B-Rep geometric model includes multiple faces;
[0112] a determining module 820, configured to determine a first set, where the first set includes at least two faces among the multiple faces, any two faces in the first group do not have a shared vertex and / or a shared edge; and
[0113] a processing module 830, configured to process the at least two faces in the first setin parallel.
[0114] Optionally, the determining module 820 is configured to: obtain the first set and a second set, where the second set includes multiple first entities of the B-Rep geometric model, the first entity includes vertex and / or edge, each face in the first set corresponds to a subset of the second set, the subset includes all first entities of a corresponding face.
[0115] Optionally, the second set includes all first entities of the B-Rep geometric model.
[0116] Optionally, the determining module 820 is configured to: determine whether any first entity of a first face is included in the second set, where the first face is a face among the multiple faces of the B-Rep geometric model; if all first entities of the first face are determined not to be included in the second set, add the first face into the first set; and add all first entities of the first face into the second set.
[0117] Optionally, the determining module 820 is further configured to: initialize, before the determining whether any first entity of a first face is included in the second set, the first set and the second set, where the first set after initialization is empty, and the second set after initialization is empty; and repeat the determining whether any first entity of a first face is included in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
[0118] Optionally, the processing the at least two faces in the first set includes at least one of the following: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
[0119] Optionally, the determining module 820 is further configured to: determine a third set, where the third set includes at least two faces among multiple remaining faces, the multiple remaining faces are faces among the multiple faces other than faces that have been processed, and any two faces in the third set do not have a shared vertex and / or a shared edge; and the processing module 830 is further configured to: process the at least two faces in the third set in parallel.
[0120] Optionally, the determining module 820 and the processing module 830 are further configured to: repeat the determining a third set and processing the at least two faces in the thirdset in parallel until all of the multiple faces have been processed.
[0121] Optionally, the B-Rep geometric model includes two or more solid bodies and / or shell bodies, and the first set includes faces belonging to different solid bodies and / or shell bodies.
[0122] The specific description can refer to the methods mentioned earlier, and will not be repeated here.
[0123] The term "module" herein may be implemented in software and / or hardware without specific limitation. For example, a "module" may be a software program, a hardware circuit, or a combination of the above functions. The determining module 820 is taken as an example. The implementation of the determining module 820 will be introduced. Similarly, the implementation of other modules can refer to the implementation of the determining module 820.
[0124] As an example of a software functional unit, the determining module 820 may include code running on a computing instance. The computing instance may include at least one of a physical host (computing device), a virtual machine, or a container. Furthermore, the above computing instance can be one or more. For example, the determining module 820 may include code running on multiple hosts / virtual machines / containers. Multiple hosts / virtual machines / containers used to run the code may be distributed in the same region or in different regions. Furthermore, multiple hosts / virtual machines / containers used to run the code may be distributed within the same availability zone (AZ) or across different AZs, each of which includes a data center or multiple geographically close data centers. Typically, a region may include multiple AZs.
[0125] Similarly, multiple hosts / virtual machines / containers used to run the code may be distributed within the same virtual private cloud (VPC) or across multiple VPCs. One VPC may be set within a region, and communication between two VPCs within the same region, as well as cross regional communication between VPCs from different regions, requires a communication gateway to be set up within each VPC to achieve interconnection between VPCs.
[0126] As an example of a hardware functional unit, the determining module 820 may include at least one computing device, such as a server, etc. Alternatively, the determiningmodule 820 may also be a device implemented using application specific integrated circuits (ASICs) or programmable logic devices (PLDs). The above mentioned PLD can be a complex programmable logic device (CPLD), field programmable gate array (FPGA), general array logic (GAL), or any combination thereof.
[0127] The determining module 820 includes multiple computing devices that can be distributed in the same region or in different regions. The determining module 820 includes multiple computing devices that can be distributed within the same AZ or across different AZs. Similarly, the determining module 820 includes multiple computing devices that can be distributed within the same VPC or across multiple VPCs. The multiple computing devices can be any combination of computing devices such as servers, ASICs, PLDs, CPLDs, FPGAs, and GALs.
[0128] In other embodiments, the obtaining module 810 can be used to execute any step in the method for processing B-Rep geometric model, the determining module 820 can be used to execute any step in the method for processing B-Rep geometric model, and the processing module 830 can be used to execute any step in the method for processing B-Rep geometric model. The steps responsible for implementing each module can be specified as needed, and different steps in the method for processing B-Rep geometric model can be implemented by each module to achieve all functions of the apparatus 800.
[0129] The present application also provides a computing device 1000. As shown in FIG.9, the computing device 1000 includes: bus 1002, processor 1004, memory 1006, and communication interface 1008. The processor 1004, memory 1006, and communication interface 1008 communicate through bus 1002. The computing device 1000 can be a server or terminal device. It should be understood that the present application does not limit the number of processors and memory in the computing device 1000.
[0130] Bus 1002 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. Buses can be divided into address buses, data buses, control buses, etc. For ease of representation, only one line is used in FIG. 9, but it does not mean that there is only one bus or one type of bus. Bus 1002 may include pathways for transmitting information between various components of computing device 1000 (such as memory 1006, processor 1004, communication interface 1008).
[0131] Processor 1004 may include any one or more of a central processing unit (CPU), graphics processing unit (GPU), microprocessor (MP), or digital signal processor (DSP).
[0132] Memory 1006 may include volatile memory, such as random access memory (RAM). Processor 1004 may also include non-volatile memory, such as read-only memory (ROM), flash memory, hard disk drive (HDD), or solid state drive (SSD).
[0133] Memory 1006 stores executable program code, and processor 1004 executes the executable program code to respectively implement the functions of the obtaining module 810, the determining module 820 and the processing module 830, thereby realizing the method for processing B-Rep geometric model. That is to say, instructions for executing the method for processing B-Rep geometric model are stored on memory 1006.
[0134] Communication interface 1008 uses transceiver modules such as but not limited to network interface cards and transceivers to achieve communication between computing device 1000 and other devices or communication networks.
[0135] The embodiment of the present application also provides a computing device cluster. The computing device cluster includes at least one computing device. The computing device can be a server, such as a central server, an edge server, or a local server in a local data center. In some embodiments, the computing device may also be a terminal device such as a desktop computer, laptop, or smartphone.
[0136] As shown in FIG. 10, the computing device cluster includes at least one computing device 1000. Memory 1006 in one or more computing devices 1000 in a computing device cluster may store the same instructions for executing the method for processing B-Rep geometric model.
[0137] In some possible implementations, memory 1006 of one or more computing devices 1000 in the computing device cluster may also store partial instructions for executing the method for processing B-Rep geometric model. In other words, a combination of one or more computing devices 1000 can jointly execute instructions for executing the method for processing B-Rep geometric model.
[0138] Memory 1006 in different computing devices 1000 in the computing device cluster can store different instructions, which are respectively used to execute some functions of the apparatus for processing B-Rep geometric model. That is to say, the instructions stored inmemory 1006 of different computing devices 1000 may realize the functions of one or more modules in the obtaining module 810, the determining module 820 and the processing module 830.
[0139] In some possible implementations, one or more computing devices in a computing device cluster may be connected through a network. The network can be a wide area network, a local area network, or the like.
[0140] FIG. 11 illustrates a possible implementation. As shown in FIG. 11, two computing devices 1000 A and 1000B are connected through a network. Specifically, computing devices 1000 A and 1000B are connected to the network through communication interfaces in various computing devices. In the possible implementation, memory 1006 in the computing device 1000 A stores instructions to execute the function of the obtaining module 810 and the determining module 820. Meanwhile, memory 1006 in computing device 1000B stores instructions to execute the functions of the processing module 830.
[0141] An embodiment of the present application further provides a computer program product. When the instructions are executed by a computing device cluster, the computing device cluster performs any of the foregoing methods.
[0142] An embodiment of the present application further provides a computer-readable storage medium, storing one or more instructions. When the one or more instructions are executed by a computing device cluster, the computing device cluster performs any of the foregoing methods.
[0143] A person of ordinary skill in the art will be aware that, in combination with the examples described in the embodiments disclosed in this specification, units and algorithm steps may be implemented by using electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed by using hardware or software depends on particular applications and design constraint conditions of the technical solutions. A person skilled in the art may use different methods to implement the described functions for each particular application, but it should not be considered that the embodiment goes beyond the scope of the present application.
[0144] It would be understood by a person skilled in the art that, for the purpose of convenience and brevity, in a detailed working process of the foregoing system, apparatus, andunit, reference may be made to a corresponding process in the foregoing method embodiments, and details are not described herein again.
[0145] In the several embodiments provided in the present application, the disclosed system, apparatus, and method may be implemented in other manners. For example, the described apparatus embodiment is merely an example. For example, the unit division is a logical function division and other methods of division may be used in an actual embodiment. For example, a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented using various communication interfaces. The indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
[0146] The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, that is, the parts may be located in one unit, or may be distributed among a plurality of network units. Some or all of the units may be selected based on actual requirements to achieve the objectives of the embodiments.
[0147] In addition, function units in the embodiments of the present application may be integrated into one processing unit, each of the units may exist alone physically, or two or more units may be integrated into one unit.
[0148] When the functions are implemented in the form of a software functional unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. The technical solutions of the present application may be implemented in the form of a software product. The software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, a network device, or the like) to perform all or some of the steps of the methods described in the embodiments of the present application. The foregoing storage medium includes any medium that can store program code, such as a USB flash drive, a removable hard disk, a readonly memory (ROM), a random access memory (RAM), a magnetic disk, an optical disc or the like.
[0149] The foregoing descriptions are merely specific embodiments of the present application, but are not intended to limit the protection scope of the present application. Anyvariation or replacement readily figured out by a person skilled in the art within the technical scope disclosed in the present application shall fall within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
[0150] In the present disclosure, the terms “a” or “an” are defined to mean “at least one”, that is, these terms do not exclude a plural number of items, unless stated otherwise.
[0151] In the present disclosure, terms such as “substantially”, “generally” and “about”, which modify a value, condition or characteristic of a feature of an example embodiment, should be understood to mean that the value, condition or characteristic is defined within tolerances that are acceptable for the proper operation of the example embodiment for its intended application.
[0152] In the present disclosure, expressions such as “match”, “matching” and “matched”, including variants and derivatives thereof, are intended to refer herein to a condition in which two or more elements are either the same or within some predetermined tolerance of each other. That is, these terms are meant to encompass not only “exactly” or “identically” matching the two elements but also “substantially”, “approximately” or “subjectively” matching the two or more elements, as well as providing a higher or best match among a plurality of matching possibilities.
[0153] In the present disclosure, the expression “based on” is intended to mean “based at least partly on”, that is, this expression can mean “based solely on” or “based partially on”, and so should not be interpreted in a limited manner. More particularly, the expression “based on” could also be understood as meaning “depending on”, “representative of’, “indicative of’, “associated with” or similar expressions.
[0154] In the present disclosure, "at least one" means one or more, and "a plurality of means two or more. The term "and / or" describes an association relationship of associated objects, and indicates that three relationships may exist. For example, A and / or B may indicate the following three cases: Only A exists, both A and B exist, and only B exists, where A and B may be singular or plural. The character " / " indicates an "or" relationship between associated objects. "At least one of the following items (pieces)" or a similar expression thereof indicates any combination of these items, including a single item (piece) or any combination of a pluralityof items (pieces). For example, "at least one of A, B, or C" includes: only A; only B; only C; A and B; A and C; B and C; or A, B, and C, and "at least one of A, B, and C" may also be understood as including: only A; only B; only C; A and B; A and C; B and C; or A, B, and C. In addition, unless otherwise specified, ordinal numbers such as "first" and "second" in embodiments of this application are used to distinguish between a plurality of objects, and are not used to limit a sequence, a time sequence, priorities, or importance of the plurality of objects.
[0155] A person skilled in the art should understand that embodiments of this application may be provided as a method, an apparatus (or system), computer-readable storage medium, or a computer program product. Therefore, this application may use a form of a hardware-only embodiment, a software-only embodiment, or an embodiment with a combination of software and hardware. Moreover, this application may use a form of a computer program product that is implemented on one or more computer-usable storage media (including but not limited to a disk memory, an optical memory, and the like) that include computer-usable program code.
[0156] This application is described with reference to the flowcharts and / or block diagrams of the method, the device (system), and the computer program product according to this application. It should be understood that computer program instructions may be used to implement each process and / or each block in the flowcharts and / or the block diagrams and a combination of a process and / or a block in the flowcharts and / or the block diagrams. The computer program instructions may be provided for a general -purpose computer, a dedicated computer, an embedded processor, or a processor of another programmable data processing device and enable a machine to execute the instructions. When executed by any computer or the processor of a programmable data processing device, the instructions cause the apparatus to implement specific functions as described in one or more procedures in the flowcharts and / or one or more blocks in the block diagrams. The computer program instructions may alternatively be stored in a computer-readable memory that can indicate a computer or another programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specific function in one or more procedures in the flowcharts and / or one or more blocks in the block diagrams.
[0157] The computer program instructions may alternatively be loaded onto a computer oranother programmable data processing device, so that a series of operations and steps are performed on the computer or the another programmable device, so that computer-implemented processing is generated. Therefore, the instructions executed on the computer or on another programmable device provide steps for implementing specific functions as described in one or more procedures in the flowcharts and / or one or more blocks in the block diagrams.
[0158] It is clear that a person skilled in the art can make various modifications and variations to this application without departing from the scope of this disclosure. This disclosure is intended to cover these modifications and variations of this application provided that they fall within the scope of protection defined by the following claims and their equivalent technologies.
[0159] The present disclosure encompasses various embodiments, including not only method embodiments, but also other embodiments such as apparatus embodiments and embodiments related to non-transitory computer readable storage media. Embodiments may incorporate, individually or in combinations, the features disclosed herein.
[0160] Although this disclosure refers to illustrative embodiments, this is not intended to be construed in a limiting sense. Various modifications and combinations of the illustrative embodiments, as well as other embodiments of the disclosure, will be apparent to persons skilled in the art upon reference to the description.
[0161] Features disclosed herein in the context of any particular embodiments may also or instead be implemented in other embodiments. Method embodiments, for example, may also or instead be implemented in apparatus, system, and / or computer program product embodiments. In addition, although embodiments are described primarily in the context of methods and apparatus, other implementations are also contemplated, as instructions stored on one or more non-transitory computer-readable media, for example. Such media could store programming or instructions to perform any of various methods consistent with the present disclosure.
Claims
CLAIMSWhat is claimed is:
1. A method for processing boundary representation B-Rep geometric model, comprising: obtaining a to-be-processed B-Rep geometric model, wherein the B-Rep geometric model comprises multiple faces;determining a first set, wherein the first set comprises at least two faces among the multiple faces, any two faces in the first set do not have a shared vertex and / or a shared edge; and processing the at least two faces in the first set in parallel.
2. The method according to claim 1, wherein the determining a first set comprises: obtaining the first set and a second set, wherein the second set comprises multiple first entities of the B-Rep geometric model, the first entity comprises vertex and / or edge, each face in the first set corresponds to a subset of the second set, the subset comprises all first entities of a corresponding face.
3. The method according to claim 2, wherein the second set comprises all first entities of the B-Rep geometric model.
4. The method according to claim 2 or 3, wherein the obtaining the first set and a second set comprises:determining whether any first entity of a first face is comprised in the second set, wherein the first face is a face among the multiple faces of the B-Rep geometric model;if all first entities of the first face are determined not to be comprised in the second set, adding the first face into the first set; andadding all first entities of the first face into the second set.
5. The method according to claim 4, wherein the obtaining the first set and a second set further comprises:initializing, before the determining whether any first entity of a first face is comprised in the second set, the first set and the second set, wherein the first set after initialization is empty, and the second set after initialization is empty; andrepeating the determining whether any first entity of a first face is comprised in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
6. The method according to any one of claims 1 to 5, wherein the processing the at least two faces in the first set comprises at least one of the following: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
7. The method according to any one of claims 1 to 6, wherein after the processing the at least two faces in the first set in parallel, the method further comprises:determining a third set, wherein the third set comprises at least two faces among multiple remaining faces, the multiple remaining faces are faces among the multiple faces other than faces that have been processed, and any two faces in the third set do not have a shared vertex and / or a shared edge; and,processing the at least two faces in the third set in parallel.
8. The method according to claim 7, wherein the method further comprises: repeating the determining a third set and processing the at least two faces in the third set in parallel until all of the multiple faces have been processed.
9. The method according to any one of claims 1 to 8, wherein the B-Rep geometric model comprises two or more solid bodies and / or shell bodies, and the first set comprises faces belonging to different solid bodies and / or shell bodies.
10. An apparatus for processing boundary representation B-Rep geometric model, comprising:an obtaining module, configured to obtain a to-be-processed B-Rep geometric model, wherein the B-Rep geometric model comprises multiple faces;a determining module, configured to determine a first set, wherein the first set comprises at least two faces among the multiple faces, any two faces in the first set do not have a shared vertex and / or a shared edge; anda processing module, configure to process the at least two faces in the first set in parallel.
11. The apparatus according to claim 10, wherein the determining module is configured to:obtain the first set and a second set, wherein the second set comprises multiple first entities of the B-Rep geometric model, the first entity comprises vertex and / or edge, each face in thefirst set corresponds to a subset of the second set, the subset comprises all first entities of a corresponding face.
12. The apparatus according to claim 11, wherein the second set comprises all first entities of the B-Rep geometric model.
13. The apparatus according to claim 11 or 12, wherein the determining module is configured to:determine whether any first entity of a first face is comprised in the second set, wherein the first face is a face among the multiple faces of the B-Rep geometric model;if all first entities of the first face are determined not to be comprised in the second set, add the first face into the first set; andadd all first entities of the first face into the second set.
14. The apparatus according to claim 13, wherein the determining module is further configured to:initialize, before the determining whether any first entity of a first face is comprised in the second set, the first set and the second set, wherein the first set after initialization is empty, and the second set after initialization is empty; andrepeat the determining whether any first entity of a first face is comprised in the second set until each face among the multiple faces of the B-Rep geometric model is determined.
15. The apparatus according to any one of claims 10 to 14, wherein the processing the at least two faces in the first set comprises at least one of the following: constructing tessellated representations of the at least two faces, converting the at least two faces between different formats and / or representations, detecting and / or healing geometric problems of the at least two faces, or updating attributes and / or data assigned to the at least two faces.
16. The apparatus according to any one of claims 10 to 15, wherein the determining module is further configured to:determine a third set, wherein the third set comprises at least two faces among multiple remaining faces, the multiple remaining faces are faces among the multiple faces other than faces that have been processed, and any two faces in the third set do not have a shared vertex and / or a shared edge; and,the processing module is further configured to:process the at least two faces in the third set in parallel.
17. The apparatus according to claim 16, wherein the determining module and the processing module are further configured to:repeat the determining a third set and processing the at least two faces in the third set in parallel until all of the multiple faces have been processed.
18. The apparatus according to any one of claims 10 to 17, wherein the B-Rep geometric model comprises two or more solid bodies and / or shell bodies, and the first set comprises faces belonging to different solid bodies and / or shell bodies.
19. A computing device cluster comprising at least one computing device, wherein each computing device comprises a processor and a memory, the processor of the at least one computing device is configured to perform instructions stored in the memory of the at least one computing device to enable the computing device cluster to perform the method according to any one of claims 1 to 9.
20. A computer-readable storage medium having instructions stored thereon which, when executed by a computing device or a computing device cluster, cause the computing device or the computing device cluster to perform the method of any one of claims 1 to 9.
21. A computer program product storing instructions which, when executed, cause a computing device or a computing device cluster to perform the method of any one of claims 1 to 9.
