公开(公告)号：US10521516B2

公开(公告)日：2019-12-31

申请号：US14835304

申请日：2015-08-25

Applicant: DASSAULT SYSTEMES

Inventor： Jean-Francois Rameau

IPC: G06F17/50

Abstract: 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.

公开(公告)号：US10198488B2

公开(公告)日：2019-02-05

申请号：US15161861

申请日：2016-05-23

Applicant: Dassault Systemes

Inventor： Laurent Marini ,  Remy Rorato ,  Jean-Francois Rameau

IPC: G06F17/30 ,  G06F17/50

Abstract: 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 ƒ(x)= a ( b + cx 3 2 ) . Such a method improves the querying of a database that comprises 3D modeled objects that represent mechanical parts.

公开(公告)号：US09830406B2

公开(公告)日：2017-11-28

申请号：US14475904

申请日：2014-09-03

Applicant: Dassault Systemes

Inventor： Jean-Francois Rameau

IPC: G06F17/50 ,  G06T17/10 ,  G06T17/00

CPC classification number: G06F17/50 ,  G06T17/005 ,  G06T17/10

Abstract: 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: performing a design operation triggering the adding or the removing of a leaf node; and idealizing the binary tree, i.e. modifying the binary tree while maintaining the optimality of the tree by minimizing the number of weak leaf nodes, a weak leaf node being a leaf node such that, when removed, the resulting binary tree is not optimal anymore.

公开(公告)号：US09703903B2

公开(公告)日：2017-07-11

申请号：US14308029

申请日：2014-06-18

Applicant: Dassault Systemes

Inventor： Jean-Francois Rameau ,  Pascal Hebrard

IPC: G06F17/50

CPC classification number: G06F17/5009 ,  G06F17/50 ,  G06F2217/06 ,  G06F2217/38 ,  G06F2217/42

Abstract: It is provided a computer-implemented method for designing a folded sheet object, comprising the steps of providing (S10) 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 (S20) 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.

公开(公告)号：US20150073753A1

公开(公告)日：2015-03-12

申请号：US14475904

申请日：2014-09-03

Applicant: Dassault Systemes

Inventor： Jean-Francois Rameau

IPC: G06F17/50

CPC classification number: G06F17/50 ,  G06T17/005 ,  G06T17/10

Abstract: 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: performing a design operation triggering the adding or the removing of a leaf node; and idealizing the binary tree, i.e. modifying the binary tree while maintaining the optimality of the tree by minimizing the number of weak leaf nodes, a weak leaf node being a leaf node such that, when removed, the resulting binary tree is not optimal anymore.

Abstract translation: 一种计算机实现的用于设计具有表示基本卷的叶节点的二叉树的工业产品的方法，所述非叶节点表示组合卷的二进制交换操作，所述方法包括以下步骤：执行触发添加或删除的设计操作 的叶节点; 并且对二进制树进行理想化，即通过最小化弱叶节点的数量来维护树的最优性来修改二叉树，弱叶节点是叶节点，使得当被去除时，所得到的二叉树不再是最优的。