# US 2023/0418986 A1 · Cad feature tree optimization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0418986 A1
- Document ID: US20230418986A1
- Status: Published application
- Kind: A1
- Application number: 18/341,933
- Filed: 2023-06-27
- Published: 2023-12-28
- Earliest claimed: 2022-06-27
- Assignees: Dassault Systemes
- Applicants: Dassault Systemes
- Inventors: Lucas BRIFAULT; Ariane JOURDAN; Eloi MEHR
- Web page: https://patentgrep.com/patent/US20230418986A1

## CPC

- G06F 30/10: Geometric CAD
- G06F 30/12: characterised by design entry means specially adapted for CAD, e.g. graphical user interfaces [GUI] specially adapted for CAD
- G06F 2111/10: Numerical modelling
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The disclosure notably relates to a computer-implemented method for generating a CAD feature tree from a discrete geometrical representation of a mechanical product. The method comprises obtaining the discrete geometrical representation, and a set of CAD features. The method further comprises determining one or more sequences of CAD features from the set of CAD features by optimizing an objective function which rewards a fitting of the discrete geometrical representation by a candidate sequence, and penalizes a complexity of a candidate sequence, the complexity of a candidate sequence being a function of the candidate sequence that increases when adding a feature to the candidate sequence.

## Claims

### Claim 1

A computer-implemented method for generating a CAD feature tree from a discrete geometrical representation of a mechanical product, the method comprising:
obtaining the discrete geometrical representation;
obtaining a set of CAD features; and
determining one or more sequences of CAD features from the set of CAD features by optimizing an objective function which:
rewards a fitting of the discrete geometrical representation by a candidate sequence, and
penalizes a complexity of a candidate sequence, the complexity of a candidate sequence being a function of the candidate sequence that increases when adding a feature to the candidate sequence.

### Claim 2 (depends on 1)

The method of claim 1, wherein the objective function further comprises a subtraction of the complexity of a candidate sequence by a term rewarding a fitting of the discrete geometrical representation by the candidate sequence.

### Claim 3 (depends on 2)

The method of claim 2, wherein the term rewarding the fitting is weighted by a weighting parameter.

### Claim 4 (depends on 2)

The method of claim 2, wherein the objective function is of a type:
(s)=M(s)−M(T(s))
where s is the candidate sequence, (s) is the objective function, M is the complexity of the candidate sequence and αM(T(s)) is a term, α being a weighting parameter, and T(s) is a CAD feature tree resulting from the candidate sequence s.

### Claim 5 (depends on 1)

The method of claim 1, wherein the optimization of the objective function is under a constraint that each of the determined one or more sequences has a fitting of the discrete geometrical representation that is larger than a fitting threshold.

### Claim 6 (depends on 1)

The method of claim 1, wherein the rewarding of the fitting is based on a ratio between a surface area of a covering of the discrete geometrical representation by the candidate sequence, and a surface area of the discrete geometrical representation.

### Claim 7 (depends on 1)

The method of claim 1, wherein the complexity is of a type
𝒞
M
(
f
1
,
⋯
,
f
n
)
=
1
M
⁢
(
(
∑
i
=
1
n
❘
"\[LeftBracketingBar]"
∂
f
i
⋂
M
❘
"\[RightBracketingBar]"
)
-
❘
"\[LeftBracketingBar]"
∂
T
⁡
(
f
1
,
⋯
,
f
n
)
+
⋂
M
❘
"\[RightBracketingBar]"
)
where M is the complexity of a sequence s of CAD features (f1, . . . , fn), ∂T(f1, . . . , fn) is a boundary of a feature resulting from a sequence s, n is a number of CAD features in a sequence s, ∂fi is a boundary of a CAD feature fi, ∂fi∩M is an intersection between a boundary of ∂fi and a discrete geometrical representation M, and a function |N| outputs a the surface area of the argument N.

### Claim 8 (depends on 1)

The method of claim 1, wherein the optimization is performed on a subset of candidate sequences each consisting of:
non-repeated CAD features of the set, and/or
CAD features of the set ordered with respect to a feature order, the feature order rewards a covering of the discrete geometrical representation by the candidate sequence.

### Claim 9 (depends on 1)

The method of claim 1, wherein the determining of the one or more sequences of CAD features further comprises iteratively building the one or more sequences, by iterations of:
building a subset of sequence of CAD features, each sequence of the subset being a respective completion of a respective intermediate sequence built at the previous iteration; and
building a one or more next intermediate sequences by selecting them in the subset based on an optimization score of the respective intermediate sequence.

### Claim 10 (depends on 9)

The method of claim 9, wherein the optimization score of an intermediate sequence is a subtraction of a fitting upper bound of the intermediate sequence by the complexity of the intermediate sequence.

### Claim 11 (depends on 9)

The method of claim 9, wherein each sequence of the built subset has a fitting upper bound larger than a fitting upper bound threshold.

### Claim 12 (depends on 9)

The method of claim 9, wherein the built respective completions belong to a subset of candidate completions each consisting of:
non-repeated CAD features of the set, and/or
CAD features of the set ordered with respect to a feature order, the feature order rewards a covering of the discrete geometrical representation by the candidate sequence.

### Claim 13

A non-transitory computer readable storage medium having recorded thereon a computer program having instructions for performing a computer-implemented method for generating a CAD feature tree from a discrete geometrical representation of a mechanical product, the method comprising:
obtaining the discrete geometrical representation;
obtaining a set of CAD features; and
determining one or more sequences of CAD features from the set of CAD features by optimizing an objective function which:
rewards a fitting of the discrete geometrical representation by a candidate sequence, and
penalizes a complexity of a candidate sequence, the complexity of a candidate sequence being a function of the candidate sequence that increases when adding a feature to the candidate sequence.

### Claim 14 (depends on 13)

The non-transitory computer readable storage medium of claim 13, wherein the objective function further comprises a subtraction of the complexity of the candidate sequence by a term rewarding a fitting of the discrete geometrical representation by the candidate sequence.

### Claim 15 (depends on 14)

The non-transitory computer readable storage medium of claim 14, wherein the term rewarding a fitting is weighted by a weighting parameter.

### Claim 16 (depends on 14)

The non-transitory computer readable storage medium of claim 14, wherein the objective function is of a type:
(s)=M(s)−αM(T(s))
where s is the candidate sequence, (s) is the objective function, M is the complexity of the candidate sequence and αM(T(s)) is a term, a being a weighting parameter, and T(s) is a CAD feature tree resulting from the candidate sequence s.

### Claim 17

A system comprising:
a processor coupled to a memory, the memory having recorded thereon a computer program comprising instructions for generating a CAD feature tree from a discrete geometrical representation of a mechanical product that when executed by the processor causes the processor to be configured to:
obtain the discrete geometrical representation,
obtain a set of CAD features, and
determine one or more sequences of CAD features from the set of CAD features by optimizing an objective function which:
rewards a fitting of the discrete geometrical representation by a candidate sequence, and
penalizes a complexity of a candidate sequence, the complexity of a candidate sequence being a function of the candidate sequence that increases when adding a feature to the candidate sequence.

### Claim 18 (depends on 17)

The system of claim 17, wherein the objective function further comprises a subtraction of the complexity of the candidate sequence by a term rewarding a fitting of the discrete geometrical representation by the candidate sequence.

### Claim 19 (depends on 17)

The system of claim 17, wherein a term rewarding the fitting is weighted by a weighting parameter.

### Claim 20 (depends on 17)

The system of claim 17, wherein the objective function is of a type:
(s)=M(s)−αM(T(s))
where s is the candidate sequence, (s) is the objective function, M is the complexity of the candidate sequence and αM(T(s)) is a term, α being a weighting parameter, and T(s) is a CAD feature tree resulting from the candidate sequence s.
