# US 2019/0244114 A1 · Method of assembling parts of a product

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

- Number: US 2019/0244114 A1
- Document ID: US20190244114A1
- Status: Published application
- Kind: A1
- Application number: 16/235,177
- Filed: 2018-12-28
- Published: 2019-08-08
- Earliest claimed: 2017-12-29
- Assignees: Dassault Systemes
- Applicants: Dassault Systemes
- Inventors: Arnaud NONCLERCQ; Sebastien BROSSOLASCO
- Web page: https://patentgrep.com/patent/US20190244114A1

## CPC

- G06F 30/18: Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling (circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18)
- G06F 16/2457: with adaptation to user needs
- G06F 16/288: {Entity relationship models}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 30/00: Computer-aided design [CAD]
- G06F 30/12: characterised by design entry means specially adapted for CAD, e.g. graphical user interfaces [GUI] specially adapted for CAD
- G06F 30/17: Mechanical parametric or variational design
- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06T 15/06: Ray-tracing
- G06T 15/10: Geometric effects
- G06F 2111/20: Configuration CAD, e.g. designing by assembling or positioning modules selected from libraries of predesigned modules
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

The disclosure notably relates to a computer-implemented method of assembling parts of a product. The method comprises building a non-hierarchical graph from at least one products, the graph comprising nodes and edges between nodes, a node representing a part of the product to be assembled and an edge representing a relationship between a pair of parts represented by nodes, providing a part of the product to be completed, performing, upon user action, a selection on the provided part, identifying in the graph a node representing the selected part and one or more nodes that have the closest relationships to the node representing the selected part.

## Claims

### Claim 1

A computer-implemented method of assembling parts of a product, comprising:
building a non-hierarchical graph from at least one products, the graph comprising nodes and edges between nodes, a node representing a part of the product to be assembled and an edge representing a relationship between a pair of parts represented by nodes;
obtaining a part of the product to be completed;
performing, upon user action, a selection on the obtained part; and
identifying in the graph a node representing the selected part and one or more nodes that have the closest relationships to the node representing the selected part.

### Claim 2 (depends on 1)

The computer implemented-method of claim 1, wherein performing the selection on the obtained part further comprises identifying a location on the obtained part of the product, and wherein identifying in the graph the node representing the selected part comprises identifying in the graph the node with the identified location on the obtained part.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein identifying the location on the obtained part comprises computing an intersection between a geometry of the part and ray traced upon user action.

### Claim 4 (depends on 1)

The computer-implemented method of one claim 1, wherein identifying the one or more nodes that have the closest relationships to the node representing the selected part comprises:
obtaining signatures of the nodes of the graph that are connected with an edge to the node representing the selected part; and
identifying one or more most similar signatures with the signature of the node representing the selected part.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein identifying the one or more nodes that have the closest relationships to the node representing the selected part further comprises:
identifying an orientation associated with the part of the product to be completed and associating identified orientations with each of the one or more nodes that have the closest relationships to the node representing the selected part;
identifying, among the one or more similar signatures, at least one signature whose orientation matches with the orientation of the obtained part of the product.

### Claim 6 (depends on 2)

The computer-implemented method of claim 2, wherein the identified location on the obtained part comprises a functional zone of the obtained part, a functional zone of the obtained part comprising a fit relationship with another part.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, wherein the fit relationship of a functional zone defines a standardized connection between two parts.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the identified one or more nodes have the best fit with the node representing the selected part.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein identifying the one or more nodes having the best fit comprises identifying the one or more nodes having the closest clashes with the less interferences.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein a relationship represented by an edge is one selected among:
a father/child relationship that represents a hierarchy between a pair of parts;
a neighbor relationship that represents a distance between a pair of parts;
a similar shape relationship that represents a global or local similarity in form of a pair of parts;
a similar function relationship that represents local equivalence of connections between two parts.

### Claim 11 (depends on 1)

The computer-implemented method of claim 1, wherein building the non-hierarchical graph from at least one products comprises:
for each part of each product, computing one or more signatures that have a metric;
for each pair of parts of the products having a common metric:
defining an edge between the nodes representing the pair of parts; and
associating a type of relationship and a weight that is a value representing the distance between the values of the common metric.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein an edge is defined between the parts of a pair when the distance is greater that a minimal distance.

### Claim 13

A non-transitory computer readable medium having stored thereon a computer program comprising instructions for implementing a method of assembling parts of a product, comprising:
building a non-hierarchical graph from at least one products, the graph comprising nodes and edges between nodes, a node representing a part of the product to be assembled and an edge representing a relationship between a pair of parts represented by nodes;
obtaining a part of the product to be completed;
performing, upon user action, a selection on the obtained part; and
identifying in the graph a node representing the selected part and one or more nodes that have the closest relationships to the node representing the selected part.

### Claim 14

A system comprising:
a processor coupled to a memory and a graphical user interface, the memory having recorded thereon a computer program for assembling parts of a product, the program when executed by t he processor causing the processor to be configured to:
build a non-hierarchical graph from at least one products, the graph comprising nodes and edges between nodes, a node representing a part of the product to be assembled and an edge representing a relationship between a pair of parts represented by nodes;
obtain a part of the product to be completed;
perform, upon user action, a selection on the obtained part; and
identify in the graph a node representing the selected part and one or more nodes that have the closest relationships to the node representing the selected part.

### Claim 15 (depends on 2)

The computer-implemented method of one claim 2, wherein identifying the one or more nodes that have the closest relationships to the node representing the selected part comprises:
obtaining signatures of the nodes of the graph that are connected with an edge to the node representing the selected part; and
identifying one or more most similar signatures with the signature of the node representing the selected part.

### Claim 16 (depends on 3)

The computer-implemented method of one claim 3, wherein identifying the one or more nodes that have the closest relationships to the node representing the selected part comprises:
obtaining signatures of the nodes of the graph that are connected with an edge to the node representing the selected part; and
identifying one or more most similar signatures with the signature of the node representing the selected part.

### Claim 17 (depends on 3)

The computer-implemented method of claim 3, wherein the identified location on the obtained part comprises a functional zone of the obtained part, a functional zone of the obtained part comprising a fit relationship with another part.

### Claim 18 (depends on 4)

The computer-implemented method of claim 4, wherein the identified location on the obtained part comprises a functional zone of the obtained part, a functional zone of the obtained part comprising a fit relationship with another part.

### Claim 19 (depends on 5)

The computer-implemented method of claim 5, wherein the identified location on the obtained part comprises a functional zone of the obtained part, a functional zone of the obtained part comprising a fit relationship with another part.

### Claim 20 (depends on 2)

The computer-implemented method of claim 2, wherein the identified one or more nodes have the best fit with the node representing the selected part.
