Dassault Systemes

Jean-Francois Rameau

Remy Rorato

Pascal Hebrard

Pascal Sebah

David Leo Bonner

Laurent Santiquet

Laurent Marini

Arnaud Deslandes

Xavier Gourdon

Joran Maille

Florence Hu-Aubigny

Patrick Catel

Alex State

Thomas Doumenc

Michael Frey

Philippe Serre

Laurent Alt

Claire Fritz-Humblot

André Clement

Jean Saloux

David Bonner

Described herein is a computer-implemented method for orienting 3D printing of a real object. The method comprises obtaining a 3D modeled object that represents the real object. The method also comprises determining one or more orientations of the 3D modeled object for which an overhang volume is optimal. This improves 3D printing.

Orientation of a real object for 3D printing

A computer-implemented method for designing a three-dimensional modeled object. The method comprises providing a modeling graph having nodes that represent geometrical objects and arcs that each represent a relationship linking the two geometrical objects represented by the incident nodes of the arc, wherein procedural relationships are represented by unidirectional arcs having the same orientation as the procedural relationships, and wherein the relationships linking the geometrical objects further include live relationships that are represented by bidirectional arcs. The method also comprises upon a modification of the data defining the 3D modeled object, determining a strong graph, wherein the strong graph is the graph of strong components of the modeling graph, and updating the 3D modeled object according to a traversal of the strong graph.

Execution of sequential update

A method for designing a 3D modeled object can implement a modeling graph having nodes that represent geometrical objects and arcs that each represent a relationship, wherein procedural relationships are represented by unidirectional arcs, wherein the relationships linking the geometrical objects further include live relationships that are represented by bidirectional arcs, and wherein the provided modeling graph respects a criterion that all the arcs of each strong component of the modeling graph are bidirectional. Upon adding a relationship linking two of the geometrical objects that are included in the data defining the 3D modeled object before the addition, the method selects two geometrical objects to be linked by the relationship to be added, the selection being performed according to the criterion.

Criterion for sequential update

An embodiment of present invention is computer-implemented method for designing a physical system constrained by a system of equations involving variables. The method includes partitioning the variables involved in the equations into fixed variables and unfixed variables, thereby setting the system to a restricted system with a degree of freedom equal to one. The method further includes computing a parameterized curve of solutions of the restricted system in the domain of the unfixed variables. The method further includes for at least one pair of unfixed variables, displaying the projection of the curve in the product of the domains of the pair. The method further includes navigating the solutions on the parameterized curve and representing, real-time, the current navigation position on the projection of the curve. Such a method improves the design of a physical system constrained by equations involving variables.

Designing a physical system constrained by equations

The invention notably relates to a computer-implemented method of design of an industrial product wherein constraints between geometries of the industrial product are modeled with a graph of constraints comprising nodes and edges, a node representing a geometry and an edge representing a constraint between two geometries. The method comprising the steps of selecting at least one geometry of the product; computing a depth value of each node of the graph from a node representing the at least one selected geometry; identifying antagonistic constraint(s) in the graph, an antagonistic constraint being represented by an oriented edge wherein the depth value of the start node is larger to the depth value of the end node; reversing the identified antagonistic constraint(s); modifying the at least one selected geometry.

Designing industrial products by using geometries connected by geometrical constraints

The invention notably relates to a method for determining specifications of the input of a manufacturing operation that outputs a part having cut-outs. The method comprises providing specifications of the output part, including a user-designed B-Rep having cycles of edges and modeling the part, the cut-outs being represented by the user with tunnels in the B-Rep, determining the set that consists of all cycles being the one having the smallest length in a respective equivalence class, performing a process on the set that includes iterating replacing a cycle when this reduces the length, and deleting a cycle when a sum results in a boundary cycle, otherwise replacing the cycle by the sum when this reduces the length. The invention offers an improved solution to detect, in a B-Rep having cycles of edges and modeling a part having cut-outs represented by tunnels, location of at least part of the tunnels.

Detecting cut-outs

The invention notably relates to a computer-implemented method for querying a database that comprises 3D modeled objects that represent mechanical parts. The method comprises the steps of providing a query that includes a thickness criterion and returning, as results of the query, respective 3D modeled objects of the database based on an extent to which the respective 3D modeled object has a thickness that respects the thickness criterion. The thickness of the respective 3D modeled object is proxied by a thickness signature that corresponds to the evaluation of a function of the type &#x192;(x)= Such a method improves the querying of a database that comprises 3D modeled objects that represent mechanical parts.

Querying a database with thickness criterion

A computer-implemented method for designing an industrial product modeled with a binary tree having leaf nodes representing basic volumes, non-leaf nodes representing binary commutative operation combining volumes, the method comprising the steps of:

Computer-implemented method for designing an industrial product modeled with a binary tree

It is provided a computer-implemented method for designing a folded sheet object, comprising the steps of providing (S) panels separated by bend lines, including at least four adjacent panels forming a cycle and separated by concurrent bend lines, with predetermined angles between successive bend lines; and determining (S) a control law linking the angles between the adjacent panels of the cycle, as a function of the predetermined angles between successive bend lines. Such a method improves the design of a folded sheet object.

Designing a folded sheet object

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.

Merging of modeled objects

The invention provides a computer-implemented method and system intended for designing an assembly of a plurality of objects. The assembly is modeled by a directed acyclic modeling graph having nodes and arcs. Each node represents an object of the assembly. Each arc represents the use of an end node by an origin node. At least one arc is uniquely identified by an identifier. The assembly is further modeled by at least one relation having at least one tuple containing a first chain of at least one identifier. The method comprises determining at least one mapping between the first chain and a second chain of at least one identifier as well as substituting at least one occurrence of the first chain in the tuple of the relation with the second chain. The invention provides a means to repair broken tuples automatically and thus to facilitate design.

Computer method and system providing design of an assembly modeled by a graph

The invention relates to a computer implemented method for designing a part modeled by using a seed structure of a context-free grammar, a set of rules of the grammar, at least two design features, each design feature being defined by at least one rule of the set, a priority order between the design features determined by the seed structure and the set of rules. The method comprises the steps of displaying a representation of the part in a graphical user interface according to the priority order, modifying the priority order between said two design features by modifying the set of rules, displaying a representation of the part according to the modified priority order.

Part design using a context-free grammar

The invention is directed method of computer-aided design of edges connecting faces of a modeled object, the method comprising a step of:&#x2014;determining (S-S) a structure of subsets of faces and edges of specified convex or concave type, by iteratively disconnecting (&#xa6;S&#xa6;) faces connected by edges of one type from a parent subset, whereby said parent subset is decomposed into child subsets comprising either:&#x2014;a non-connected face; or&#x2014;faces connected by edges of the other type, in which case edges of said one type are maintained in said child subset, wherein said one type of edges is further alternated at each iteration of disconnecting; and the method further comprising a step of:&#x2014;processing (S) the structure from a given parent subset for rounding or filleting the one or more edges connecting child subsets thereof, according to the type of edge as specified in said given parent subset. More generally, the present invention may further be directed to the design of implementation of two distinct technologies for processing features connecting elements a model, in place of design of edges connecting faces of a modelled object.

Method of computer-aided design of edges connecting faces of a modeled object

A computer-implemented method of design of ruled surfaces may comprise the step of accessing data defining guiding curves P(u) and Q(v) and a cost function &#x192;(t,w). Given P(u) and Q(v), the unknown coupling is a parameterized curve s(t(s),w(s)). The method further comprises defining an objective function of the type J=J(&#x192;,t,w), involving both &#x192;(t,w) and coordinates t, w of the coupling curve. Then, optimizing the objective function J makes it possible to obtain the target coupling curve. Finally, a ruled surface S(s,&#x3bb;)=&#x3bb;Q(w(s))+(1&#x2212;&#x3bb;)P(t(s))is provided, according to the guiding curves P(t(s)) and Q(w(s)), composed with the coordinates t,w of the coupling curve previously obtained. In addition, the objective function is further constrained at the optimization step such that arguments t,w of the cost function &#x192;(t,w) are regulated by a regulation function &#x3bc;.

Computer-implemented method of design of surfaces defined by guiding curves

A declarative system for designing parts or assemblies of parts is based on a history-based design system (), which has a storage format with primitives and operations; a modeled object is defined in the history based design system by an ordered sequence of operations and primitives. The declarative system has several functional features, which may be selected () and instantiated by a end user by providing a set of specifications () to a end-user interface (). An instantiated functional feature provides contributions (), each contribution being an ordered sequence of operations and primitives of the history-based design system. Contributions () are received by a seed structure (). The seed structure is defined in a context-free grammar. The seed structure orders operations and primitives of received contributions provides an ordered sequence () of operations and primitives to the history based system. An editor () makes it possible to edit the seed structure in the grammar.

Growing community of inventors

Lisses, France

Jean-Francois Rameau