Merging of modeled objects
First Claim
Patent Images
1. A computer-implemented method of collaborative design for merging a first modeled object with a second modeled object wherein the first and second modeled objects are modified copies of an initial modeled object, wherein the first modeled object, the second modeled object and the initial modeled object are CAD three-dimensional modeled objects defined respectively by an initial graph (A), a first graph (B) and a second graph (B′
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
) are boundary representation graphs or history graphs, wherein the method comprises;
providing the initial modeled object;
providing a respective copy of the initial modeled object to each of a first user and a second user,with at least one processor;
performing, by the first user, a design modification on the copy of the initial modeled object respective to the first user, thereby providing the first modeled object,performing, by the second user, a design modification on the copy of the initial modeled object respective to the second user, the design modification performed by the second user being different from the design modification performed by the first user, thereby providing the second modeled object,computing a first double push-out graph rewriting rule and a second double push-out graph rewriting rule, the first double push-out graph rewriting rule and the second double push-out graph rewriting rule corresponding respectively to a transformation of the initial graph (A) into the first graph (B) and the second graph (B′
),wherein the first double push-out graph rewriting rule specifies a first part (L) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the first graph (B), a first replacement (R) to replace the first part (L), a first interface (G) between the first part (L) and the first replacement (R), first morphisms from the first interface (G) to the first part (L) and to the first replacement (R) respectively, andwherein the second double push-out graph rewriting rule specifies a second part (L′
) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the second graph (B′
), a second replacement (R′
) to replace the second part (L′
), a second interface (G′
) between the second part (L′
) and the second replacement (R′
), second morphisms from the second interface (G′
) to the second part (L′
) and to the second replacement (R′
) respectively;
assembling the first rewriting rule and the second rewriting rule to determine and provide a third double push-out graph rewriting rule,wherein the third double push-out graph rewriting rule specifies an assembled part ({tilde over (L)}) which is an assembly of the first part (L) and the second part (L′
), an assembled replacement ({tilde over (R)}) which is an assembly of the first replacement (R) and the second replacement (R′
), an assembled interface ({tilde over (G)}) which is an assembly of the first interface (G) and the second interface (G′
), assembled morphisms from the assembled interface ({tilde over (G)}) to the assembled part ({tilde over (L)}) and the assembled replacement ({tilde over (R)}) respectively, wherein an assembly of elements of the first and second rewriting rules consists, for each element, of a gathering of constituents of the element of the first rewriting rule with constituents of the element of the second rewriting rule;
computing a merged graph (Ã
) by applying the third double push-out graph rewriting rule to the initial graph (A), wherein the merged graph is translated in a merged modeled object.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer-implemented method for merging a first and second modeled object which are modified versions of an initial modeled object and are defined by a first and second graphs. The method comprises merging the first graph and the second graph. For this, the method comprises computing a first rewriting rule and a second rewriting rule corresponding respectively to a transformation of an initial graph into the first graph and the second graph, determining a third rewriting rule by assembling the first rewriting rule and the second rewriting rule, and computing a merged graph by applying the third rewriting rule to the initial graph. Such a method is an improvement for the merging of modeled objects.
24 Citations
13 Claims
-
1. A computer-implemented method of collaborative design for merging a first modeled object with a second modeled object wherein the first and second modeled objects are modified copies of an initial modeled object, wherein the first modeled object, the second modeled object and the initial modeled object are CAD three-dimensional modeled objects defined respectively by an initial graph (A), a first graph (B) and a second graph (B′
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
) are boundary representation graphs or history graphs, wherein the method comprises;providing the initial modeled object; providing a respective copy of the initial modeled object to each of a first user and a second user, with at least one processor; performing, by the first user, a design modification on the copy of the initial modeled object respective to the first user, thereby providing the first modeled object, performing, by the second user, a design modification on the copy of the initial modeled object respective to the second user, the design modification performed by the second user being different from the design modification performed by the first user, thereby providing the second modeled object, computing a first double push-out graph rewriting rule and a second double push-out graph rewriting rule, the first double push-out graph rewriting rule and the second double push-out graph rewriting rule corresponding respectively to a transformation of the initial graph (A) into the first graph (B) and the second graph (B′
),wherein the first double push-out graph rewriting rule specifies a first part (L) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the first graph (B), a first replacement (R) to replace the first part (L), a first interface (G) between the first part (L) and the first replacement (R), first morphisms from the first interface (G) to the first part (L) and to the first replacement (R) respectively, and wherein the second double push-out graph rewriting rule specifies a second part (L′
) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the second graph (B′
), a second replacement (R′
) to replace the second part (L′
), a second interface (G′
) between the second part (L′
) and the second replacement (R′
), second morphisms from the second interface (G′
) to the second part (L′
) and to the second replacement (R′
) respectively;assembling the first rewriting rule and the second rewriting rule to determine and provide a third double push-out graph rewriting rule, wherein the third double push-out graph rewriting rule specifies an assembled part ({tilde over (L)}) which is an assembly of the first part (L) and the second part (L′
), an assembled replacement ({tilde over (R)}) which is an assembly of the first replacement (R) and the second replacement (R′
), an assembled interface ({tilde over (G)}) which is an assembly of the first interface (G) and the second interface (G′
), assembled morphisms from the assembled interface ({tilde over (G)}) to the assembled part ({tilde over (L)}) and the assembled replacement ({tilde over (R)}) respectively, wherein an assembly of elements of the first and second rewriting rules consists, for each element, of a gathering of constituents of the element of the first rewriting rule with constituents of the element of the second rewriting rule;computing a merged graph (Ã
) by applying the third double push-out graph rewriting rule to the initial graph (A), wherein the merged graph is translated in a merged modeled object. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
-
12. A computer-aided collaborative design system configured to merge a first modeled object with a second modeled object wherein the first and second modeled objects are modified copies of an initial modeled object, wherein the first modeled object, the second modeled object and the initial modeled object are CAD three-dimensional modeled objects defined respectively by an initial graph (A), a first graph (B) and a second graph (B′
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
) are boundary representation graphs or history graphs, comprising;a memory suitable for storing the first modeled object, the second modeled object, and the initial modeled object, wherein the first modeled object is a first modification, by a first user, of the initial modeled object, and second modeled object is a second modification, by a second user, of the initial modeled object, a first graph and a second graph defining respectively the first and second modeled objects, and a graphical user interface coupled with a processor and the memory, the graphical user interface and processor configured to merge the first and second graph by; computing a first double push-out graph rewriting rule and a second double push-out graph rewriting rule, the first rewriting rule and the second rewriting rule corresponding respectively to a transformation of the initial graph (A) into the first graph (B) and the second graph (B′
),wherein the first double push-out graph rewriting rule specifies a first part (L) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the first graph (B), a first replacement (R) to replace the first part (L), a first interface (G) between the first part (L) and the first replacement (R), first morphisms from the first interface (G) to the first part (L) and to the first replacement (R) respectively, and wherein the second double push-out graph rewriting rule specifies a second part (L′
) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the second graph (B′
), a second replacement (R′
) to replace the second part (L′
), a second interface (G′
) between the second part (L′
) and the second replacement (R′
), second morphisms from the second interface (G′
) to the second part (L′
) and to the second replacement (R′
) respectively;assembling the first rewriting rule and the second rewriting rule to determine and provide a third double push-out graph rewriting rule, wherein the third double push-out graph rewriting rule specifies an assembled part ({tilde over (L)}) which is an assembly of the first part (L) and the second part (L′
), an assembled replacement ({tilde over (R)}) which is an assembly of the first replacement (R) and the second replacement (R′
), an assembled interface ({tilde over (G)}) which is an assembly of the first interface (G) and the second interface (G′
), assembled morphisms from the assembled interface ({tilde over (G)}) to the assembled part ({tilde over (L)}) and the assembled replacement ({tilde over (R)}) respectively, wherein an assembly of elements of the first and second rewriting rules consists, for each element, of a gathering of constituents of the element of the first rewriting rule with constituents of the element of the second rewriting rule;computing a merged graph (Ã
) by applying the third double push-out graph rewriting rule to the initial graph (A), wherein the merged graph is translated in a merged modeled object.
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
-
13. A non-transitory computer readable storage medium having recorded thereon computer program code instructions for execution by a computer, the instructions comprising a method of collaborative design for merging a first modeled object with a second modeled object wherein the first and second modeled objects are modified copies of an initial modeled object, wherein the first modeled object, the second modeled object and the initial modeled object are CAD three-dimensional modeled objects defined respectively by an initial graph (A), a first graph (B) and a second graph (B′
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
) are boundary representation graphs or history graphs, wherein the method comprises;receiving the first modeled object resulting from a first design modification performed on a first copy of the initial modeled object by the first user, receiving the second modeled object resulting from a second design modification performed on a second copy of the initial modeled object by the second user, computing a first double push-out graph rewriting rule and a second double push-out graph rewriting rule, the first rewriting rule and the second rewriting rule corresponding respectively to a transformation of an initial graph (A) into the first graph (B) and the second graph (B′
),wherein the first double push-out graph rewriting rule specifies a first part (L) from the initial graph (A) which is to be replaced when transforming the initial graph (A) into the first graph (B), a first replacement (R) to replace the first part (L), a first interface (G) between the first part (L) and the first replacement (R), first morphisms from the first interface (G) to the first part (L) and to the first replacement (R) respectively, and wherein the second double push-out graph rewriting rule specifies a second part (L′
) from the initial graph (A′
) which is to be replaced when transforming the initial graph (A) into the second graph (B′
), a second replacement (R′
) to replace the second part (L′
), a second interface (G′
) between the second part (L′
) and the second replacement (R′
), second morphisms from the second interface (G′
) to the second part (L′
) and to the second replacement (R′
) respectively;assembling the first rewriting rule and the second rewriting rule to determine and provide a third double push-out graph rewriting rule, wherein the third double push-out graph rewriting rule specifies an assembled part ({tilde over (L)}) which is an assembly of the first part (L) and the second part (L′
), an assembled replacement which is an assembly of the first replacement (R) and the second replacement ({tilde over (R)}), an assembled interface ({tilde over (G)}) which is an assembly of the first interface (G) and the second interface (G′
), assembled morphisms from the assembled interface ({tilde over (G)}) to the assembled part ({tilde over (L)}) and the assembled replacement ({tilde over (R)}) respectively;computing a merged graph (Ã
) by applying the third double push-out graph rewriting rule to the initial graph (A), wherein the merged graph is translated in a merged modeled object.
- ), wherein the initial graph (A), the first graph (B) and the second graph (B′
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeDassault Systemes SA
-
Original AssigneeDassault Systemes SA
-
InventorsRameau, Jean-Francois, Doumenc, Thomas
-
Primary Examiner(s)Zimmerman, Mark
-
Assistant Examiner(s)Le, Sarah
-
Application NumberUS13/324,768Publication NumberTime in Patent Office1,673 DaysField of Search345/629US Class Current1/1CPC Class CodesG06F 2111/02 CAD in a network environmen...G06F 30/00 Computer-aided design [CAD]G06T 17/005 Tree description, e.g. octr...
