Unlock instant, AI-driven research and patent intelligence for your innovation.

3D fast printing path planning method for concave area

A printing path and area technology, applied in the field of 3D printing, can solve problems such as continuation and laser interruption

Inactive Publication Date: 2019-02-22
FUJIAN AGRI & FORESTRY UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Traditional 3D printing path generation algorithms may face laser interruption and continuation problems when dealing with concave polygonal printing areas

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • 3D fast printing path planning method for concave area
  • 3D fast printing path planning method for concave area
  • 3D fast printing path planning method for concave area

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] figure 1 It shows the convex segmentation process of the CCTCSA algorithm for printing area polygons. Among them, the CCTCSA algorithm converts a possibly concave polygonal printing area into a series of convex areas as follows:

[0028] First, randomly select a point on the boundary of the region as the starting point of the convex boundary search, and initialize two double-ended queues Hp, Rp, He, Re that store the start-stop boundary point and the start-stop boundary edge.

[0029] Then, carry out a convex boundary search "clockwise" along the boundary of the polygon of the printing area, and use a greedy strategy until a boundary point that does not meet the conditions appears or the search ends;

[0030] Then, adopt the greedy strategy to search the convex boundary along the "counterclockwise" direction of the polygon boundary of the printing area until the boundary points that do not meet the conditions appear or the search ends;

[0031] Finally, according to w...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a 3D quick printing path planning method of a concave area. Firstly, a point on the boundary of the area is selected as a stating point of convex boundary searching to initially store two double-end queues of a start-stop boundary point and a start-stop boundary edge. Then, a greedy policy is adopted to perform the convex boundary searching in the polygonal boundary clockwise direction of a printing area until a boundary point not satisfying the conditions is generated or the searching is finished; then, the greedy policy is adopted to perform the convex boundary searching in the polygonal boundary anticlockwise direction of the printing area until the boundary point not satisfying the conditions is generated or the searching is finished; finally, the sameness of the start-stop boundary point is judged; if so, the searching is finished; and otherwise, the queue head and queue tail boundary points are connected to form starting conditions in the next time of searching for the next boundary convex operation. The method prevents the laser interruption and continuity problems possibly generated in polygonal printing area path planning.

Description

technical field [0001] The invention relates to the field of 3D printing, in particular to a 3D rapid printing path planning method for a concave region. Background technique [0002] The path planning algorithm in 3D printing is to scan and fill the cross-sectional contour obtained by layering slices. Reasonable path planning can not only improve the speed of 3D printing, but also save printing materials. Traditional 3D printing path generation algorithms may face laser interruption and continuation problems when dealing with concave polygonal printing areas. Contents of the invention [0003] In order to solve the above-mentioned problems in the prior art, the present invention proposes a Clockwise and Counterclockwise Two-way ConvexifySegment Algorithm (CCTCSA), referred to as the CCTCSA algorithm. The use efficiency of the laser is improved and the service life of the laser is prolonged. [0004] The basic idea of ​​the CCTCSA algorithm is to divide the polygonal pri...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): B29C64/386B33Y50/00
CPCB33Y50/00
Inventor 林甲祥陈日清舒兆港吴丽萍
Owner FUJIAN AGRI & FORESTRY UNIV