CN115503240A - Additive manufacturing path planning generation method - Google Patents
Additive manufacturing path planning generation method Download PDFInfo
- Publication number
- CN115503240A CN115503240A CN202211115974.5A CN202211115974A CN115503240A CN 115503240 A CN115503240 A CN 115503240A CN 202211115974 A CN202211115974 A CN 202211115974A CN 115503240 A CN115503240 A CN 115503240A
- Authority
- CN
- China
- Prior art keywords
- point
- segmentation
- filling
- line segments
- line segment
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 239000000654 additive Substances 0.000 title claims abstract description 14
- 230000000996 additive effect Effects 0.000 title claims abstract description 14
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 12
- 230000011218 segmentation Effects 0.000 claims description 76
- 239000000945 filler Substances 0.000 claims 1
- 238000009825 accumulation Methods 0.000 abstract description 3
- 239000000463 material Substances 0.000 abstract description 3
- XUKUURHRXDUEBC-KAYWLYCHSA-N Atorvastatin Chemical compound C=1C=CC=CC=1C1=C(C=2C=CC(F)=CC=2)N(CC[C@@H](O)C[C@@H](O)CC(O)=O)C(C(C)C)=C1C(=O)NC1=CC=CC=C1 XUKUURHRXDUEBC-KAYWLYCHSA-N 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005429 filling process Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
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
- B29C64/393—Data acquisition or data processing for additive manufacturing for controlling or regulating additive manufacturing processes
-
- 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
- B33Y50/02—Data acquisition or data processing for additive manufacturing for controlling or regulating additive manufacturing processes
Landscapes
- Chemical & Material Sciences (AREA)
- Engineering & Computer Science (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- Mechanical Engineering (AREA)
- Optics & Photonics (AREA)
- Image Generation (AREA)
Abstract
The invention relates to an additive manufacturing path planning and generating method, which is characterized in that a complete polygonal slice profile is decomposed into a plurality of filling areas, a closed path I is independently constructed in each filling area, and then a plurality of paths are combined to construct a complete closed path II, wherein the angle of a turning part during filling is reduced when the filling area is constructed, so that the accumulation of materials at the turning part is reduced, the purpose of improving the appearance quality of a product is realized, and the constructed path II effectively reduces breakpoints during filling, thereby improving the filling efficiency and the filling quality.
Description
Technical Field
The invention relates to the technical field of additive manufacturing, in particular to a method for generating additive manufacturing path planning.
Background
In the additive manufacturing technology, scan filling path planning is performed on slice outlines of a three-dimensional model after layered slicing, which is one of key technologies.
At present, a scanning filling path is generated on a polygonal section contour by adopting a reciprocating linear method or an offset contour method, for example, in the scanning filling process of the polygonal contour in fig. 1-2, the corner a at the joint between a plurality of adjacent paths is small, so that the material accumulation at the corner a is obviously excessive relative to the place with a large corner, and when a three-dimensional product is generated, the appearance of the product is poor due to the accumulation of a plurality of small corner materials.
Disclosure of Invention
In view of the defects in the prior art, an object of the present invention is to provide an additive manufacturing path plan generating method.
The above object of the present invention is achieved by the following technical solutions:
an additive manufacturing path plan generation method is characterized by comprising the following steps: comprises the following steps
S1, constructing a rectangular coordinate system, and constructing a slice contour line in the rectangular coordinate system;
s2, constructing a filling area:
s2.1: acquiring each turning point of a slice contour line and setting the turning point as an S point;
s2.2: acquiring adjacent turning points on two sides of the S point, respectively setting p point and q point, and constructing a directed line segment from the p point to the q point
S2.3: if the S point is located
If the left side of the S point is located on the left side, the S point is preset as a pit point to form a pit point set, otherwise, if the S point is located on the left side of the S point, the S point is preset as a pit point to form a pit point set
On the right side of the point A, a point S is preset as a convex point;
s2.4: the connecting line between every two concave points can form a segmentation line segment, polygons formed on two sides of each segmentation line segment are independently obtained, whether two end points of the segmentation line segment are formed into convex points in the polygons or not is judged, the segmentation line segment is reserved, and otherwise, the segmentation line segment is deleted;
s2.5: judging whether the segmentation line segments reserved in the S2.4 are intersected or not, if a plurality of segmentation line segments are intersected, deleting the intersected segmentation line segments until no intersected segmentation line segments exist, wherein at least one segmentation line segment exists at each concave point, and the reserved segmentation line segments form a potential segmentation line segment set;
s2.6: selecting a subset with the minimum sum of the characteristics of the segmentation line segments and the number of the segmentation line segments from the potential segmentation line segment sets as a final segmentation line segment set, wherein the segmentation line segment characteristics are the sum of the lengths of the segmentation line segments and the angle differences at the segmentation points;
s2.7: the reserved segmentation line segments and the slice contour lines form a plurality of closed filling areas;
s3, constructing a printing path:
s3.1: presetting a plurality of parallel filling line segments in the filling area;
s3.2: selecting any one of the filling line segments in each filling area, calculating the sum of cosine of included angles between two ends of the filling line segment and a segmentation line or a slice contour line forming the filling area respectively as Z, and adjusting the angle of the filling line segment to be the minimum Z;
s3.3: connecting the fill line segments constitutes a print path.
The present invention in a preferred example may be further configured to:
step S2.3 further includes:
measuring the distance D of a connecting line between each concave point and the adjacent turning point; if D > W, the pit is reserved in the pit set; otherwise, the pit is removed from the set of pits, where W is the minimum threshold of pit significance and is a constant, and W =0.85.
The invention in a preferred example may be further configured to:
step S3.3 further comprises:
s3.3.1: each filling area independently constructs a closed printing path I;
s3.3.2: acquiring a same divided line segment of the printing path in each filling area, taking any two points on the same divided line segment as transfer points, and setting the interval between the two transfer points on the same divided line segment as the printing width d;
s3.3.2: and constructing a closed path II by the path I, the segmentation line segment divided into two sections by the transit point and the transit point in the filling areas at the two sides of the segmentation line where the transit point is located.
The present invention in a preferred example may be further configured to: in step s3.3.1, if the number of the filling line segments and the dividing line segments or the slicing outline line segments parallel to the filling line segments in the filling area is odd, printing is performed between at least two of the line segments along a sine wave.
In summary, the invention includes at least one of the following beneficial technical effects:
1. the turning part with a smaller angle during filling is reduced, so that the appearance precision and the quality of the product are improved;
2. all the separately closed paths I are constructed into a completely closed path II, so that non-additive path planning is reduced, and the efficiency of the whole additive process is improved. And the breaking points during filling are greatly reduced, the frequent start and stop of the filling mechanism are reduced, excessive filling start and stop points are avoided, and the flatness and the forming quality of the filling surface are improved.
Drawings
FIG. 1 is a slice profile of a particular embodiment.
Fig. 2 is a slice outline with the turning point markers added.
Fig. 3 is a slice outline to which a segmentation line segment is added.
Fig. 4 shows preset fill line segments in the fill area.
Fig. 5 shows a first closed path being established within the fill area.
FIG. 6 shows a second path consisting of a combination of paths.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings.
For the convenience of understanding, the present invention will be described by taking the slice outline of fig. 1 as an object.
As shown in fig. 2, pits are acquired:
the method comprises the following steps:
constructing a slice contour line in a rectangular coordinate system (the rectangular coordinate system is omitted in the figure), and acquiring coordinates of each turning point of the slice contour line, wherein in the embodiment, S is obtained through acquisition 1 、S 2 、S 3 、S 4 、S 5 、S 6 、S 7 、S 8 、S 9 、S 10 、S 11 、S 12 、S 13 、S 14 、S 15 、S 16 、S 17 Totally 17 turning points, and then judging whether each turning point belongs to a concave point one by one;
the judging method comprises the following steps:
assuming that the turning point is S, adjacent turning points on two sides of the S point are respectively provided with a p point and a q point, and a directed line segment from the p point to the q point is constructed
If the S point is located
If the left side of the S point is located on the left side, the S point is preset as a concave point, otherwise, the S point is located on the left side
On the right side of the point A, a point S is preset as a convex point;
and then calculated as the S point to S point of the concave point
If V is a vertical distance of>W, reserving the pit mark of the S point, otherwise, canceling the pit mark of the S point, wherein W is a pit significance minimum threshold and is a constant;
finally obtaining a concave point set S n N is a natural number, S n Has the coordinates of
In particular with S 1 Dot sum S 3 Point of interest is, for example, S 1 Two points adjacent to each other are S 13 Dot sum S 2 Point, connecting S in the counterclockwise direction 13 Point and S 2 Points forming directed line segments
At this time S 1 Point is located at
Or calculated to the right of
Judgment S 1 The points are salient points;
S 3 two points adjacent to each other are S 2 Dot sum S 4 Point, connecting S in the counterclockwise direction 2 Point and S 4 Points forming directed line segments
At this time S 3 Point is located at
Or calculated to the left of
Judgment S 3 The point is a pit, and then S is calculated 3 Point to
Perpendicular distance D of>W；
Finally, the obtained concave point set is { S } 3 、S 6 、S 10 、S 13 、S 14 、S 17 In which S is 7 D at a point<W, so excluding S 7 。
As shown in FIG. 3, the segmentation line segment of the slice contour is obtained
Step two:
connecting each concave point to form a plurality of segmentation line segments, separately obtaining polygons formed by two sides of each segmentation line segment in the slicing outline, judging whether two end points of each segmentation line segment are convex points formed on the polygons, reserving the segmentation line segment, otherwise deleting the segmentation line segment;
then judging whether the reserved segmentation line segments are intersected or not, if a plurality of segmentation line segments are intersected, deleting the intersected segmentation line segments until no intersected segmentation line segments exist and each concave point has at least one segmentation line segment, and forming a potential segmentation line segment set by the reserved segmentation line segments;
and finally, in the potential segmentation line segment set, selecting a subset with the minimum sum of the characteristics of the segmentation line segments and the number of the segmentation line segments as a final segmentation line segment set, wherein the characteristics of the segmentation line segments are the sum of the lengths of the segmentation line segments and the angle differences at segmentation points, and specifically:
let L be a set of segmentation line segments, line segment x i,j Is a connecting line between the division points i, j. Then X = (X) i,j ) T Accepting or rejecting for binary vector representationThe line segments are segmentation line segments.
min||X||0+αW T X
s.t,AX≥1BX≤1X∈{0,1} n
W is a segmentation line segment endpoint feature vector W = dist (i, j) + beta. Max { Δ θ } i ,Δθ j }, dist (i, j) is a normalized line segment x i,j Length of (a), Δ θ i ，Δθ j The angle difference after the division polygon vertex normalization at the points i and j is respectively.
A is a convex polygon constraint matrix, i.e. a divided polygon P i ,P j Are all in the shape of a convex polygon,
b is a non-overlapping constraint matrix of the segmentation line segments, i.e. the segmentation line segments k, l cannot be intersected,
as shown in fig. 4-6, a print path is constructed:
step four:
and (2) independently constructing a closed printing path I in each filling area, wherein if the number of filling line segments in the filling area and the number of segmentation line segments or slice outline line segments parallel to the filling line segments are odd numbers, at least two line segments are printed along a sine wave to obtain a segmentation line segment with the same printing path I in each filling area, any two points on the same segmentation line segment are taken as transfer points, the interval between two transfer points on the same segmentation line segment is the printing width d, and a path I, a segmentation line segment divided into two sections by the transfer points and a transfer point in the filling areas at two sides of the transfer point form a closed path II.
The embodiments of the present invention are preferred embodiments of the present invention, and the scope of the present invention is not limited by these embodiments, so: equivalent changes made according to the structure, shape and principle of the invention shall be covered by the protection scope of the invention.
Claims (4)
1. A method for generating an additive manufacturing path plan is characterized by comprising the following steps: comprises the following steps
S1, constructing a rectangular coordinate system, and constructing a slice contour line in the rectangular coordinate system;
s2, constructing a filling area:
s2.1: acquiring each turning point of a slice contour line and setting the turning point as an S point;
s2.2: acquiring adjacent turning points on two sides of the S point, respectively setting p point and q point, and constructing a directed line segment from the p point to the q point
S2.3: if the S point is located
If the left side of the S point is located on the left side, the S point is preset as a pit point to form a pit point set, otherwise, if the S point is located on the left side of the S point, the S point is preset as a pit point to form a pit point set
On the right side of the base, the preset S point is a salient point;
s2.4: the connecting line between every two concave points can form a segmentation line segment, polygons formed on two sides of each segmentation line segment are independently obtained, whether two end points of the segmentation line segment are formed into convex points in the polygons or not is judged, the segmentation line segment is reserved, and otherwise, the segmentation line segment is deleted;
s2.5: judging whether the segmentation line segments reserved in the S2.4 are intersected or not, if a plurality of segmentation line segments are intersected, deleting the intersected segmentation line segments until no intersected segmentation line segments exist, wherein at least one segmentation line segment is arranged at each concave point, and the reserved segmentation line segments form a potential segmentation line segment set;
s2.6: selecting a subset with the minimum sum of the characteristics of the segmentation line segments and the number of the segmentation line segments from the potential segmentation line segment sets as a final segmentation line segment set, wherein the characteristics of the segmentation line segments are the sum of the lengths of the segmentation line segments and the angle differences at segmentation points;
s2.7: the reserved segmentation line segments and the slice contour lines form a plurality of closed filling areas;
s3, constructing a printing path:
s3.1: presetting a plurality of parallel filling line segments in the filling area;
s3.2: selecting any one of the filling line segments in each filling area, calculating the sum of cosine of included angles between two ends of the filling line segment and a segmentation line or a slice contour line forming the filling area respectively as Z, and adjusting the angle of the filling line segment to be the minimum Z;
s3.3: connecting the filler line segments constitutes a print path.
2. The additive manufacturing path plan generating method of claim 1, wherein: step S2.3 further includes:
measuring the distance D of a connecting line between each concave point and the adjacent turning point; if D > W, the pit is reserved in the pit set; otherwise, the pit is removed from the set of pits, where W is the pit significance minimum threshold and is a constant.
3. The additive manufacturing path plan generating method according to claim 1, wherein: step S3.3 further comprises:
s3.3.1: each filling area independently constructs a closed printing path I;
s3.3.2: acquiring a same divided line segment of the printing path in each filling area, taking any two points on the same divided line segment as transit points, and setting the interval between the two transit points on the same divided line segment as the printing width d;
s3.3.2: and constructing a closed path II by the transit point and a path I in the filling areas at two sides of the split line where the transit point is located, the split line segment divided into two sections by the transit point.
4. The additive manufacturing path plan generating method of claim 3, wherein: in step s3.3.1, if the number of the filling line segments in the filling area and the number of the segmentation line segments or the slicing outline line segments parallel to the filling line segments are odd, printing is performed between at least two of the line segments along a sine wave.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211115974.5A CN115503240A (en) | 2022-09-14 | 2022-09-14 | Additive manufacturing path planning generation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211115974.5A CN115503240A (en) | 2022-09-14 | 2022-09-14 | Additive manufacturing path planning generation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115503240A true CN115503240A (en) | 2022-12-23 |
Family
ID=84503009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211115974.5A Pending CN115503240A (en) | 2022-09-14 | 2022-09-14 | Additive manufacturing path planning generation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115503240A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116039093A (en) * | 2023-02-15 | 2023-05-02 | 南京衍构科技有限公司 | Self-adaptive spiral path planning method for additive manufacturing |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106273480A (en) * | 2016-08-11 | 2017-01-04 | 福建农林大学 | Can the 3D printing speed paths planning method of concave region |
| JP2018176597A (en) * | 2017-04-17 | 2018-11-15 | 富士ゼロックス株式会社 | Data generation device for three-dimensional creation, three-dimensional creation device, and path data generation program for three-dimensional creation |
| CN110209363A (en) * | 2019-05-30 | 2019-09-06 | 大连理工大学 | Intelligent 3D printing paths planning method based on genetic algorithm |
| WO2020192756A1 (en) * | 2019-03-27 | 2020-10-01 | 北京机科国创轻量化科学研究院有限公司 | Method for planning 3d printing path of continuous fiber reinforced composite material |
| US20210055710A1 (en) * | 2019-08-22 | 2021-02-25 | Ut-Battelle, Llc | Continuous toolpaths for additive manufacturing |
| CN113895036A (en) * | 2021-10-26 | 2022-01-07 | 南京衍构科技有限公司 | Continuous self-adaptive path planning method for additive manufacturing |
-
2022
- 2022-09-14 CN CN202211115974.5A patent/CN115503240A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106273480A (en) * | 2016-08-11 | 2017-01-04 | 福建农林大学 | Can the 3D printing speed paths planning method of concave region |
| JP2018176597A (en) * | 2017-04-17 | 2018-11-15 | 富士ゼロックス株式会社 | Data generation device for three-dimensional creation, three-dimensional creation device, and path data generation program for three-dimensional creation |
| WO2020192756A1 (en) * | 2019-03-27 | 2020-10-01 | 北京机科国创轻量化科学研究院有限公司 | Method for planning 3d printing path of continuous fiber reinforced composite material |
| CN110209363A (en) * | 2019-05-30 | 2019-09-06 | 大连理工大学 | Intelligent 3D printing paths planning method based on genetic algorithm |
| US20210055710A1 (en) * | 2019-08-22 | 2021-02-25 | Ut-Battelle, Llc | Continuous toolpaths for additive manufacturing |
| CN113895036A (en) * | 2021-10-26 | 2022-01-07 | 南京衍构科技有限公司 | Continuous self-adaptive path planning method for additive manufacturing |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116039093A (en) * | 2023-02-15 | 2023-05-02 | 南京衍构科技有限公司 | Self-adaptive spiral path planning method for additive manufacturing |
| CN116039093B (en) * | 2023-02-15 | 2023-09-26 | 南京衍构科技有限公司 | Self-adaptive spiral path planning method for additive manufacturing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107856309B (en) | Rapid path planning method for additive manufacturing and remanufacturing | |
| CN103894608B (en) | A kind of 3 D-printing large spot scanning pattern generation method | |
| CN115503240A (en) | Additive manufacturing path planning generation method | |
| CN106808681A (en) | A kind of method for improving increasing material manufacturing element precision | |
| CN109367014B (en) | 3D printing method for axially printing bent pipe based on five-axis printing platform | |
| CN108665493B (en) | Three-dimensional printing and scanning method, readable storage medium and three-dimensional printing and scanning control equipment | |
| US20090153577A1 (en) | Method and system for texturing of 3d model in 2d environment | |
| CN110773738B (en) | Laser scanning path regional planning method based on polygon geometric feature recognition | |
| US20170014945A1 (en) | Methods and systems for laser marking an identifier on an industrial product | |
| US20060278613A1 (en) | Method and device for removing material from a three-dimensional surface in a multi-layered manner by means of a laser, using a polygon network which is described by a mathematical function and represents the surface | |
| CN110321607B (en) | Sectional type chemical milling sample plate preparation method | |
| CN114434802A (en) | 3D printing contour offset filling path planning algorithm | |
| CN110660094A (en) | Subway tunnel mobile scanning point cloud fine division method based on image recognition | |
| Kumar et al. | Digital preservation of ancient cuneiform tablets using 3D-scanning | |
| CN116993627B (en) | Laser scanning image data correction method | |
| CN112581621B (en) | Online extraction method for spatial dimension of three-dimensional point cloud steel plate | |
| CN109359381A (en) | A kind of voxel-based laser path planing method | |
| CN105678708A (en) | Integrative optimization method suitable for registered multi-view ordered point clouds | |
| JP3829216B2 (en) | Intaglio line drawing body | |
| CN109029285B (en) | Hybrid measurement method integrating contact measurement and non-contact measurement | |
| CN113963114A (en) | Discrete boundary point tracking method based on polygon growth | |
| CN112632696A (en) | Self-checking method for reconfigurable discrete die curved surface forming nail die position | |
| CN107246863A (en) | A kind of irregular bore tunnel inwall image projecting method of deploying | |
| CN111179280B (en) | Method for reversely manufacturing stone inscription three-dimensional model through rubbing | |
| Rho et al. | A rapid reverse engineering system for reproducing 3D human busts |
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 |