CN113192176A - Generation method of variable-density 3D printing filling path - Google Patents
Generation method of variable-density 3D printing filling path Download PDFInfo
- Publication number
- CN113192176A CN113192176A CN202110402183.XA CN202110402183A CN113192176A CN 113192176 A CN113192176 A CN 113192176A CN 202110402183 A CN202110402183 A CN 202110402183A CN 113192176 A CN113192176 A CN 113192176A
- Authority
- CN
- China
- Prior art keywords
- bounding box
- area
- printing
- density
- filling
- 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.)
- Granted
Links
- 238000010146 3D printing Methods 0.000 title claims abstract description 15
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000007639 printing Methods 0.000 claims abstract description 23
- 230000000694 effects Effects 0.000 abstract description 3
- 230000002708 enhancing effect Effects 0.000 abstract 1
- 239000000463 material Substances 0.000 description 7
- 238000010586 diagram Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 239000007921 spray Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T19/00—Manipulating 3D models or images for computer graphics
- G06T19/20—Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P10/00—Technologies related to metal processing
- Y02P10/25—Process efficiency
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Graphics (AREA)
- Software Systems (AREA)
- General Physics & Mathematics (AREA)
- Geometry (AREA)
- Architecture (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Chemical & Material Sciences (AREA)
- Manufacturing & Machinery (AREA)
- Materials Engineering (AREA)
Abstract
The invention provides a method for generating a variable-density 3D printing filling path, which comprises the steps of establishing a three-dimensional model, reading data and layering slices to obtain the section outline of each layer; obtaining the minimum bounding box of the inner and outer contours of the cross section of each layer; calculating the area of each bounding box and the side length of the maximum side of each bounding box; generating a square containing a cross section outline by taking the length of the long side of the bounding box as the side length, and generating an H i l bert curve by taking the lower right corner of the square as a generating element starting point; calculating the area difference set S of the minimum bounding box of all the inner and outer contours in the modeliMinimum value of SminAnd a maximum value Smax(ii) a The above-mentioned SminAnd SmaxAll S in betweeniDivided into three intervals according to SiDynamically adjusting the recursion depth of the H i l bert curve in the located interval; by cross-sectional profile cross-fillingAnd (5) filling a curve for cutting, and finally deriving a G-code for model printing. The invention has the effects of changing the filling density of different parts in the model, enhancing the local mechanical property of the model, improving the printing efficiency and reducing the printing cost.
Description
Technical Field
The invention belongs to the technical field of 3D printing, and relates to a method for generating a variable-density 3D printing filling path.
Background
3D printing is favored by various industries because of its advantages of convenient operation, abundant material types, low cost, printing without model shape limitation, etc. Therefore, the application of the composite material in the industries of machinery, medicine, automobiles, construction, aviation, toys and the like is more and more extensive. Wherein the filling path planning in the printing process directly influences the printing efficiency and the printing quality of the model.
The problems existing in the current 3D printing technology mainly include the following two points: (1) the spray head executes the path information, and the time and space walking path is long, the path is not connected, the starting and stopping times are more, and the printing efficiency is influenced. (2) The mechanical property of the printing model is not high, when the model is sliced, the printing efficiency is greatly reduced by setting a large filling rate, more materials are consumed, a small filling rate is set, and for an irregular model, a part with a small cross section area becomes a weak link, so that the strength of the whole model is reduced, and the model is necessary to be locally enhanced.
It is noted that this section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Disclosure of Invention
The invention aims to provide a method for generating a variable-density 3D printing filling path, which improves the filling density of a weak part of a model and also improves the printing efficiency and the mechanical property of a printed product.
In order to achieve the purpose, the invention adopts the following technical scheme:
the method for generating the variable-density 3D printing filling path comprises the following steps of:
s1: establishing a three-dimensional model, reading data, slicing and layering to obtain an inner contour M of each layer of sectioniAnd an outer contour LiWherein i is 0,1,2, … … n;
s2: calculating the minimum bounding box A of the outer contour of each layer sectioniWith the smallest bounding box B of the inner contouriRecalculating the two bounding boxes of the planeDifference in area, denoted as SiWherein i is 0,1,2, … … n;
s3: computing the area difference set S of all layer bounding boxes in the modeliMinimum value of SminAnd a maximum value Smax；
S4: calculate each outer contour bounding box LiLongest side X ofmaxWith the longest side XmaxThe length of the square to be filled is determined as the side length and comprises the section outline;
s5: calculating the minimum area SminAnd maximum area SmaxDifference StWith St3 and 2StA/3 is a section node, and SiIs divided into three sections according to the size, according to SiDynamically adjusting the recursion depth and the area difference S of the Hilbert curveiThe smaller the recursion depth is, the larger the recursion depth is, and the smaller the unit step length is, drawing a Hilbert curve in the range of the square to be filled and storing a coordinate point of the Hilbert curve;
s6: and offsetting the section outline, cutting the filling curve by using the offset section outline, and finally deriving the G-code for model printing.
Further, the step S2 is specifically:
after layering, each layer is cut, and the minimum bounding box A of the outer contour and the inner contour of the layer is calculatediAnd BiAnd calculate AiAnd BiThe difference in area of (a) is denoted as SiMarking and storing to obtain bounding box area difference value set { S }0，S1，S2，……Si}。
Further, the step S3 is specifically:
for the bounding box difference set S in step S2iSorting and determining the maximum value SmaxAnd minimum value Smin。
Further, the step S4 is specifically:
and calculating the longest edge of the outer contour bounding box, generating a range of the square to be filled containing the cross-sectional outline by taking the length of the longest edge as the edge length, iterating the Hilbert generation element function by taking the right lower corner of the square as a starting point to draw a Hilbert curve, and storing the coordinate point of the Hilbert curve.
Further, the three sections in step S5 are:
the interval is a high-density filling area;
the interval is a medium-density filling area;
the interval is a low density filling area.
The invention has the beneficial effects that:
according to the method for generating the variable-density 3D printing filling path, the Hilbert curve is used as the filling path, so that a coherent printing path is formed, nozzle skipping is reduced, and printing efficiency is improved; the unit step length of the filling curves of different sections can be dynamically adjusted according to the section outline size of the model, so that the effect of variable-density filling is achieved, the effect of local enhancement is achieved to a certain extent, the consumption of materials is reduced, and the printing efficiency is improved.
Drawings
FIG. 1 is a model schematic of an embodiment of the invention;
FIG. 2(a) is a minimal cross-sectional view of a model cut according to an embodiment of the present invention;
FIG. 2(b) is a maximum cross-sectional view of model cropping according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the present invention of fill curve generation and clipping;
FIG. 4(a) is a schematic diagram of minimum cross-section different density packing according to the present invention;
FIG. 4(b) is a schematic diagram of the maximum cross-section different density filling of the present invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features or characteristics may be combined in any suitable manner in one or more embodiments.
The invention is described in detail with reference to the accompanying drawings, and the specific steps are as follows:
(1) establishing a three-dimensional model, and performing data reading and slice layering to obtain the inner and outer outlines M of each layer of sectioni(i-0, 1,2, … … n) and Li(i＝0,1,2，……n)；
(2) Calculating the minimum bounding box A of the cross-sectional outer contour of each layeri(i ═ 0,1,2, … … n) and the smallest bounding box B of the inner contouri(i is 0,1,2, … … n), calculating the area difference of the plane inner and outer contour bounding boxes, and recording the area difference as Si(i＝0,1,2，……n)；
(3) Computing the area difference set S of all layer bounding boxes in the modeliMinimum value of SminAnd a maximum value Smax；
(4) Calculating the longest edge X of each outer contour minimum bounding boxmaxDetermining the range of the square to be filled containing the cross section outline by taking the length of the side as the side length;
(5) calculating the minimum area SminAnd maximum area SmaxIs used in combination with StDenotes that the minimum area SminAnd maximum area SmaxS betweeniDivided into three sections from small to large according to StAnd XmaxSelecting a proper recursion depth K value, iterating Hilbert to generate a metafunction, drawing a Hilbert curve, and storing a coordinate point P of the Hilbert curvej(j＝0,1,2，……m)；
(6) And offsetting the section outline, cutting the filling curve by using the offset section outline, and finally deriving the G-code for model printing.
The step (2) is specifically as follows: taking the printing platform as a reference, carrying out equal-thickness layering on the model along the Z-axis direction as the positive direction, and obtaining the inner and outer outlines M of the cross section of the model once every layer is cut in the layering processi、LiAnd calculating the minimum bounding box A of the inner and outer contours of the layer contouriAnd BiFIG. 2(a) and FIG. 2(b) areOuter contour bounding box A with largest area in obtained modelmaxWith the smallest-area outer contour bounding box AminFinally, L isi、Mi、AiAnd BiStoring the four groups of data into arrays respectively, and storing AiAnd BiMaking a difference, and calculating the area difference S of the inner and outer contour bounding boxes of each layer of sectioni：
Si＝Ai-Bi；
The step (3) is specifically as follows: in step (2) above for { S0，S1，S2，……SiSorting the difference value sets from small to large to select the minimum area SminAnd maximum area SmaxFIG. 2(a) and FIG. 2(b) show S of the modelminAnd Smax；
The step (4) is specifically as follows: calculate each AiLong side X ofmaxWith XmaxDetermining the range of the square to be filled for the side length, wherein the right lower corner of the square is taken as the origin to ensure that a filling curve which can fill the whole section outline is generated, as shown in FIG. 2(b), and the range to be filled of the model is taken as XmaxA variable length square range;
the step (5) is specifically as follows: calculating the minimum area S on the basis of the step (3)minAnd maximum area SmaxThe difference of (a):
St＝Smax-Smin
will minimize the area SminAnd maximum area SmaxS betweeniEqually divided into three intervals according to StAnd XmaxSelecting a proper recursion depth K value, drawing a Hilbert curve according to a Hilbert generation element function, and storing a coordinate point P of the Hilbert curvej；
Wherein the step (5) specifically comprises:
1) in order to quantitatively judge the filling density, the minimum area S is usedminAnd maximum area SmaxS betweeniEqually divided into three intervals:
2) an appropriate value of the recursion depth K (K ≧ 0) is selected according to the size of the high-density filling region. Due to the small cross section of the high-density filling area, in order to avoid the overlapping phenomenon of the filling wires in the layer, the unit step length a of the Hilbert curve should satisfy the following condition:
wherein, XmaxThe side length of the square to be filled, d the width of the filling wire, and the K value according to SminAnd XmaxThe value of (2) is selected. For the high-density filling area, the recursion depth takes a larger value, and the recursion depth values of the high-density filling area, the medium-density filling area and the low-density filling area are respectively recorded as K1、K2、K3In which K is1≥K2≥K3When the same depth value is selected, the cross-sectional profile X of each layer is different in size as shown in FIG. 3maxWill also differ, unit step a following XmaxThe filling curve of each layer is different in unit step length, and the filling density of the section of each layer is also different; when the recursive depth value which is gradually decreased from the high-density area to the low-density area is selected, the unit step length a of the Hilbert curve is along with XmaxThe filling density change gradient between the intervals is increased, which is beneficial to reducing materials and saving printing time. The method for calculating the section filling density comprises the following steps:
fill density (volume of material used in printing a print/total volume of mold)
The volume of the material used when the printing piece is printed is equal to the length of the filling path multiplied by the cross-sectional area of the filling wire material when the printing piece is printed;
the step (6) is specifically as follows: as shown in fig. 3, generating filling curves of different unit step lengths according to the sizes of the inner and outer contour bounding boxes of different cross sections, then offsetting the cross section contour, as shown in fig. 4(a) and 4(b), cutting the corresponding filling curves of different unit step lengths by using the offset cross section contour, and finally generating and printing a G-code file.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (5)
1. A method for generating a variable-density 3D printing filling path is characterized by comprising the following steps:
s1: establishing a three-dimensional model, reading data, slicing and layering to obtain an inner contour M of each layer of sectioniAnd an outer contour LiWherein i is 0,1,2, … … n;
s2: calculating the minimum bounding box A of the outer contour of each layer sectioniWith the smallest bounding box B of the inner contouriThen, the area difference of the two bounding boxes of the plane is calculated and recorded as SiWherein i is 0,1,2, … … n;
s3: computing the area difference set S of all layer bounding boxes in the modeliMinimum value of SminAnd a maximum value Smax；
S4: calculate each outer contour bounding box LiLongest side X ofmaxWith the longest side XmaxThe length of the square to be filled is determined as the side length and comprises the section outline;
s5: calculating the minimum area SminAnd maximum area SmaxDifference StWith St3 and 2StA/3 is a section node, and SiIs divided into three sections according to the size, according to SiDynamically adjusting the recursion depth and the area difference S of the Hilbert curveiThe smaller the recursion depth is, the larger the recursion depth is, and the smaller the unit step length is, drawing a Hilbert curve in the range of the square to be filled and storing a coordinate point of the Hilbert curve;
s6: and offsetting the section outline, cutting the filling curve by using the offset section outline, and finally deriving the G-code for model printing.
2. The method for generating the variable density 3D printing filling path according to claim 1, wherein the step S2 is specifically:
after layering, each layer is cut, and the minimum bounding box A of the outer contour and the inner contour of the layer is calculatediAnd BiAnd calculate AiAnd BiThe difference in area of (a) is denoted as SiMarking and storing to obtain bounding box area difference value set { S }0，S1，S2，……Si}。
3. The method for generating the variable density 3D printing filling path according to claim 2, wherein the step S3 is specifically:
for the bounding box difference set S in step S2iSorting and determining the maximum value SmaxAnd minimum value Smin。
4. The method for generating the variable density 3D printing filling path according to claim 3, wherein the step S4 is specifically as follows:
and calculating the longest edge of the outer contour bounding box, generating a range of the square to be filled containing the cross-sectional outline by taking the length of the longest edge as the edge length, iterating the Hilbert generation element function by taking the right lower corner of the square as a starting point to draw a Hilbert curve, and storing the coordinate point of the Hilbert curve.
5. The method for generating the filling path for variable density 3D printing according to claim 4, wherein the three intervals in the step S5 are as follows:
the interval is a high-density filling area;
the interval is a medium-density filling area;
the interval is a low density filling area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110402183.XA CN113192176B (en) | 2021-04-14 | 2021-04-14 | Method for generating variable-density 3D printing filling path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110402183.XA CN113192176B (en) | 2021-04-14 | 2021-04-14 | Method for generating variable-density 3D printing filling path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113192176A true CN113192176A (en) | 2021-07-30 |
| CN113192176B CN113192176B (en) | 2023-11-28 |
Family
ID=76973998
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110402183.XA Active CN113192176B (en) | 2021-04-14 | 2021-04-14 | Method for generating variable-density 3D printing filling path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113192176B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114434802A (en) * | 2021-12-20 | 2022-05-06 | 西安理工大学 | 3D printing contour offset filling path planning algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009063319A2 (en) * | 2007-11-15 | 2009-05-22 | Mental Images Gmbh | Shallow bounding volume hierarchies for accelerated ray tracing |
| CN105608275A (en) * | 2015-12-23 | 2016-05-25 | 南京航空航天大学 | Generating method for printing path used for light three-dimensional model printing |
| US20190152139A1 (en) * | 2016-07-27 | 2019-05-23 | Hewlett-Packard Development Company, L.P. | Multiscale density threshold matrices for 3d printing |
| CN110599580A (en) * | 2019-09-20 | 2019-12-20 | 西南石油大学 | Multi-seismic mathematical data rapid cross display based on Hilbert space filling curve index |
| CN111002580A (en) * | 2019-12-17 | 2020-04-14 | 杭州电子科技大学 | 3D printing path filling method improved based on Hilbert curve |
-
2021
- 2021-04-14 CN CN202110402183.XA patent/CN113192176B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009063319A2 (en) * | 2007-11-15 | 2009-05-22 | Mental Images Gmbh | Shallow bounding volume hierarchies for accelerated ray tracing |
| CN105608275A (en) * | 2015-12-23 | 2016-05-25 | 南京航空航天大学 | Generating method for printing path used for light three-dimensional model printing |
| US20190152139A1 (en) * | 2016-07-27 | 2019-05-23 | Hewlett-Packard Development Company, L.P. | Multiscale density threshold matrices for 3d printing |
| CN110599580A (en) * | 2019-09-20 | 2019-12-20 | 西南石油大学 | Multi-seismic mathematical data rapid cross display based on Hilbert space filling curve index |
| CN111002580A (en) * | 2019-12-17 | 2020-04-14 | 杭州电子科技大学 | 3D printing path filling method improved based on Hilbert curve |
Non-Patent Citations (4)
| Title |
|---|
| NARENDRA KUMAR 等: "Effect of fractal curve based toolpath on part strength in fused deposition modelling", 《INT. J. RAPID MANUFACTURING》, vol. 5, no. 2, pages 186 - 198 * |
| 孙殿柱 等: "三角网格曲面模型多轴数控加工刀轨生成算法", 《中国机械工程》, no. 24, pages 2949 - 2953 * |
| 李佳: "基于ARM的3D打印上位机软件开发及填充算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 8, pages 138 - 1230 * |
| 淡卜绸 等: "基于Hilbert填充曲线的自由曲面刀具路径规划研究", 《机械设计与制造》, no. 7, pages 233 - 235 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114434802A (en) * | 2021-12-20 | 2022-05-06 | 西安理工大学 | 3D printing contour offset filling path planning algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113192176B (en) | 2023-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104057611B (en) | A kind of 3D optimized based on scan line inclination angle prints fill path generation method | |
| CN104708824A (en) | 3D (three-dimensional) printing adaptive slicing method capable of reserving model features | |
| US7406361B2 (en) | Rapid prototyping method and apparatus using V-CAD data | |
| CN108058387B (en) | Planning method of FDM printing path | |
| CN111037917B (en) | FDM printing method, system and medium based on model splitting and splicing printing | |
| CN110918988B (en) | Laser scanning path planning method and additive manufacturing method | |
| CN106875495A (en) | A kind of embossment grid representation and 3D printing dicing method and system based on Bump Mapping | |
| CN104475984B (en) | A kind of preprocess method of 3D mould laser engraving and pretreatment unit | |
| CN110773738B (en) | Laser scanning path regional planning method based on polygon geometric feature recognition | |
| CN113192176A (en) | Generation method of variable-density 3D printing filling path | |
| CN111097906B (en) | Scanning distribution method and device based on multiple lasers and three-dimensional object manufacturing equipment | |
| CN111319254A (en) | Method for improving compactness of 3D printing corner | |
| CN113733568A (en) | Method, device and equipment for generating 3D printing file and storage medium | |
| CN104890237A (en) | 3D printing method and system thereof | |
| EP3233434A1 (en) | Three-dimensional object representation | |
| KR102300485B1 (en) | Method for creating of hollow structure based on sliced plane outline of two dimensions for three dimensions printing | |
| CN109773186B (en) | Additive manufacturing method for manufacturing three-dimensional object, apparatus thereof, and readable storage medium | |
| CN115056490B (en) | Continuous path generation method for S-shaped adherence filling | |
| CN104690976B (en) | The column printing method of three-dimensional printing machine and system | |
| US10589509B2 (en) | Representing an object in terms of sub-volumes | |
| CN113191014A (en) | Fused deposition 3D printing molding layered slicing method | |
| JP7351127B2 (en) | Information processing equipment and programs | |
| CN109719952A (en) | A kind of rapid section processing method of array spray head inkjet printing | |
| CN101382794A (en) | Support generating method for FDM rapid forming machine | |
| CN116039088A (en) | Stress-based 3D printing continuity path planning method |
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 |