CN117010241A - Automatic design method for field-guided lattice structure - Google Patents

Automatic design method for field-guided lattice structure Download PDF

Info

Publication number
CN117010241A
CN117010241A CN202310909552.3A CN202310909552A CN117010241A CN 117010241 A CN117010241 A CN 117010241A CN 202310909552 A CN202310909552 A CN 202310909552A CN 117010241 A CN117010241 A CN 117010241A
Authority
CN
China
Prior art keywords
lattice
field
design
guided
points
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310909552.3A
Other languages
Chinese (zh)
Inventor
李明
郑沧平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN202310909552.3A priority Critical patent/CN117010241A/en
Publication of CN117010241A publication Critical patent/CN117010241A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • G06F30/23Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/10Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20Finite element generation, e.g. wire-frame surface description, tesselation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2113/00Details relating to the application field
    • G06F2113/10Additive manufacturing, e.g. 3D printing

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Geometry (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Graphics (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a field-guided lattice structure automatic design method. The method combines the field distribution and the lattice generation function, and realizes filling of the lattice according to the field distribution in a mode-shaped variable thickness and variable distribution manner. The application also provides a lattice structure library construction and classification method based on the inter-lattice connectibility, and provides rich lattice structure data samples for a field-guided lattice filling method. The method can process the field in the form of a function or a matrix, and the constructed lattice structure library based on the connectivity classification provides a basis for lattice mixed filling without using a transition structure. A large number of lattice data tests prove that the method can meet various general requirements.

Description

Automatic design method for field-guided lattice structure
Technical Field
The application belongs to the technical field of computer aided design, relates to a field-guided lattice filling method, and particularly relates to a field-guided lattice structure automatic design method.
Background
With the rapid development of computer aided design and additive manufacturing technology, the design requirements of lightweight complex porous microstructures are also increasing. Among the numerous porous microstructures, lattice structures have been receiving attention from the industry and academia because of their properties of easy control, high strength and light weight. In the field of computer aided design, the 3D digital model of the design lattice is closely related to the physical simulation analysis of the lattice, and the optimization design of the lattice for the physical performance requirements and manufacturing constraints becomes a key problem with higher research value. The scalar field is used as a mathematical general concept, can represent the distribution states of temperature, density, pressure and the like in a certain space in a physical system, and is a common output result in physical simulation analysis. Therefore, establishing a mapping relation from a field to a lattice generation function, and realizing an automatic design scheme of a lattice structure guided by the field are feasible methods for solving the problems.
However, the following problems exist in the prior studies: first, for field-guided lattice generation, there is a lack of systematic approach; secondly, for lattice structures, there is a lack of perfect data reserves; finally, an integrated interactive design software is needed to be realized, and the functions are encapsulated.
Disclosure of Invention
In order to solve the problems and needs, the application provides a field-guided lattice structure automatic design method, and establishes a lattice structure database based on inter-lattice connectivities classification for the method, thereby realizing a Blender-based interactive design system. The method for filling the lattice according to the field thickness and the variable distribution in the form of a matrix or a function is realized, and has higher practical value. In the process of constructing a lattice database, the application adopts the idea of symmetrically called hexahedron by tetrahedron rotation, so that the database covers most lattice samples, and accordingly, the classification method based on the inter-lattice connectibility is realized.
The technical scheme adopted by the application is as follows:
in a first aspect, an embodiment of the present application provides a field-guided lattice structure automation design method, including the steps of:
1) Determining design parameters including lattice type, field function or matrix, design area, etc.;
2) The field guiding method is designed, and a mapping relation from a field to a lattice generating method is established based on the design parameters determined in the step 1);
3) The lattice structure is automatically generated, and a three-dimensional model of the lattice structure is automatically generated by using a directed distance field (SDF) -Marving Cube algorithm based on the steps 1) -2).
In the above technical solution, the step 1) determines design parameters, specifically as follows:
before field-guided lattice design is performed, the design parameters should first be determined, the desired design parameters including lattice type, field, design area, etc. Wherein the design area is input in a three-dimensional model of obj or stl format, the field is input in a function or matrix form corresponding to the design area, and the lattice type is selected by the user from a lattice library. In order to enrich the types of crystal lattices supported by the method, the application constructs a crystal lattice structure library based on the inter-crystal connectibility classification, and the library comprises 1224 crystal lattices, and the method comprises the following steps:
in a lattice library, a lattice is defined as a cube that can be derived from a combination of 48 similar tetrahedra. Therefore, with tetrahedron as basic design unit, after determining the position and connection relation of tetrahedron design point, the overall lattice can be obtained through 48 symmetry. The 48-quarter tetrahedron is obtained by dividing a unit cube by 3 planes of symmetry orthogonal to the X, Y, Z axis and 6 planes orthogonal to a bisector between any two of the X, Y, Z three axes.
There are 15 design points available for one tetrahedral unit [15]. Respectively, the vertices { V0, V1, V2, V3} of the tetrahedron, any points { E0, E1, E2, E3, E4, E5} on the six sides, any points { F0, F1, F2, F3} on the four faces, and any point { T0} inside the tetrahedron. These 15 points have different degrees of freedom: the vertices { V0, V1, V2, V3} are not movable, each having 0 degrees of freedom; the edge points { E0, E1, E2, E3, E4, E5} are movable on each edge, each having 1 degree of freedom; the face points { F0, F1, F2, F3} are movable on each face, each having 2 degrees of freedom; the face point { T0} is movable in the body with 3 degrees of freedom.
From a simple mathematical derivation, a large number of topologies can be found to exist: if any two-to-two connection is performed on 15 design points, 105 connection possibilities are provided; the connection lines are arbitrarily selected, and the total number is up to 2 105 A topology. Most of the topological structures have low application value, so that a certain screening strategy is needed to be executed for screening the lattice structures to form a lattice library. For example, after the structure is screened according to strategies such as connectivity, no repeated edges, no suspended edges, the number of edges is not more than 3, the three-side topological structure can be used for forming the lattice library in the application by using 1224 feasible schemes.
Further, the lattice can be classified based on connectivity based on the presence of points of the lattice within the tetrahedra. The 48-symmetry partitioning method ensures that any two adjacent tetrahedrons are symmetrical about their contact surfaces, so that connectivity can be ensured inside the lattice. And also from symmetry, it can be found that the six external faces of the square are all composed of the same face of the tetrahedron, this face being called the base face of the tetrahedron. By analyzing the existence relation of the points on the bottom surface of the tetrahedron, whether the two lattices can be connected can be judged.
There are 7 points on the bottom surface of the tetrahedron, which are the vertices { V0, V1, V2}, the edge points { E0, E1, E4} and the plane point { F0}, respectively, and because the vertices { V0, V1, V2} have no degrees of freedom, their presence or absence does not affect the tetrahedron's connectivity. If the points on the bottom surfaces of the two lattices are identical, they may be structurally connected. The analysis method is applied to all lattices in the lattice library, and the lattices can be divided into 2 according to the contact surface parameter set 4 Class=16.
The field guiding method in the step 2) is designed as follows:
the main purpose of this step is to build a mapping relationship from the field to the lattice generation method, thereby realizing a field-guided lattice structure automation design method.
First, the expression of the lattice is determined, and for the field distribution c (x, y, z), x, y, z are cartesian coordinates, and the effect on lattice generation is represented by two types, namely a variable thickness distribution and a variable distribution. To achieve a field-guided lattice generation method design, it is necessary to find the mapping relationship between the field and the lattice expression. Before establishing a mapping relation, firstly carrying out linear function normalization on a field c (x, y, z) to obtain a normalized field c' (x, y, z);
increasing the guide n×c' (x, y, z) to the lattice expression with varying thickness;
where n is a constant coefficient controlling the field guiding strength.
In the case of a variable distribution, the lattice expression is adjusted: the cartesian components of x, y, z in the lattice expression are replaced with u (x, y, z), v (x, y, z), w (x, y, z), respectively,
where u (x, y, z), v (x, y, z), w (x, y, z) are functions of x, y, z determined from the field.
I.e. a field-guided lattice distribution is achieved.
The lattice structure of the step 3) is automatically generated, and the method is specifically as follows:
first, a directed distance field of the model is constructed from the model input in step 1).
Calculating a directed distance field of the lattice according to the lattice expression under the guidance of the field obtained in the step 2);
and finally, carrying out Boolean intersection on the directional distance field of the model and the directional distance field of the crystal lattice, constructing an integral directional distance field, modeling by using a Marching Cube algorithm, and generating a crystal lattice structure.
For the model with AABB bounding box size (l, w, h), the number of sampling points on the longest side of the model is designated as N l Then there is
Wherein N is l 、N w 、N h The sampling points of each side are respectively counted, and delta is the distance between adjacent sampling points.
Thus, the coordinates of each sampling point can be obtained
x i,j,k =Δ×(i-1)+x min
y i,j,k =Δ×(j-1)+y min
z i,j,k =Δ×(k-1)+z min
(1≤i≤N l ,1≤j≤N j ,1≤k≤N k )
x min 、y min 、z min Respectively the minimum values of the coordinates x, y and z of the bounding box; after the coordinates of each sampling point are determined, the directional distance between each sampling point and the surface of the model is calculated, and a directional distance field of the model can be constructed.
And (3) carrying out Boolean intersection on the model and the directional distance field of the crystal lattice, constructing an integral directional distance field, and modeling by using a Marching Cube algorithm.
For the whole directional distance field of the model after filling the crystal lattice, there is
Wherein the method comprises the steps ofDirected distance field for filling the front model +.>Is a directed distance field of the lattice.
For the expressionInequality->Indicating solids,/->Representing pores->Representing the lattice surface. />Where denotes the lattice surface, which divides the space into +.>Is an intra-lattice solid region and +.>Is defined by a plurality of outer lattice pore regions. And an interface between the two subspaces can be created through a Marching Cube algorithm, namely a model of a lattice generated after field guidance.
In a second aspect, an embodiment of the present application provides a field-guided lattice structure automation design device, including:
the design parameter acquisition module is used for determining design parameters including lattice types, field functions or matrixes and design areas;
the guiding module is used for establishing a mapping relation from a place to a lattice generation method based on the design parameters determined by the design parameter acquisition module so as to guide design;
and the lattice structure automation generation module is used for automatically generating a three-dimensional model of the lattice structure by using a directed distance field (SDF) -Maring Cube algorithm based on the design parameters determined by the design parameter acquisition module and the mapping relation determined by the guiding module.
In a third aspect, an embodiment of the present application provides a computer apparatus, including:
one or more processors;
a memory for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement any of the field-guided lattice structure automation design methods described above.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements any of the field-guided, automated lattice structure design methods described above. The beneficial effects of the application are as follows:
1) The field-guided automatic design method for the lattice structure is provided, and filling of lattices with model-type variable thickness and variable distribution is realized.
2) The method for constructing and classifying the lattice structure library based on the inter-lattice connectibility provides rich lattice structure data samples for a field-guided lattice filling method.
3) The integrated interactive design software is realized, and the functions are packaged.
Drawings
FIG. 1 is a lattice library interface for an example of a selected lattice operation;
FIG. 2 is a diagram of a similar lattice connection example of a selected lattice operation example;
FIG. 3 is a schematic diagram of the shape of a field and a functional expression;
FIG. 4 is a diagram of an example of a model to be filled;
FIG. 5 is a diagram of an example of a uniform filling of a pattern under non-field guidance;
FIG. 6 is a diagram of an example of a field-guided model-filled variable thickness lattice;
fig. 7 is a diagram of an example of model change distribution filling lattice under field guidance.
Detailed Description
The application will be further described with reference to the drawings and specific examples.
The application discloses a field-guided lattice structure automatic design method. The method combines the field and the lattice generation function, and realizes filling of the lattice in a mode of variable thickness and variable distribution according to the field. The application also provides a lattice structure library construction and classification method based on the inter-lattice connectibility, and provides rich lattice structure data samples for a field-guided lattice filling method. The method of the application can process the field distribution in the form of a function or matrix; the constructed lattice structure library based on the connectivity classification provides basis for lattice mixed filling without using transition structures. The method specifically comprises the following steps:
1) Determining design parameters, including lattice type, field function or matrix, design area, etc
The lattices can be classified into 16 kinds in total according to the inter-lattice connectivity. In the lattice library, the lattice with the same connectivity can be screened out by selecting the type in the drop-down box of the 'connectivity category' and clicking the 'query lattice', as shown in fig. 1. The same Type of lattice has better connectivity, as shown in FIG. 2 for the connection between Type1, type213, type214 belonging to Family 0.
The field is a substantial function defined in three dimensions that provides a value F (x, y, z) for each point (x, y, z) in space. In the form of x 2 +y 2 The field of c is exemplified by the shape schematic and the functional expression of the field shown in fig. 3. The fields in the application can be density fields, thermal fields, stress fields, distance fields, etc., and the method is applicable.
The model is imported in the software and the fill area is selected and design parameters are entered as shown in fig. 4.
2) The field guiding method is designed, and the mapping relation from the field to the lattice generating method is established based on the design parameters determined in the step 1)
In the unit structure of the crystal lattice, a tricycles minimum curved surface (TPMS) is a special curved surface which is periodically repeated in three dimension directions in space and has zero average curvature, the surface of the structure is smooth, holes are highly communicated, the whole structure can be accurately controlled by an implicit function, and the three-dimensional minimum curved surface (TPMS) is an excellent solution for designing and modeling a porous structure. The field-guided lattice generation method is described below by taking the P-lattice in TPMS as an example.
Taking the P lattice as an example, the original expression is
φ(x,y,z)=cos(x)+cos(y)+cos(z)+c
Where x, y, z are Cartesian components and c is a constant.
The lattice function is modified accordingly in accordance with the field input in step 1).
With field c (x, y, z) =x 2 +y 2 For example, there are
Lattice function of varying thickness
φ(x,y,z)=cos(x)+cos(y)+cos(z)+x 2 +y 2 +c
Lattice function of variable distribution
φ(x,y,z)=cos(u(x,y,z))+cos(v(x,y,z))+cos(w(x,y,z))+c
Wherein the method comprises the steps of
w(x,y,z)=z
3) The lattice structure is automatically generated, and a three-dimensional model of the lattice structure is automatically generated by using a directed distance field (SDF) -MarchingCube algorithm based on the steps 1) -2).
First, a directed distance field of the model is constructed from the model input in step 1).
The directed distance field is a three-dimensional grid structure in which each grid point stores the shortest distance value from the grid point to the boundary surface of an object, which is defined as a scalar field of distances within a cubic volume. Thus, a model can be effectively represented using a directed distance field containing three-dimensional parametric data of the model (i.e., cartesian components x, y, z and directed distance d).
For the model with AABB bounding box size (l, w, h), the number of sampling points on the longest side of the model is designated as N l Then there is
Wherein N is l 、N w 、N h The sampling points of each side are respectively counted, and delta is the distance between adjacent sampling points.
Thus, the coordinates of each sampling point can be obtained
x i,j,k =Δ×(i-1)+x min
y i,j,k =Δ×(j-1)+y min
z i,j,k =Δ×(k-1)+z min
(1≤i≤N l ,1≤j≤N j ,1≤k≤N k )
After the coordinates of each sampling point are determined, the directional distance between each sampling point and the surface of the model is calculated, and a directional distance field of the model can be constructed.
Next, a directed distance field of the lattice is calculated from the field-guided lattice expression phi (x, y, z) obtained in step 2).
For the sampling points (x, y, z), there are
d=φ(x,y,z)
d is the directed distance at the sampling point.
And finally, carrying out Boolean intersection on the model and the directional distance field of the crystal lattice, constructing an integral directional distance field, and modeling by using a Maring Cube algorithm.
For the whole directional distance field of the model after filling the crystal lattice, there is
Wherein the method comprises the steps ofDirected distance field for filling the front model +.>Is a directed distance field of the lattice.
For the expressionInequality->Indicating solids,/->Representing pores->Representing the lattice surface. />Where denotes the lattice surface, which divides the space into +.>Is an intra-lattice solid region and +.>Is defined by a plurality of outer lattice pore regions. And an interface between the two subspaces can be created through a Marching Cube algorithm, namely a model of a lattice generated after field guidance.
The field-guided lattice structure automation design results are shown in fig. 5-7. Fig. 5 is a diagram of a non-field-guided model-filled lattice example, fig. 6 is a diagram of a field-guided model-filled variable thickness lattice example, and fig. 7 is a diagram of a field-guided model-filled variable distribution lattice example, resulting in results that demonstrate the correctness and practicality of the method of the present application.
In addition, an embodiment of the present application further provides a field-guided lattice structure automation design device, including:
the design parameter acquisition module is used for determining design parameters including lattice types, field functions or matrixes and design areas;
the guiding module is used for establishing a mapping relation from a place to a lattice generation method based on the design parameters determined by the design parameter acquisition module so as to guide design;
and the lattice structure automation generation module is used for automatically generating a three-dimensional model of the lattice structure by using a directed distance field (SDF) -Maring Cube algorithm based on the design parameters determined by the design parameter acquisition module and the mapping relation determined by the guiding module.
The embodiment of the application also provides a computer device, which comprises:
one or more processors;
a memory for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement any of the field-guided lattice structure automation design methods described above.
Embodiments of the present application also provide a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs any of the field-guided, automated design methods of lattice structures described above.

Claims (10)

1. The field-guided lattice structure automatic design method is characterized by comprising the following steps of:
1) Determining design parameters including lattice type, field function or matrix, and design area;
2) The field guiding method is designed, and a mapping relation from a field to a lattice generating method is established based on the design parameters determined in the step 1);
3) The lattice structure is automatically generated, and a three-dimensional model of the lattice structure is automatically generated by using a directed distance field (SDF) -Marving Cube algorithm based on the steps 1) -2).
2. The automated field-guided lattice structure design method of claim 1, wherein step 1) determines the design parameters as follows:
before field-guided lattice design is performed, first the design parameters should be determined, the required design parameters including lattice type, field, design area, and a lattice library should be prepared; wherein the design area is input in a three-dimensional model of obj or stl format, the field is input in a function or matrix form corresponding to the design area, and the lattice type is selected by the user from a lattice library.
3. The automated field-guided lattice structure design method of claim 2, wherein preparing the library of lattices for building a library of lattice structures based on inter-lattice interconnectivity classification comprises:
in a lattice library, a lattice is defined as a cube that can be derived from a combination of 48 similar tetrahedra; therefore, the tetrahedron is taken as a basic design unit, and after the position and connection relation of the tetrahedron design point are determined, the integral lattice can be obtained through 48 symmetry; wherein the 48-quarter tetrahedron is obtained by dividing a unit cube by 3 planes of symmetry orthogonal to the X, Y, Z axis and 6 planes orthogonal to a bisector between any two of the X, Y, Z three axes;
for a tetrahedral unit, there are 15 available design points [15], respectively: vertices { V0, V1, V2, V3} of the tetrahedron, arbitrary points { E0, E1, E2, E3, E4, E5} on the six sides, arbitrary points { F0, F1, F2, F3} on the four faces, and arbitrary points { T0} inside the tetrahedron; these 15 points have different degrees of freedom: the vertices { V0, V1, V2, V3} are not movable, each having 0 degrees of freedom; the edge points { E0, E1, E2, E3, E4, E5} are movable on each edge, each having 1 degree of freedom; the face points { F0, F1, F2, F3} are movable on each face, each having 2 degrees of freedom; the face point { T0} is movable in the body, with 3 degrees of freedom;
carrying out arbitrary two-by-two connection on 15 design points, and arbitrarily selecting the connection lines to form a topological structure; screening is carried out based on a screening strategy, wherein the screening strategy comprises that the structure can be communicated, no repeated edges exist, no suspended edges exist, the number of edges is not more than 3, and the screened topological structure forms a lattice library;
further, classifying the lattice based on connectivity based on the presence of points of the lattice within the tetrahedra; the 48 symmetrical dividing method ensures that any two adjacent tetrahedrons are symmetrical about the contact surface of the tetrahedrons, so that the connectivity inside a lattice can be ensured, according to the knowledge of symmetry, six external surfaces of the cube lattice are all composed of the same surface of the tetrahedron, the surface is called as the bottom surface of the tetrahedron, and whether the two lattices can be connected can be judged by analyzing the existence relation of points on the bottom surface of the tetrahedron;
7 points are respectively arranged on the bottom surface of the tetrahedron, namely, vertexes { V0, V1 and V2}, side points { E0, E1 and E4} and a surface point { F0}, and the existence of the vertexes { V0, V1 and V2} does not influence the connectivity of the tetrahedron because the vertexes { V0, V1 and V2} do not have a degree of freedom; if the points on the bottom surface of the tetrahedron of the two lattices are identical, the two lattices can be structurally connected, and the analysis method is applied to all lattices in the lattice library, so that the lattices are classified according to the contact surface parameter set.
4. The automated field-guided lattice structure design method according to claim 1, wherein the step 2) of field-guided method design is specifically as follows:
firstly, determining an expression of a lattice, wherein for field distribution c (x, y, z), x, y and z are Cartesian coordinates, and the influence of the Cartesian coordinates on lattice generation is represented by two types of variable thickness distribution and variable distribution; to realize the design of a field-guided lattice generation method, a mapping relation between a field and a lattice expression needs to be found; before establishing a mapping relation, carrying out linear function normalization on a field c (x, y, z) to obtain a normalized field c' (x, y, z);
in the case of varying thickness, adding a guide n c' (x, y, z) to the lattice expression,
wherein n is a constant coefficient controlling the field guiding intensity;
in the case of a variable distribution, the lattice expression is adjusted: replacing the x, y, z cartesian components in the lattice expression with u (x, y, z), v (x, y, z), w (x, y, z), respectively, wherein u (x, y, z), v (x, y, z), w (x, y, z) are functions of x, y, z determined from the field c (x, y, z);
thereby a field-guided lattice distribution is achieved.
5. The method for automatically designing a field-guided lattice structure according to claim 4, wherein the step 3) is performed automatically, specifically as follows:
constructing a directed distance field of the model according to the input model to be filled;
calculating a directed distance field of the lattice according to the lattice expression under the guidance of the field obtained in the step 2);
and finally, carrying out Boolean intersection on the directional distance field of the model and the directional distance field of the crystal lattice, constructing an integral directional distance field, modeling by using a Marching Cube algorithm, and generating a crystal lattice structure.
6. The method for automated design of a field-guided lattice structure of claim 5,
for the model with AABB bounding box size (l, w, h), the number of sampling points on the longest side of the model is designated as N l Then there is
Wherein N is l 、N w 、N h The sampling points of each side are respectively counted, and delta is the distance between adjacent sampling points;
thus, the coordinates of each sampling point can be obtained
x i,j,k =Δ×(i-1)+x min
y i,j,k =Δ×(j-1)+y min
z i,j,k =Δ×(k-1)+z min
(1≤i≤N l ,1≤j≤N j ,1≤k≤N k )
x min 、y min 、z min Respectively the minimum values of the coordinates x, y and z of the bounding box; after the coordinates of each sampling point are determined, the directional distance between each sampling point and the surface of the model is calculated, and a directional distance field of the model can be constructed.
7. The automated field-guided lattice structure design method of claim 5, wherein the boolean intersection of the model and the directed distance field of the lattice is performed to construct an integrated directed distance field, and the modeling is performed using the Marching Cube algorithm, for the integrated directed distance field of the lattice-filled model, there are
Wherein the method comprises the steps ofDirected distance field for filling the front model +.>A directed distance field that is a lattice;
for the expressionInequality->Indicating solids,/->Representing pores->Representing a lattice surface;where denotes the lattice surface, which divides the space into +.>Is an intra-lattice solid region and +.>Is a lattice outer pore region of (a); and an interface between the two subspaces can be created through a Marching Cube algorithm, namely a model of a lattice generated after field guidance.
8. A field-guided lattice structure automation design device, comprising:
the design parameter acquisition module is used for determining design parameters including lattice types, field functions or matrixes and design areas;
the guiding module is used for establishing a mapping relation from a place to a lattice generation method based on the design parameters determined by the design parameter acquisition module so as to guide design;
and the lattice structure automation generation module is used for automatically generating a three-dimensional model of the lattice structure by using a directed distance field (SDF) -Maring Cube algorithm based on the design parameters determined by the design parameter acquisition module and the mapping relation determined by the guiding module.
9. A computer device, the computer device comprising:
one or more processors;
a memory for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the field-guided lattice structure automation design method of any one of claims 1-7.
10. A computer readable storage medium having stored thereon a computer program, which when executed by a processor implements a field-guided, automated design method of a lattice structure according to any one of claims 1-7.
CN202310909552.3A 2023-07-24 2023-07-24 Automatic design method for field-guided lattice structure Pending CN117010241A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310909552.3A CN117010241A (en) 2023-07-24 2023-07-24 Automatic design method for field-guided lattice structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310909552.3A CN117010241A (en) 2023-07-24 2023-07-24 Automatic design method for field-guided lattice structure

Publications (1)

Publication Number Publication Date
CN117010241A true CN117010241A (en) 2023-11-07

Family

ID=88566587

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310909552.3A Pending CN117010241A (en) 2023-07-24 2023-07-24 Automatic design method for field-guided lattice structure

Country Status (1)

Country Link
CN (1) CN117010241A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117494245A (en) * 2023-11-13 2024-02-02 香港纺织及成衣研发中心有限公司 Wearing protective clothing modeling method, system, electronic equipment and readable storage medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117494245A (en) * 2023-11-13 2024-02-02 香港纺织及成衣研发中心有限公司 Wearing protective clothing modeling method, system, electronic equipment and readable storage medium

Similar Documents

Publication Publication Date Title
Biancolini Fast radial basis functions for engineering applications
Jabi et al. Enhancing parametric design through non-manifold topology
US10121279B1 (en) Systems and methods for generating a mesh
Thompson et al. Handbook of grid generation
CN102306396B (en) Three-dimensional entity model surface finite element mesh automatic generation method
Al Akhras et al. Isogeometric analysis-suitable trivariate NURBS models from standard B-Rep models
CN100468418C (en) Method and program for generating volume data from boundary representation data
CN113689556B (en) Block self-adaptive Cartesian grid quick map mapping method and system
CN108647370A (en) Unmanned helicopter Optimization Design for Aerodynamic method based on bicyclic iteration
CN111768502A (en) Non-structural grid two-dimensional flood simulation system based on GPU acceleration technology
CN117010241A (en) Automatic design method for field-guided lattice structure
Andreoli et al. Free-form-deformation parameterization for multilevel 3D shape optimization in aerodynamics
CN111489447B (en) Right-angle grid adaptive modeling method suitable for lattice Boltzmann method
Anderson et al. Smooth, volume-accurate material interface reconstruction
Castillo et al. FEMSTER: An object-oriented class library of high-order discrete differential forms
Wang et al. Hierarchical combinatorial design and optimization of non-periodic metamaterial structures
CN104794133A (en) Conversion algorithm from CAD model to MCNP geometric model based on STEP text
CN113191016B (en) Body expression model-based multi-material product modeling and analyzing integrated method
Mousel A massively parallel adaptive sharp interface solver with application to mechanical heart valve simulations
Schmidt et al. Extended isogeometric analysis of multi-material and multi-physics problems using hierarchical B-splines
CN110532670A (en) The suitable analysis batten physical model construction method of one kind and system
Shephard et al. The versatility of automatic mesh generators based on tree structures and advanced geometric constructs
Lewis et al. Aspects of adaptive mesh generation based on domain decomposition and Delaunay triangulation
CN111079279A (en) Multi-scale topological optimization design method for multi-configuration lattice structure
CN109977551A (en) A kind of lattice material modeling method based on NURBS

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination