# US 2025/0156597 A1 · Computer aided automated shape synthesis of plate-like structures

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

- Number: US 2025/0156597 A1
- Document ID: US20250156597A1
- Status: Published application
- Kind: A1
- Application number: 18/507,958
- Filed: 2023-11-13
- Published: 2025-05-15
- Earliest claimed: 2023-11-13
- Assignees: Autodesk, Inc.
- Applicants: Autodesk, Inc.
- Inventors: Ravi Kumar Burla; Benjamin McKittrick Weiss; Marcin Makowski; Marcin Jan Rakus; Jesus Rodriguez
- Web page: https://patentgrep.com/patent/US20250156597A1

## CPC

- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- 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 2119/18: Manufacturability analysis or optimisation for manufacturability
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, systems, and apparatus, including medium-encoded computer program products, for automated shape synthesis including obtaining two or more specified regions of geometry defined in a data structure used by the shape synthesis computer program, producing candidate solutions, each candidate solution of the candidate solutions produced using a different plate generation algorithm to synthesize plates that join the two or more specified regions of geometry with each other through the plates, each of the plates is defined by a base plane, a 2D profile, and a thickness, where the candidate solutions represent new geometry defined in the data structure, and providing, for presentation in a user interface, the candidate solutions and controls to select one or more of the candidate solutions for use in manufacturing one or more physical structures using one or more computer-controlled manufacturing systems, or for use in displaying the selected candidate solutions on a display screen.

## Claims

### Claim 1

A method comprising:
obtaining, by a shape synthesis computer program, two or more specified regions of geometry defined in a data structure used by the shape synthesis computer program;
producing, by the shape synthesis computer program, candidate solutions, each candidate solution of the candidate solutions produced using a different plate generation algorithm to synthesize plates that join the two or more specified regions of geometry with each other through the plates, each of the plates is defined by a base plane, a two-dimensional profile, and a thickness, and wherein the candidate solutions represent new geometry defined in the data structure;
providing, by the shape synthesis computer program and for presentation in a user interface, the candidate solutions and controls to select one or more of the candidate solutions for use in manufacturing one or more physical structures corresponding to the selected one or more candidate solutions using one or more computer-controlled manufacturing systems, or for use in displaying the selected one or more candidate solutions on a display screen.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving, by the shape synthesis computer program and through the user interface, a selection of a candidate solution of the presented candidate solutions.

### Claim 3 (depends on 1)

The method of claim 1, wherein the two or more specified regions of geometry comprise two or more preserves, and the obtaining comprises receiving at least one obstacle through which the two or more preserves cannot be joined.

### Claim 4 (depends on 1)

The method claim 1, wherein the producing comprises synthesizing, by the shape synthesis computer program, candidate plates that join the two or more specified regions of geometry with each other through the plates, wherein the synthesizing comprises:
generating a shape incorporating the two or more specified regions;
applying, to the generated shape incorporating the two or more specified regions, a numerical simulation to obtain a field of interest for the generated shape; and
selecting at least one of the candidate plates to join the two or more specified regions in response to the field of interest.

### Claim 5 (depends on 1)

The method of claim 1, wherein producing each candidate solution of the candidate solutions comprises:
generating, by the shape synthesis computer program, candidate plates, each of the candidate plates being arranged with respect to the two or more specified regions and contacting at least one of the two or more specified regions;
ranking, by the shape synthesis computer program, the candidate plates based on a quality of contact between the at least one specified region and each candidate plate for the candidate plates; and
selecting, by the shape synthesis computer program and from the ranked candidate plates, at least two of the candidate plates to include in the candidate solution, wherein each of the two or more specified regions contact at least one of the at least two candidate plates.

### Claim 6 (depends on 5)

The method of claim 5, wherein selecting the at least two candidate plates to include in the candidate solution comprises selecting a first candidate plate having a default thickness and comprising at least two layers, wherein each layer of the at least two layers of the first candidate plate comprises a plate profile, and wherein the at least two layers are arranged with respect to each other to form the first candidate plate.

### Claim 7 (depends on 5)

The method of claim 5, further comprising:
receiving, by the shape synthesis computer program and through the user interface, a selection of at least one candidate plate of the selected candidate solution and a re-selection request; and
selecting, by the shape synthesis computer program and using the selected at least one candidate plate and the re-selection request, at least two candidate plates to include in the candidate solution to produce the candidate solution.

### Claim 8 (depends on 5)

The method of claim 5, further comprising producing an alternative candidate solution for the candidate solution, comprising:
assigning, to the ranked candidate plates, a secondary scoring criteria; and
re-ranking, by the shape synthesis computer program, the candidate plates based on a quality of contact between the at least one specified region and each candidate plate for the candidate plates and the secondary scoring criteria; and
selecting, by the shape synthesis computer program and from the ranked candidate plates, at least two of the candidate plates to include in the alternative candidate solution, wherein the alternative candidate solution differs from the candidate solution by at least one selected candidate plate.

### Claim 9 (depends on 5)

The method of claim 5, further comprising ranking the candidate plates using base planes for the candidate plates, wherein candidate plates having base planes corresponding to one or more identified symmetry planes for the two or more specified regions are assigned a higher ranking than candidate plates having base planes not corresponding to the one or more identified symmetry planes.

### Claim 10 (depends on 5)

The method of claim 5, wherein the selecting comprises iteratively selecting candidate plates to include in the candidate solution, and wherein the ranking further comprises ranking the candidate plates using an angle of intersection of the candidate plate with each previously selected candidate plate of the candidate plates.

### Claim 11 (depends on 5)

The method of claim 5, wherein the quality of contact between the at least one specified region and the candidate plate is determined from a characteristic of an intersection between a midplane of the candidate plate with the at least one specified region.

### Claim 12 (depends on 11)

The method of claim 11, wherein the characteristic of the intersection comprises (A) containment of the at least one specified region within the candidate plate or (B) a crossing of the at least one specified region of the midplane of the candidate plate.

### Claim 13 (depends on 5)

The method of claim 5, wherein the selecting comprises iteratively selecting candidate plates to include in the candidate solution, and wherein the ranking further comprises ranking a candidate plate of the candidate plates based on an orientation of the candidate plate with respect to at least one other previously selected candidate plate.

### Claim 14 (depends on 13)

The method of claim 13, wherein the orientation of the candidate plate with respect to the at least one other candidate plate previously included in the candidate solution comprises (A) a degree of orthogonality of the candidate plate with respect to the at least one other candidate plate, or (B) a separation of a planar surface of the candidate to a parallel planar surface of the at least one other candidate plate.

### Claim 15 (depends on 5)

The method of claim 5, wherein the producing further comprises:
determining at least one path connecting the two or more specified regions of interest through the selected two or more candidate plates; and
in response to determining that the at least one path does not connect the two or more specified regions of interest through the selected two or more candidate plates, selecting at least one additional candidate plate to produce the candidate solution.

### Claim 16 (depends on 5)

The method of claim 5, wherein the new geometry represented by each of the one or more candidate solutions are a first geometry, and wherein the producing further comprises
for a candidate plate of the at least two candidate plates forming the candidate solution, identifying intersecting regions between the candidate plate and one or more other candidate plates;
assigning, based on the identified intersecting regions, a primary or secondary relationship to each candidate plate with respect to each other candidate plate of the at least two candidate plates;
classifying, each identified intersecting region and based on the assigned primary or secondary relationship, as one of a set of junction types;
resolving each intersecting region using a classified junction type of the set of junction types; and
producing, from the resolved intersecting regions, an updated representation of a second geometry defined in the data structure and replacing the first geometry.

### Claim 17 (depends on 16)

The method of claim 16, wherein classifying each identified intersecting region as one of the set of junction types comprises:
classifying the identified intersecting region as one of (A) a “T” junction comprising a first plate bounded by a second plate where the second plate is not bounded by the first plate, (B) an “L” junction where two plates are mutually bounded by each other, and (C) an “X” junction where two plates intersect without forming a bounding relationship.

### Claim 18 (depends on 5)

The method of claim 5, wherein producing each candidate solution of the candidate solutions comprises providing the candidate solution including at least one candidate plate as input to an automatic three-dimensional (3D) geometry generation process comprising:
generating an input to the automatic 3D geometry generation process comprising, for each candidate plate of the at one candidate plate of the selected candidate solution, a planar or quasi-planar mesh representation or embedding of the two-dimensional profile of the candidate plate along a midplane of the candidate plate; and
providing the input to the automatic 3D geometry generation process.

### Claim 19 (depends on 18)

The method of claim 18, wherein the generating the input for each of the at least two candidate plates comprises generating a 2D mesh representation comprising (A) a 2D level set representation, (B) a 2D surface mesh, or (C) a 2D grid comprising a discrete representation of the candidate plate.

### Claim 20 (depends on 19)

The method of claim 19, wherein generating the 2D mesh representation comprises removing a selected region of a 2D mesh representation of the 2D mesh representations comprising:
generating a connected components map of all interior mesh elements of the 2D mesh representation;
identifying a selected region to remove from the 2D mesh representation by determining, for each connected component in the connected components map, (A) a number of preserves and plate intersections contacted by the connected component, (B) a fraction of interior mesh elements in the connected component which are not also contained in an intersection or preserve, and (C) whether the connected component contacts a preserve which is not contacted by any other plates in the 2D mesh representation; and
removing, based on the identifying, connected components corresponding to the selected region.

### Claim 21 (depends on 20)

The method of claim 20, wherein removing the selected region further comprises:
generating, plate boundaries for the candidate plates;
intersecting the 2D mesh representation with a half space defined by a bounding plane for the plate boundaries; and
removing, based on the intersection, the selected regions.

### Claim 22

A method comprising:
receiving, by a shape synthesis computer program, two or more preserves defined in a data structure used by the shape synthesis computer program;
producing, by the shape synthesis computer program, a candidate solution by synthesizing plates that join the two or more preserves with each other through the plates, wherein each of the plates is defined by a base plane, a two-dimensional profile, and a thickness, and wherein the candidate solution represents a new geometry defined in the data structure, wherein the producing comprises
assessing preserve geometry for each of the two or more preserves;
generating, from the two or more preserves, an initial shape inclusive of the two or more preserves;
generating, based on the preserve geometries of the two or more preserves, a set of candidate plates, wherein each candidate plate contacts at least one of the two or more preserves;
selecting, from the set of candidate plates, at least two candidate plates to form the candidate solution; and
providing, by the shape synthesis computer program, the candidate solution for use in manufacturing a physical structure corresponding to the candidate solution using one or more computer-controlled manufacturing systems, or for use in displaying the candidate solution on a display screen.

### Claim 23 (depends on 22)

The method of claim 22, wherein generating, based on the preserve geometries of the two or more preserves, the set of candidate plates comprises generating a symmetry plate having a midplane aligned with a global or local symmetry plane of the two or more preserves.

### Claim 24 (depends on 23)

The method of claim 23, wherein generating, based on the preserve geometries of the two or more preserves, the set of candidate plates comprises:
generating, for the two or more preserves, surface mesh clusters for surface meshes corresponding to the two or more preserves; and
generating at least one candidate plate from the surface mesh clusters, comprising
setting an orientation of a midplane of the candidate plate using a cluster normal for a surface mesh cluster of the surface mesh clusters; and
setting a location of the candidate plate using a centroid of facets of one or more preserves selected for inclusion in the surface mesh cluster.

### Claim 25 (depends on 24)

The method of claim 24, wherein the selecting further comprises:
scoring each candidate plate of the set of candidate plates, wherein a score of the candidate plate with respect to each other candidate plate of the set of candidate plates corresponds to (A) a number of preserves contacting the candidate plate, and/or (B) a fractional area of the preserve having a surface normal direction that is parallel, anti-parallel, or perpendicular to the normal direction of the surface mesh cluster of the candidate plate; and
selecting, by the shape synthesis computer program and from the scored candidate plates, the at least two candidate plates to include in the candidate solution.

### Claim 26 (depends on 22)

The method of claim 22, wherein the thickness of the candidate plate comprises an initial thickness, and the method further comprises:
adjusting at least one of (A) a first location of the first surface, and (B) a second location of the second surface with respect to the base plane, wherein the adjusting comprises contacting at least one of the first surface and the second surface with one or more preserves, and wherein the adjusting comprises updating the thickness of the candidate plate to define an updated thickness; and
updating a location of the base plane in response to the adjusting of the at least one of the first surface and the second surface.

### Claim 27 (depends on 22)

The method of claim 22, wherein generating, based on the preserve geometries of the two or more preserves, the set of candidate plates comprises:
classifying each preserve of the two or more preserves into shape classifications as at least one of (A) flat; (B) extruded and (C) other; and
generating candidate plates based on the classification of the two or more preserves.

### Claim 28 (depends on 27)

The method of claim 27, wherein selecting, from the set of candidate plates, the at least two candidate plates to form the candidate solution comprises, for each candidate plate:
determining, from the classification of each preserve used to generate the candidate plate, a quality of contact between the candidate plate and at least one preserve as one of (A) acceptable contact, (B) unacceptable contact, and (C) not intersecting; and
selecting, from the quality of contact of each of the set of candidate plates, the at least two candidate plates to form the candidate solution.

### Claim 29 (depends on 22)

The method of claim 22, wherein the selecting further comprises:
scoring the candidate plates based on a degree of intersection between a midplane of the candidate plate with at least one preserve wherein the degree of intersection comprises (A) containment of the at least one preserve within the candidate plate or (B) a crossing of the at least one preserve of the midplane of the candidate plate; and
selecting, by the shape synthesis computer program and from the scored candidate plates, the at least two candidate plates to include in the candidate solution.

### Claim 30 (depends on 22)

The method of claim 22, wherein the selecting further comprises:
assigning, for each of the set of candidate plates, a score to the candidate plate, the score comprises (A) an intrinsic score and/or (B) a context score,
wherein the intrinsic score comprises a static ranking of the candidate plate with respect to each other candidate plate of the set of candidate plates, and
wherein the context score comprises a dynamic ranking of the candidate plate with respect to at least one other candidate plate of the set of candidate plates selected to form the candidate solution; and
selecting a candidate plate of the set of candidate plates using the score of the candidate plate to form the candidate solution.

### Claim 31 (depends on 22)

The method of claim 22, further comprising extending a thickness of each of two preserve surfaces of at least one preserve comprising:
extruding each triangle of triangles forming the preserve surface along a normal direction; and
joining the two preserve surfaces to generate a solid body.

### Claim 32 (depends on 22)

The method of claim 22, wherein generating the initial shape inclusive of the two or more preserves comprises generating a convex hull.

### Claim 33 (depends on 32)

The method of claim 32, further comprising:
generating an updated convex hull inclusive of the two or more preserves and the at least two candidate plates forming the candidate solution using a model of intersecting regions of the at least two candidate plates as additional input.

### Claim 34 (depends on 33)

The method of claim 33, comprising generating the model of the intersecting regions of the at least two candidate plates as boxes oriented along an intersection vector of the intersection region and covering an extent of the convex hull projected onto the intersection vector.

### Claim 35 (depends on 22)

The method of claim 22, further comprising:
intersecting the initial shape with a midplane of each candidate plate of the at least two candidate plates;
determining, from the intersections, connected components for each of the at least two candidate plates;
generating, for each of the connected components, an intersecting connected components map between the connected components for the at least two candidate plates; and
in response to determining a disconnection in the intersecting connected components map
generating a set of connecting candidate plates, and
selecting an additional connecting plate from the set of connecting candidate plates to form an updated candidate solution.

### Claim 36 (depends on 35)

The method of claim 35, further comprising:
determining, for the at least two candidate plates and the additional connecting plate forming the candidate solution, a system score;
ranking each of a remaining set of connecting candidate plates based on an increase to the system score from including the connecting candidate plate in the candidate solution; and
selecting, for inclusion in the candidate solution, an additional connecting plate using the ranking of the remaining set of connecting candidate plates.

### Claim 37 (depends on 22)

The method of claim 22, further comprising:
identifying, from the initial shape and the at least two candidate plates forming the candidate solution, regions of the initial shape included within a volume defined by an intersection between each of the at least two candidate plates and the initial shape;
identifying paths connecting the two or more preserves;
classifying each of the identified paths based on (A) a fidelity of the path to a volume of the initial shape, and (B) a fidelity of the path to the identified regions; and
in response to the classifications of the identified paths
extending the initial shape to generate an updated shape, or
selecting an additional candidate plate to form the candidate solution.

### Claim 38 (depends on 22)

The method of claim 22, further comprising:
analyzing a quality of intersection for each of one or more intersections between two or more of the at least two candidate plates within the initial shape;
analyzing a quality of contact between each of the at least two candidate plates and the two or more preserves; and
in response to the quality of intersection and the quality of contact each meeting at least a threshold value, providing, by the shape synthesis computer program, the candidate solution.

### Claim 39 (depends on 22)

The method of claim 22, wherein selecting, from the set of candidate plates, at least two candidate plates to form the candidate solution comprises:
identifying symmetry planes for the two or more preserves; and
selecting at least one candidate plate aligned with a symmetry plane of the symmetry planes.

### Claim 40

A method comprising:
receiving, by a shape synthesis computer program, two or more preserves defined in a data structure used by the shape synthesis computer program;
producing, by the shape synthesis computer program, a candidate solution by synthesizing candidate plates that join the two or more preserves with each other through the candidate plates, wherein each of the candidate plates is defined by a base plane, a two-dimensional profile, and a thickness, and wherein the candidate solution represents a new geometry defined in the data structure, wherein the producing comprises
determining a number of preserves in a current set of preserves defined in the data structure; and
in response to determining the number of preserves in the current set of preserves is greater than or equal to two, iteratively selecting candidate plates for inclusion in the candidate solution, comprising
classifying each preserve of the current set of preserves defined in the data structure into shape classifications based in part on one or more symmetries of the preserve,
selecting a set of base planes for a set of candidate plates from predefined plate configurations stored in a repository and based on the shape classifications of the current set of preserves,
generating a ranking for the candidate plates, wherein a rank of each candidate plate with respect to each other candidate plate of the candidate plates corresponds to (A) a number of the current set of preserves contacting the candidate plate and (B) a classification of the predefined plate configuration in the repository,
selecting, from the ranked set of candidate plates, a candidate plate to form the candidate solution, and
updating the current set of preserves to include the candidate plate as a new preserve in a next iteration,
in response to determining the number of preserves in the current set of preserves is less than two, providing, by the shape synthesis computer program, the candidate solution for use in manufacturing a physical structure corresponding to the candidate solution using one or more computer-controlled manufacturing systems, or for use in displaying the candidate solution on a display screen.

### Claim 41 (depends on 40)

The method of claim 40, wherein updating the current set of two or more preserves to include the candidate plate comprises:
for a first preserve having at least a threshold contact with the candidate plate, generating a second preserve comprising the first preserve and the candidate plate, or
defining a new preserve comprising the candidate plate.

### Claim 42 (depends on 40)

The method of claim 40, further comprising:
for each candidate plate selected to form the candidate solution, intersecting the two or more preserves with a midplane of the candidate plate to produce 2D contours;
generating a convex hull profile from the 2D contours for the candidate plates selected to form the candidate solution;
generating, for the convex hull profile for the candidate plate, a connected components map; and
in response to determining the connected components map comprises two or more disconnected components, extending at least one dimension of the two-dimensional profile of the candidate plate.

### Claim 43 (depends on 40)

The method of claim 40, wherein the thickness of each of the candidate plates forming the candidate solution comprises an initial thickness value, and wherein, for each candidate plate forming the candidate solution:
determining an intersection of the candidate plate with an obstacle; and
in response to determining the intersection, adjusting the initial thickness of the candidate plate to an updated thickness such that the candidate plate having the updated thickness does not intersect with the obstacle, and wherein the updated thickness is greater than a minimum thickness value for the candidate plate.

### Claim 44 (depends on 43)

The method of claim 43, wherein the thickness of each of the candidate plates forming the candidate solution comprises a same thickness value corresponding to a smallest value of an updated thicknesses for the candidate plates.

### Claim 45 (depends on 40)

The method of claim 40, wherein selecting the set of candidate plates comprises:
identifying, for the two or more preserves and based on the shape classifications of the two or more preserves, preserve groupings corresponding to at least two of the two or more preserves;
determining, for each grouping of the identified preserve groupings, a corresponding validated candidate plate for the group;
in response to determining the corresponding validated candidate plate for the grouping, adding the candidate plate to the set of candidate plates; and
in response to determining no corresponding validated candidate plate for the grouping, disregarding the grouping.

### Claim 46 (depends on 40)

The method of claim 40, wherein selecting the set of candidate plates comprises:
generating, for the two or more preserves and based on the shape classifications of the two or more preserves, candidate plates based on one or more of (A) global symmetry of the two or more preserves, (B) axis-aligned planes at a center of gravity of the two or more preserves, (C) pairwise local symmetry of the two or more preserves, and (D) planes of clustered preserve triangles grouped by normal directions for the cluster; and
filtering each candidate plate of the candidate plates against a repository of validated candidate plates for the two or more preserves;
in response to determining a corresponding validated candidate plate, adding the candidate plate to the set of candidate plates; and
in response to determining no corresponding validated candidate plate, disregarding the candidate plate.

### Claim 47 (depends on 46)

The method of claim 46, wherein the producing comprises:
including all candidate plates generated based on global and local symmetry to form the candidate solution.

### Claim 48 (depends on 40)

The method of claim 40, further comprising:
determining a first number of connected components in the candidate solution excluding the candidate plate;
determining a second number of connected component in the candidate solution including the candidate plate; and
in response to determining the second number is equal to the first number, excluding the candidate plate from the candidate solution.
