Search

CN-117396873-A - Space decomposition-based population of unit cell designs for Computer Aided Design (CAD) objects

CN117396873ACN 117396873 ACN117396873 ACN 117396873ACN-117396873-A

Abstract

A computing system (100) may include a decomposition engine (110) configured to access a unit cell design (210) and a fill area (220) of a computer-aided design (CAD) object filled with instances of the unit cell design (210), and spatially decompose the fill area (220) into a second power box (240). The dimension of the second power box (240) may be equal to the dimension of the unit cell design (210) multiplied by the second power. The computing system (100) may also include a population engine (112) configured to populate the population region (220) by performing a joint operation based on the spatially resolved aggregate of the population region (220). Each given polymer may include a plurality of unit cell designs equal to the second power that are joined together to form the given polymer.

Inventors

  • DEDHIYA HEMANT

Assignees

  • SIEMENS IND SOFTWARE LTD

Dates

Publication Date
20240112
Application Date
20210528
Priority Date
20210528

Claims (15)

  1. 1. A method, comprising: by the computing system (100, 800): accessing (702) a unit cell design (210) and a populated area (220) of a computer-aided design (CAD) object populated with instances of the unit cell design (210); -spatially decomposing (704) the filled region (220) into a second power frame (240), wherein a dimension of the second power frame (240) is equal to a dimension of the unit cell design (210) multiplied by a second power; and filling the filled region (220) by performing a joint operation based on spatially resolved aggregates of the filled region (220), wherein each given aggregate comprises a plurality of unit cell designs equal to a second power that are joined together to form the given aggregate.
  2. 2. The method of claim 1, wherein the dimension of the unit cell design (210) is measured as a dimension of a unit cell box (310) surrounding the unit cell design (210).
  3. 3. The method of claim 1 or 2, wherein spatially decomposing the filled region (220) comprises: determining a unit cell count for each dimension of a fill region box (320) surrounding the fill region (220); and A second power superscript value is calculated from the unit cell count (410).
  4. 4. A method according to claim 3, further comprising: an aggregate for the filled region is generated based on the calculated second power superscript value (410).
  5. 5. The method of any of claims 1-4, wherein spatially decomposing the filler region (220) comprises generating a spatial decomposition tree (520) representing the filler region (220), wherein nodes of the spatial decomposition tree (520) correspond to different second-order power boxes, and wherein a given node of the spatial decomposition tree (520) indicates whether a given second-order power box corresponding to the given node is occupied by the filler region (220), partially occupied by the filler region (220), or whether the filler region (220) is empty.
  6. 6. The method of claim 5, wherein generating the spatial decomposition tree (520) comprises: in response to determining that each child node of a particular node of the spatial decomposition tree (520) is occupied by the fill area (220), determining that the particular node is occupied by the fill area (220).
  7. 7. The method of claim 5, wherein generating the spatial decomposition tree (520) comprises: in response to determining that any portion of the filler region (220) overlaps with space covered by a second power frame corresponding to a child node in a lowest level of the spatial decomposition tree (520), determining that the child node is occupied by the filler region (220).
  8. 8. A system (100) comprising: a decomposition engine (110) configured to: accessing a unit cell design (210) and a populated area (220) of a computer-aided design (CAD) object populated with instances of the unit cell design (210); and spatially decomposing the filled region (220) into a second power box (240), wherein a dimension of the second power box (240) is equal to a dimension of the unit cell design (210) multiplied by a second power; and a fill engine (112) configured to fill the fill region (220) by performing a joint operation of an aggregate based on a spatial decomposition of the fill region (220), wherein each given aggregate includes a plurality of unit cell designs equal to a second power that are joined together to form the given aggregate.
  9. 9. The system of claim 8, wherein the dimension of the unit cell design (210) is measured as a dimension of a unit cell box (310) surrounding the unit cell design (210).
  10. 10. The system of claim 8 or 9, wherein the decomposition engine (110) is configured to spatially decompose the filled region (220) by: determining a unit cell count for each dimension of a fill region box (320) surrounding the fill region (220); and A second power superscript value is calculated from the unit cell count (410).
  11. 11. The system of claim 10, wherein the decomposition engine (110) is further configured to generate an aggregate for the filled region based on the calculated second power superscript value (410).
  12. 12. The system of any of claims 8 to 11, wherein the spatial decomposition engine (110) is configured to spatially decompose the filler region (220) by generating a spatial decomposition tree (520) representing the filler region (220), wherein nodes of the spatial decomposition tree (520) correspond to different second-order power boxes, and wherein a given node of the spatial decomposition tree (520) indicates whether a given second-order power box corresponding to the given node is occupied by the filler region (220), partially occupied by the filler region (220), or whether the filler region (220) is empty.
  13. 13. The system of claim 12, wherein the decomposition engine (110) is configured to generate the spatial decomposition tree (520) by determining that a particular node of the spatial decomposition tree (520) is occupied by the fill area (220) in response to determining that each child node of the particular node is occupied by the fill area (220).
  14. 14. The system of claim 12, wherein the decomposition engine (110) is configured to generate the spatial decomposition tree (520) by determining that a child node in a lowest level of the spatial decomposition tree (520) is occupied by the filling region (220) in response to determining that any portion of the filling region (220) overlaps a space covered by a second power frame corresponding to the child node.
  15. 15. A non-transitory machine-readable medium (820) comprising instructions (822, 824) which, when executed by a processor (810), cause a computing system (800) to perform the method of any of claims 1 to 7.

Description

Space decomposition-based population of unit cell designs for Computer Aided Design (CAD) objects Background Computer systems may be used to create, use, and manage data for products, items, and other objects. Examples of computer systems include computer-aided design (CAD) systems, which may include Computer Aided Engineering (CAE) systems, visualization and manufacturing systems, product data management (product data management, PDM) systems, product lifecycle management (product lifecycle management, PLM) systems, and the like. These systems may include components that facilitate design, visualization, and simulation testing of product structures and product manufacturing. Drawings In the following detailed description, certain examples are described with reference to the accompanying drawings. FIG. 1 illustrates an example of a computing system based on spatially resolved population supporting unit cell designs for CAD objects. FIG. 2 illustrates an exemplary spatial decomposition of a fill region by a decomposition engine. Fig. 3 illustrates an exemplary determination of unit cell counts for filled regions of different dimensions. FIG. 4 illustrates an exemplary calculation of a second power superscript value from a unit cell count determined for a fill region and generation of a second power box and aggregate based on the second power superscript value. Fig. 5 shows an exemplary spatial decomposition by means of a filled region of a spatial decomposition tree. FIG. 6 illustrates an exemplary generation of a fill design by spatially decomposing the fill area represented as a spatially decomposed tree. FIG. 7 illustrates an example of logic that a system may implement to support space-based decomposition-population of unit cell designs for CAD objects. FIG. 8 illustrates an example of a computing system based on spatially resolved population supporting unit cell designs for CAD objects. Detailed Description Additive manufacturing (sometimes referred to as 3-dimensional or 3-D printing) may be performed by using a 3-D printer capable of building objects layer-by-layer. By increasing additive manufacturing capabilities, it is increasingly possible to manufacture arbitrary and complex product designs. Previous manufacturing limitations have been overcome by additive manufacturing within a given design space, and product designers now have increased design freedom to support optimization of manufacturing objects. In addition, additive manufacturing can fabricate parts with unique physical properties by designing or controlling the geometry of the part, including the design of the microstructures that form the internal geometry of the object design. For objects designed to be built by additive manufacturing (and other means), repeated designs (e.g., grid structures) may provide a lightweight and efficient mechanism to form the internal geometry of the object design to meet certain physical or geometric properties. A unit cell (unit cell) design that repeats across the fill space may be used to generate a repeat design for a 1D, 2D, or 3D pattern. However, for such a redesign, instantiation of the design geometry based on the redesign element would consume a significant amount of computing resources. In some examples, population of regions of CAD objects may be performed based on unit cell designs, where instances of unit cell designs are repeated across the populated regions. As used herein, a filling operation may refer to the generation of any 1D, 2D, or 3D CAD geometry, whether as an internal geometry surrounded by a CAD surface, a surface structure that overlays the exterior of a CAD object, or any other suitable situation in which a repeating unit cell is designed to generate, instantiate, or design any geometry of a CAD object. For CAD objects represented as boundary representations (B-Rep), geometric representations, visual models, or other visual forms, performing population of CAD object regions may require performing separate join operations (e.g., boolean operations) to join each separate instance of a unit cell design together to form a filled design of CAD objects. Such joint operations can be slow and computationally intensive, as brute force stitching together individual unit cell designs may require collision assessment between each individual instance of the unit cell design for filling the design space. In particular, for each unit cell design used to populate a CAD object, brute force joint operations may require cross-computation between each facet combination. The computational complexity of such an original fill algorithm would be O (n x m), where n is the number of unit cell designs (e.g., examples) used to fill the fill area, and m is the number of facets in the unit cell designs that repeat across the fill area. Even if only a moderate number of unit cell design instances are used to populate an area, such computational complexity would be non-sustainable, and populating any relative