CN113524686B - 3D printing model partitioning method - Google Patents
3D printing model partitioning method Download PDFInfo
- Publication number
- CN113524686B CN113524686B CN202011501817.9A CN202011501817A CN113524686B CN 113524686 B CN113524686 B CN 113524686B CN 202011501817 A CN202011501817 A CN 202011501817A CN 113524686 B CN113524686 B CN 113524686B
- Authority
- CN
- China
- Prior art keywords
- group
- models
- area
- model
- space
- 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.)
- Active
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/30—Auxiliary operations or equipment
- B29C64/386—Data acquisition or data processing for additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/20—Apparatus for additive manufacturing; Details thereof or accessories therefor
- B29C64/245—Platforms or substrates
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y30/00—Apparatus for additive manufacturing; Details thereof or accessories therefor
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y50/00—Data acquisition or data processing for additive manufacturing
Landscapes
- Chemical & Material Sciences (AREA)
- Engineering & Computer Science (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- Mechanical Engineering (AREA)
- Optics & Photonics (AREA)
- Stacking Of Articles And Auxiliary Devices (AREA)
Abstract
The invention discloses a 3D printing model partitioning method, which comprises the following steps: (1) Grouping the models according to a preset category to obtain a grouping list mList of the models; (2) calculating the appearance contour dimension of each group of models; (3) Sorting the models according to the outline size of each group of models, and setting a grouping principle; (4) calculating the length and width of the grouping model; (5) Calculating the specific position of each group to complete the model placement; (6) When no packet is put in, the areas of all the packets are readjusted to carry out a new round of partition. After the models are grouped, the outline size of each group of models is calculated, then the area of each group is iteratively adjusted by combining the area of the printing platform and the printing height of each group of models, the position of the starting point of each group is set, and the purpose of automatic partition arrangement is achieved.
Description
Technical Field
The invention belongs to the field of 3D printing, and particularly relates to a 3D printing model partitioning method.
Background
The 3D printer constructs a three-dimensional model through an additive manufacturing method, the models are frequently required to be arranged in groups according to purposes, materials and the like in the 3D printer and are printed on a printing platform, and after printing is completed, the 3D printing models can be conveniently taken out according to the groups. The existing 3D printer usually uses manual grouping, arrangement and combination, so that time and labor are wasted, and the space of a printing platform is difficult to be fully utilized.
Disclosure of Invention
The invention aims to provide a 3D printing model partitioning method, which can automatically partition a model after a model file is imported, can place the most models on a printing platform as far as possible, maximally utilizes the space of the printing platform and improves the utilization rate of a 3D printer.
In order to solve the technical problem, the invention adopts the following technical scheme:
the 3D printing model partition method is characterized by comprising the following steps of:
(1) Grouping according to the preset types of the models to obtain a grouping list mList of the models;
(2) Calculating the appearance contour dimension of each group of models;
(3) Sorting the models according to the outline size of each group of models, and setting a grouping principle;
(4) Calculating the length and width of the grouping model;
(5) Calculating the specific position of each group to complete the model placement;
(6) When no grouping is put in, the areas of all the groupings are readjusted to carry out a new round of partitioning.
After the models are grouped, the appearance outline size of each group of models is calculated, then the area of each group is iteratively adjusted by combining the area of the printing platform and the printing height of each group of models, and the starting point position of each group is set, so that the purpose of automatic partition arrangement is achieved.
Further, in the step (2), the appearance contour size is the sum S of the minimum size min and the maximum base area of each model. Determining the minimum size of each group of models ensures that the largest group of models can fit in.
Further, in the step (2), the minimum size min is the maximum value of the sizes in the x, y, z directions in the same group of models, the model M is set, the size of the model M is x < y < z, if M can rotate around x, y, z by 90 degrees, 180 degrees, 270 degrees, the maximum size of the model M is z, if M can only rotate around z by 90 degrees, 180 degrees, 270 degrees, the maximum size of the model M is y, and the minimum size min of the group of models is obtained by comparing the maximum sizes of the models in the same group.
Because the models are different in shape, the placement of some models on the printing platform cannot be limited by the shape of the models, and the models can rotate by 90, 180 and 270 degrees around x, y and z; and if some models need to be placed on the printing platform in a specific direction, the models can only rotate by 90, 180 and 270 degrees around z. Whether the model needs to be placed in a specific direction or not is set by the user requirement. If the model placing direction is not limited, the model placing direction can be adjusted. And determining the minimum size of the packet by comparing the maximum size in the model in one packet, and ensuring that the model with the maximum size in the packet can be put in.
Further, in the step (3), the sorting method is to sequentially sort the mList according to the models in each group in the order of the size, the bottom area and the number of the models from large to small, and only use the remaining space after the placement of other groups for the group GLast with the largest size. Arranging the models according to specific parameters can ensure that the group put in each time is the group with the largest size. While the largest sized group of glasts is placed using the remaining space.
Further, the length and width of each group except the volume maximum group blast are calculated.
Further, in the step (4), the concrete steps are as follows:
setting the size of the printing platform as cx and cy, and setting the area of the printing platform as sc = cx x cy;
calculating the sum V of the volumes of all the models, and calculating the sum vi of the model volumes of each group, wherein the area si = lambda x vi/V, lambda is an area coefficient, and the initial value is 1;
calculating the length of the packet gx = sqrt (si);
width of packet gy = gx cy/cx;
if gx, gy are smaller than the minimum size, min is set.
And according to the proportion between the sum vi of the model volume of each group and the sum V of the volumes of all the models, keeping the height of the models of each area close to each other when the models are placed as much as possible, thereby setting the length and the width of each group and determining the area position of each group on the printing platform.
Further, in the step (5), the concrete steps are as follows:
a. taking a first group g0 from the group list, setting the initial position of g0 as p (0, 0), dividing the platform into an upper residual space, an occupied area and a right residual space, and putting the residual spaces into a residual space stack according to the sequence of the upper part and the right part;
b. taking out a residual space from the residual space stack, taking a group g to be put in from the group list, if the area of the g is smaller than that of the right residual space, putting the group g into the residual space, dividing the residual space into an upper residual space and a right residual space again, pressing the group g into the space stack, and if the area of the group g is larger than that of the residual space, waiting for the next putting in;
c. after the left space on the right is put, the group g to be put is taken from the group list, if the area of the group g is smaller than that of the left space on the upper part on the rightmost side, the group g is put into the left space on the upper part on the rightmost side, if the area of the group g is larger than that of the left space on the right side, the group g is put into the left space on the upper part on the rightmost side, the next time is waited, and the group g to be put is put into different left spaces from right to left in sequence;
d. when the stack of the remaining space is empty, or all the packets are put in, one arrangement is completed.
And putting the first grouped model in the grouped list into an occupied area at the lower left corner, wherein the top of the occupied area is the upper residual space, the right of the occupied area is the right residual space, and the upper residual space and the right residual space are put into a residual space stack. When the second grouped model is placed in, the area of the second grouped model is compared with the area of the right residual space, if the area of the second grouped model is smaller than the area of the right residual space, the second grouped model is placed in the right residual space and is close to the occupied area of the first grouped model to form a new occupied area, and meanwhile, the right residual space is divided into a new upper residual space and a new right residual space again and is pressed into a space stack. And repeating the step for the next group, sequentially putting the next group into the left space on the right, and after the left space on the right is put, putting the rest groups into the left space on the upper part according to the sequence from right to left until the arrangement is finished. The arrangement method maximally utilizes the printing platform, and the printing platform can lay the models with the most one-time performance.
Further, in the step (5), the steps b and c further include the steps of:
adjustment of length and width of packet g at the time of insertion: if the area Sg of the group g is different from the residual space area by +/-10%, adjusting the length and the width of the newly-placed group g to enable the group g and the adjacent area to be arranged flatly; if the put packet is the right remaining space, the adjustment width w = Sg/right _ h, right _ h is the height of the right remaining space, and w must be larger than the maximum size of the packet; if the put packet is an upper remaining space and the height of the upper remaining space up _ h is less than the height of Sg is greater than the minimum size of Sg, w = Sg/up _ h. The step can lead the arrangement among different groups to be more compact and reduce the wasted space by adjusting the length and the width of the group g.
Further, in the step (6), the adjusting method comprises: and (5) adjusting the numerical value of the area coefficient lambda, repeating the step (4) and the step (5), finishing grouping if all the grouping models are put in, and continuously adjusting the numerical value of the area coefficient lambda if any grouping model is not put in. When the grouping is arranged for the first time, all models cannot be put in, the area coefficient lambda is modified, the area of each grouping is reduced, and more models can be put in.
Further, the area coefficient lambda is reduced according to a fixed rule, and when the lambda is reduced to a threshold lambda min And if the grouping model is not put in, directly quitting, and the grouping model which is not put in does not print at this time. Lambda [ alpha ] min Can be set according to the parameters of the printer itself, usually lambda min Between 0.2 and 0.8.
Due to the adoption of the technical scheme, the invention has the following beneficial effects:
the model can be automatically partitioned after the model file is led in, the most models can be placed on the printing platform as much as possible, the space of the printing platform is utilized to the maximum extent, and the utilization rate of the 3D printer is improved. After the models are grouped, the outline size of each group of models is calculated, then the area of each group is iteratively adjusted by combining the area of the printing platform and the printing height of each group of models, the position of the starting point of each group is set, and the purpose of automatic partition arrangement is achieved. And determining the minimum size of the packet by comparing the maximum size in the model in one packet, and ensuring that the model with the maximum size in the packet can be put in. And according to the proportion between the sum vi of the model volumes of each group and the sum V of the volumes of all the models, keeping the model of each area to be similar in height when being placed as much as possible, thereby setting the length and the width of each group and determining the area position of each group on the printing platform.
Drawings
The invention is further illustrated below with reference to the accompanying drawings.
FIG. 1 is a region where the printing platform is distributed in step (5) a;
FIG. 2 is a region of the printing platform during step (5) b;
fig. 3 is a region where the printing platforms are distributed at step (5) c.
Detailed Description
The 3D printing model partitioning method comprises the following steps:
(1) Grouping the models according to the final use to obtain a grouping list mList of the models;
(2) Calculating the sum S of the minimum size min of each group of models and the maximum base area of each model:
the minimum size min is the maximum value of the sizes in the x, y and z directions in the same group of models, the model M is set, the size of the model M is x < y < z, if the M can rotate around the x, y and z by 90 degrees, 180 degrees and 270 degrees, the maximum size of the model M is z, if the M can only rotate around the z by 90 degrees, 180 degrees and 270 degrees, the maximum size of the model M is y, and the minimum size min of the group of models is obtained by comparing the maximum sizes of the models in the same group.
Because the models are different in shape, the placement of some models on the printing platform cannot be limited by the shape of the models, and the models can rotate by 90, 180 and 270 degrees around x, y and z; and if some models need to be placed on the printing platform in a specific direction, the models can only rotate by 90, 180 and 270 degrees around z. Whether the model needs to be placed in a specific direction or not is set by the user requirement. If the model placing direction is not limited, the model placing direction can be adjusted. And determining the minimum size of the packet by comparing the maximum size in the model in one packet, and ensuring that the model with the maximum size in the packet can be put in.
(3) Arranging mLists according to models in each group in turn according to the sequence of the size, the bottom area and the number of the models from large to small, setting the principle of model grouping, and only utilizing the residual space after the placement of other groups for the grouped GLAst with the largest size;
(4) Calculate the length and width of each packet except for GLast:
setting the size of the printing platform as cx and cy, and the area of the printing platform as sc = cx cyc;
calculating the sum V of the volumes of all the models, and calculating the sum vi of the model volumes of each group, wherein the area si = lambda x vi/V, lambda is an area coefficient, and the initial value is 1;
calculating the length of the packet gx = sqrt (si);
width of packet gy = gx cy/cx;
if gx, gy are smaller than the minimum size, min is set.
And according to the proportion between the sum vi of the model volumes of each group and the sum V of the volumes of all the models, keeping the model of each area to be similar in height when being placed as much as possible, thereby setting the length and the width of each group and determining the area position of each group on the printing platform.
(5) Calculating the specific position of each group, and completing the placement of the model:
a. as shown in fig. 1, a first group g0 is taken from the group list, the initial position of g0 is set as p (0, 0), the platform is divided into an upper residual space, an occupied area and a right residual space, and the residual spaces are put into a residual space stack in the order of up and right;
b. as shown in fig. 2, a remaining space is taken out from the remaining space stack, a group g to be put is taken out from the group list, if the area of g is smaller than the area of the right remaining space, the group g is put into the remaining space, if the area of the group g is different from the area of the right remaining space by ± 10%, the length and width of the newly put group g are adjusted, the adjustment width w = Sg/right _ h, right _ h is the height of the right remaining space, and w must be larger than the maximum size of the group thereof to make the group and the adjacent area arranged flat;
meanwhile, the residual space is divided into an upper residual space and a right residual space again, the upper residual space and the right residual space are pressed into a space stack, and if the area of the space stack is larger than that of the residual space, the next time of putting the space stack is waited;
c. as shown in fig. 3, after the right remaining space is completely placed, there are still groups to be placed, one group g to be placed is taken from the group list, if the area of g is smaller than the area of the upper remaining space located on the rightmost side, the group g is placed in the upper remaining space located on the rightmost side, if the area of the group g and the area of the upper remaining space differ by ± 10%, the length and width of the newly placed group g are adjusted, and if the height upH of the upper remaining space is smaller than the height of Sg and is greater than the minimum size of Sg, w = Sg/upH;
if the area is larger than that of the left remaining space, waiting for next putting, and putting the groups to be put into different upper remaining spaces from right to left in sequence;
d. when the stack of the remaining space is empty, or all the packets are put in, one arrangement is completed.
And putting the first grouped model in the grouped list into an occupied area at the lower left corner, wherein the top of the occupied area is the upper residual space, the right of the occupied area is the right residual space, and the upper residual space and the right residual space are put into a residual space stack. And when the second grouped model is placed, comparing the area of the second grouped model with the area of the right residual space, if the area of the second grouped model is smaller than the area of the right residual space, placing the second grouped model into the right residual space, closing to the occupied area of the first grouped model to form a new occupied area, and meanwhile, subdividing the right residual space into a new upper residual space and a new right residual space to be pressed into the space stack. And repeating the step for the next group, sequentially putting the next group into the left space on the right, and after the left space on the right is put, putting the rest groups into the left space on the upper part according to the sequence from right to left until the arrangement is finished. The arrangement method maximally utilizes the printing platform, and the printing platform can lay the models with the most one-time performance.
(6) When there are no packets to put in, the area of all packets needs to be readjusted: repeating the step (4) and the step (5) by setting the lambda = lambda-0.05; when lambda reaches a threshold lambda min When =0.4, stillAnd when a group is not put in, directly quitting, and the group model which is not put in does not print at this time. When the grouping is arranged for the first time, all models cannot be put in, the area coefficient lambda is modified, the area of each grouping is reduced, and more models can be put in.
The above is only a specific embodiment of the present invention, but the technical features of the present invention are not limited thereto. Any simple changes, equivalent substitutions or modifications made on the basis of the present invention to solve the same technical problems and achieve the same technical effects are all covered in the protection scope of the present invention.
Claims (5)
- The 3D printing model partition method is characterized by comprising the following steps:(1) Grouping according to the preset types of the models to obtain a grouping list mList of the models;(2) Calculating the appearance contour dimension of each group of models;(3) Sorting the models according to the external contour size of each group of models, wherein the sorting method is that mLists are sequentially sorted according to the models in each group in the order of the size, the bottom area and the number of the models from large to small, and for the group GLAst with the largest size, only the residual space after the other groups are placed is utilized;(4) Calculate the length and width of each subgroup except the volume-maximal subgroup GLast: setting the size of the printing platform as cx and cy, and the area of the printing platform as sc = cx cyc; calculating the sum V of the volumes of all the models, and calculating the sum vi of the model volumes of each group, wherein the area si = lambda x vi/V, lambda is an area coefficient, and the initial value is 1; calculating the length of the packet gx = sqrt (si); width of packet gy = gx cy/cx; if gx, gy are smaller than the minimum size, min is set;(5) Calculating the specific position of each group, and completing the placement of the model:a. taking a first group g0 from the group list, setting the initial position of g0 as p (0, 0), dividing the platform into an upper residual space, an occupied area and a right residual space, and putting the residual spaces into a residual space stack according to the sequence of the upper part and the right part;b. taking out a right residual space from the residual space stack, taking a group g to be put in from the group list, if the area of the group g is smaller than that of the right residual space, putting the group g into the right residual space, dividing the right residual space into an upper part and a right part again, pressing the upper part and the right part into the space stack, and if the area of the group g is larger than that of the right residual space, waiting for putting in next time;c. after the left space on the right is put, taking a group g to be put from the group list, if the area of the group g is smaller than that of the left space on the upper part on the rightmost side, putting the group g into the left space on the upper part on the rightmost side, and if the area of the group g is larger than that of the left space on the right side, waiting for the next putting, and putting the group g to be put into different left spaces from right to left in sequence;d. when the stack of the residual space is empty or all the groups are put in, finishing one-time arrangement;(6) When no packet is put in, the area of all packets is readjusted: and (5) adjusting the numerical value of the area coefficient lambda, repeating the step (4) and the step (5), finishing grouping if all the grouping models are put in, and continuously adjusting the numerical value of the area coefficient lambda if any grouping model is not put in.
- 2. The 3D printing model partitioning method according to claim 1, wherein: in the step (2), the appearance contour size is the sum S of the minimum size min and the maximum bottom area of each model.
- 3. The 3D printing model partitioning method according to claim 2, wherein: in the step (2), the minimum size min is the maximum value of the sizes in the x, y and z directions in the same group of models, a model M is set, the size of the model M is x < y < z, if M can rotate around x, y and z by 90, 180 and 270 degrees, the maximum size of the model M is z, if M can only rotate around z by 90, 180 and 270 degrees, the maximum size of the model M is y, and the minimum size min of the group of models is obtained by comparing the maximum sizes of the models in the same group.
- 4. The 3D printing model partitioning method according to claim 1, wherein: in the step (5), the steps b and c further comprise the following steps: adjustment of length and width of packet g at the time of insertion: if the area Sg of the group g is different from the residual space area by +/-10%, adjusting the length and the width of the newly-placed group g to enable the group g and the adjacent area to be arranged flatly; if the put packet is the right remaining space, the adjustment width w = Sg/right _ h, right _ h is the height of the right remaining space, and w must be larger than the maximum size of the packet; if the put packet is an upper remaining space and the height of the upper remaining space up _ h is less than the height of Sg is greater than the minimum size of Sg, w = Sg/up _ h.
- 5. The 3D printing model partitioning method according to claim 1, wherein: the area coefficient lambda is reduced according to a fixed rule, and when the lambda is reduced to a threshold lambda min And if the grouping model is not put in, directly quitting, and the grouping model which is not put in does not print at this time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011501817.9A CN113524686B (en) | 2020-12-17 | 2020-12-17 | 3D printing model partitioning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011501817.9A CN113524686B (en) | 2020-12-17 | 2020-12-17 | 3D printing model partitioning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113524686A CN113524686A (en) | 2021-10-22 |
| CN113524686B true CN113524686B (en) | 2023-03-28 |
Family
ID=78124220
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011501817.9A Active CN113524686B (en) | 2020-12-17 | 2020-12-17 | 3D printing model partitioning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113524686B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113946987B (en) * | 2021-12-20 | 2022-03-22 | 浙江闪铸三维科技有限公司 | 3D model nesting and placing method based on model similarity |
| CN114419301A (en) * | 2022-01-29 | 2022-04-29 | 上海漫格科技有限公司 | Three-dimensional model two-dimensional nesting placement method based on three-dimensional printing |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1220625A1 (en) * | 1999-10-08 | 2002-07-10 | Rapid Design Technologies (Pty) Limited | Die manufacturing |
| WO2018226642A1 (en) * | 2017-06-06 | 2018-12-13 | Organofab Technologies, Inc. | Method and apparatus for a tissue engineering system |
| WO2019062143A1 (en) * | 2017-09-30 | 2019-04-04 | 浙江大学 | Three-dimensional printing method |
| CN110001066A (en) * | 2019-05-22 | 2019-07-12 | 浙江大学 | A kind of minimum subregion filling direction of 3 D-printing determines method |
| CN110193603A (en) * | 2019-06-25 | 2019-09-03 | 鑫精合激光科技发展（北京）有限公司 | A kind of selective laser fusing partition method based on length of scanning line optimization |
| CN110209363A (en) * | 2019-05-30 | 2019-09-06 | 大连理工大学 | Intelligent 3D printing paths planning method based on genetic algorithm |
| CN110714199A (en) * | 2019-09-11 | 2020-01-21 | 福建工程学院 | Method for preparing coating by using 3D printing and lapping electron beam |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10025882B2 (en) * | 2012-08-14 | 2018-07-17 | Disney Enterprises, Inc. | Partitioning models into 3D-printable components |
| US10061870B2 (en) * | 2014-03-18 | 2018-08-28 | Palo Alto Research Center Incorporated | Automated metrology and model correction for three dimensional (3D) printability |
| US10289755B2 (en) * | 2015-01-30 | 2019-05-14 | Technology Research Association For Future Additive Manufacturing | Three-dimensional fabricating system, information processing apparatus, three-dimensional fabricating model arrangement method, and three-dimensional fabricating model arrangement program |
-
2020
- 2020-12-17 CN CN202011501817.9A patent/CN113524686B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1220625A1 (en) * | 1999-10-08 | 2002-07-10 | Rapid Design Technologies (Pty) Limited | Die manufacturing |
| WO2018226642A1 (en) * | 2017-06-06 | 2018-12-13 | Organofab Technologies, Inc. | Method and apparatus for a tissue engineering system |
| WO2019062143A1 (en) * | 2017-09-30 | 2019-04-04 | 浙江大学 | Three-dimensional printing method |
| CN110001066A (en) * | 2019-05-22 | 2019-07-12 | 浙江大学 | A kind of minimum subregion filling direction of 3 D-printing determines method |
| CN110209363A (en) * | 2019-05-30 | 2019-09-06 | 大连理工大学 | Intelligent 3D printing paths planning method based on genetic algorithm |
| CN110193603A (en) * | 2019-06-25 | 2019-09-03 | 鑫精合激光科技发展（北京）有限公司 | A kind of selective laser fusing partition method based on length of scanning line optimization |
| CN110714199A (en) * | 2019-09-11 | 2020-01-21 | 福建工程学院 | Method for preparing coating by using 3D printing and lapping electron beam |
Non-Patent Citations (1)
| Title |
|---|
| "3D打印系统中模型放置优化方法研究";吴兴欢;《优秀硕士学位论文全文库》;20180115;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113524686A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113524686B (en) | 3D printing model partitioning method | |
| CN103916869B (en) | A kind of determination method and device of route network coverage | |
| CN103763208B (en) | Data traffic method for limiting and device | |
| CN108255489A (en) | Front-end interface code generating method, device, electronic equipment and storage medium | |
| CN108750685A (en) | A kind of mixing palletizing method and system offline | |
| CN105654552B (en) | A kind of quick Delaunay network construction methods towards Arbitrary distribution large-scale point cloud data | |
| CN107705589A (en) | Bicyclic signal timing optimization method based on self-adapted genetic algorithm | |
| CN107547184A (en) | A kind of dynamic pilot allocation method in extensive mimo system | |
| CN107539155A (en) | Electrical bicycle charging method, apparatus and system | |
| CN105404761A (en) | Method and system for generating tile paving scheme | |
| CN109104731A (en) | Construction method, device and the computer equipment of cell scenario category classification model | |
| CN108381905A (en) | 3D printing color rendering method and device based on the diffusion of Octree error | |
| CN108688144A (en) | Model printing method of 3D printer | |
| CN105260351A (en) | Online self-service presswork design method based on self-adaptive template | |
| CN115311452A (en) | Precise glue filling evaluation method and system based on machine vision | |
| CN105353650B (en) | Foundation temporarily rushes formula Asia across the super preset aperture model method of across the flow field pressure regulator valve in wind-tunnel Asia | |
| CN106864873A (en) | A kind of sheet material subpackage optimization method | |
| CN207290766U (en) | A kind of flow passage structure applied to light guide plate compression mold | |
| CN108382639A (en) | A kind of pneumatic coating method of charger | |
| CN105930568B (en) | The cluster of particle discrete element analysis construction method of arbitrary shape convex polyhedron aggregate | |
| CN102130050B (en) | Multi-project wafer cutting method supporting constraint and limitation on positions of chips | |
| CN108897912B (en) | Hole decorative plate design and arrangement method based on circular piles | |
| CN114313892A (en) | Automatic stacking method and device for multiple types of straight refractory bricks | |
| CN113822526A (en) | Site index adaptive checking method for commercial land in controlled detailed planning stage | |
| CN106776042A (en) | The memory allocation method and device of terminal |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |