WO2023116442A1

WO2023116442A1 - 3d printing control system for double-laser segmentation and segmentation method of 3d printing control system

Info

Publication number: WO2023116442A1
Application number: PCT/CN2022/137384
Authority: WO
Inventors: 谢大权; 陈刚
Original assignee: 南京铖联激光科技有限公司
Priority date: 2021-12-20
Filing date: 2022-12-08
Publication date: 2023-06-29
Also published as: CN113942230B; CN113942230A

Abstract

A 3D printing control system for double-laser segmentation and a segmentation method of the 3D printing control system. Modules running on the upper computer comprise an analysis module, the analysis module being configured to analyze a data file corresponding to a current part to be printed; a segmentation module, the segmentation module being configured to segment an image in the data file according to the X-axis direction by using a median line, a left boundary line and a right boundary line; and a processing module, the processing module being configured to sequentially process each polygon area (polygen) or hatch area (hatch) of the image in the data file. The defects in the prior art that a double-laser printing method in 3D printing does not take into account a position relationship of two sub-parts segmented from a complete polygon area or hatch area on a part and repeatedly printing a common edge twice such that resources are wasted, the printing efficiency is reduced, and it is difficult to achieve the balance of printing on the two sides are effectively overcome.

Description

3D printing control system for double laser segmentation and its segmentation method

technical field

The present application relates to the technical field of 3D printing control, in particular to a 3D printing control system for dual laser segmentation and a segmentation method thereof.

Background technique

With the continuous breakthrough of 3D printing research and development technology, 3D printing has been successfully applied in aerospace, biomedical, construction, automobile and other fields, and breakthroughs have been made continuously. In order to better improve performance, from single laser printing parts, to multi-laser simultaneous printing.

At present, there are many 3D printers that support dual laser printing. But the time-consuming of dual laser printing is very different. The time it takes to print a part with a dual laser depends on how good the dual laser segmentation algorithm is.

Specifically, when a 3D printer actually prints a part, if it is just a laser print, it will take a long time to print a complete part, especially a large part. However, if two lasers divide the part into two pieces and print them simultaneously, the printing time of the part will be greatly shortened. The time to print a part with dual lasers depends on the algorithm used to split the part with the dual lasers. The algorithm is superior and efficient. The printed parts not only have complete segmentation and connection, but also the printing time is relatively shortened a lot. Therefore, major manufacturers pay great attention to the research of dual-laser segmentation algorithm. However, dual laser printing should pay attention to the balance between the left and right areas. It is necessary to balance the data resources of the laser printing area on the left and the laser printing area on the right.

In the existing 3D printing, the dual laser printing method is to divide the entire part on the substrate into two evenly according to the median dividing line, the part on the left belongs to the laser printing on the left, and the part on the right belongs to the laser on the right. Print.

This segmentation method will have the following problems:

1. A complete graphic area on a part, such as a polygon area or a hatch area, is strictly divided into two sub-parts by the median dividing line, regardless of the positional relationship between the two sub-parts.

2. Sometimes in a local area, the same side or line will be laser printed on the left side and laser printed on the right side, causing the common side to be printed twice, resulting in a waste of resources and a reduction in printing efficiency.

3. Due to the division by the median dividing line, the data of the parts on both sides are not equal. Therefore, although the left laser and the right laser start printing at the same time, the balance is insufficient.

Contents of the invention

In order to solve the above problems, this application provides a 3D printing control system and transfer method for dual laser segmentation, which effectively avoids that the dual laser printing method in the prior art 3D printing does not consider the complete polygon area polygon or filling on the part The positional relationship of the two sub-parts divided into the area, and the repeated printing of the common side twice lead to the waste of resources, the reduction of printing efficiency, and the disadvantages that it is difficult to achieve the balance of printing on both sides.

In order to overcome the deficiencies in the prior art, this application provides a solution to the 3D printing control system and transfer method for dual laser segmentation, as follows:

A 3D printing control system for dual laser splitting, including:

There are two lasers on the left and right sides of the 3D printing cabin, the laser on the left is the left laser, the laser on the right is the right laser, the laser emitted by the left laser is the left laser, and the laser emitted by the right laser is the right laser. The left laser and the right laser constitute a double laser;

The left laser and the right laser are respectively connected with the left laser vibrating mirror and the right laser vibrating mirror, the left laser vibrating mirror and the right laser vibrating mirror are respectively connected with the left vibrating mirror board and the right vibrating mirror board, and the left vibrating mirror Both the mirror board and the right vibrating mirror board are connected with the upper computer for communication;

The modules running on the host computer include:

An analysis module, the analysis module is used to analyze the data file corresponding to the part currently to be printed;

A segmentation module, the segmentation module is used to divide the image in the data file with a median line, a left boundary line and a right boundary line in the X-axis direction;

A processing module, the processing module is used to sequentially process each polygonal area polygen or filling area hatch of the image in the data file, and perform segmentation on the polygonal area polygen or filling area hatch with a dual laser segmentation mode.

Further, the processing module further includes: for judging the position of the minimum value iMin1 of the abscissa of all vertices in the current polygonal area polygen or the filled area hatch, the maximum value iMax1 of the abscissa of all vertices and the abscissa x1 of the left boundary line Relation; if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the right boundary line, then the polygon area polygen or the filled area hatch is just a public area; otherwise, The polygonal area polygen or the filled area hatch is not a public area; if the polygonal area polygen or the filled area hatch is a public area, the data in the public area is allocated to the preset data array for the left laser or for the right laser In the data array; if the polygon area polygen or the filled area hatch is not a common area, and if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right boundary line, then The polygonal area polygen or the filled area hatch falls within the illumination range of the right laser, and the data of the polygonal area polygen or the filled area hatch is added to the data array for the right laser; if both iMin1 and iMax1 are greater than the right boundary line abscissa x2=fValue+iOffset, then the polygonal area polygen or the filled area hatch falls within the illumination range of the laser on the right, and the data of the polygonal area polygen or the filled area hatch is added to the data array for the right laser ; If iMin1 is less than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x=fValue+iOffset of the right boundary line, then the polygonal area polygen or the filled area hatch are divided with the median line; if iMin1 If it is less than the abscissa x1=fValue-iOffset of the left border line, and iMax1 is less than or equal to the abscissa x=fValue+iOffset of the right border line, then the polygonal area polygen or the filled area hatch falls within the illumination range of the left laser, and the The data of this polygonal area polygen or filling area hatch is added in the data array that is used for left laser; If iMin1 and iMax1 are all less than the abscissa x1=fValue-iOffset of left boundary line, so this polygonal area polygen or filling area hatch just falls Within the illumination range of the left laser, add the data of the polygon area polygen or the fill area hatch to the data array for the left laser, fValue is the abscissa of the vertical dividing line, the distance between the vertical dividing line and the left boundary line and The distance between the vertical dividing line and the border line on the right is iOffset.

Further, the processing module also includes: if the printing time of the data currently contained in the data array for the left laser is shorter than the printing time of the data currently contained in the data array for the right laser, adding the data in the common area The data array for the left laser; if the printing time of the data currently contained in the data array for the right laser is shorter than the printing time of the data currently contained in the data array for the left laser, add the data of the common area to the user In the data array of the laser on the right.

Further, the processing module also includes: firstly fetching the coordinates of two intersection points of the polygonal area polygen or the hatch area and the median line; for sequentially traversing the vertices in the polygonal area polygen or the hatch area hatch, and The vertex coordinates located on the left side of the median line are added to the data array for the left laser, and the vertex coordinates located on the right side of the median line are added to the data array used for the right laser; The data array for the left laser is also added to the data array for the right laser.

Further, the host computer also includes two threads, and the two threads are used to respectively take out the data in the data array for the left laser and the data in the data array for the right laser for printing, and the printing Including: start a thread with the data in the data array for the left laser to move the left laser that emits the left laser by driving the left laser galvanometer to perform printing, and start another thread with the data in the data array for the right laser To move the right laser that emits the right laser to perform printing by driving the right laser vibrating mirror.

A method for dividing a 3D printing control system aimed at double laser division, comprising the following steps:

Step 1: Place the parts to be printed on the substrate in the 3D printing cabin, and the host computer parses out the data files corresponding to the parts to be printed;

Step 2: Then the host computer divides the image in the data file with the median line, the left boundary line and the right boundary line in the X-axis direction;

Further, according to the X-axis direction, it is divided by the median line, the left boundary line and the right boundary line, then the median line as its vertical dividing line is a vertical dividing line perpendicular to the X-axis direction, and the vertical dividing line is the The rectangular frame where the image in the data file is located is cut into two identical sub-rectangular frames on the left and right. The largest ordinate, the smallest ordinate, the largest abscissa and the smallest The abscissa is the largest ordinate, the smallest ordinate, the largest abscissa, and the smallest abscissa of the image respectively, and the vertical dividing line is the dividing line that divides the rectangular frame in half in the direction perpendicular to the X axis. The abscissa x=fValue of the vertical dividing line;

Both sides of the median line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction, where the right boundary line represents the rightmost illumination range boundary of the left laser; the left boundary line represents the leftmost illumination range boundary of the right laser ; The distance between the median line and the left border line is equal to the distance between the vertical dividing line and the right border line, both are iOffset.

Step 3: The host computer sequentially processes each polygonal area polygen or filling area hatch of the image in the data file, and performs segmentation on the polygonal area polygen or filling area hatch with a dual laser segmentation mode.

Further, the method for performing segmentation on the polygonal area polygen or the filled area hatch with a dual laser segmentation mode specifically includes:

Step 3-1: Determine the positional relationship between the minimum value iMin1 of the abscissa of all vertices in the current polygon area polygen or the filled area hatch, the maximum value iMax1 of the abscissa of all vertices, and the abscissa x1 of the left boundary line;

Further, both sides of the median line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction, where the right boundary line represents the rightmost illumination range boundary of the left laser; the left boundary line represents the leftmost boundary of the right laser Illumination range boundary; the distance between the median line and the left boundary line is equal to the distance between the vertical dividing line and the right boundary line, both of which are iOffset, the abscissa of the left boundary line is x1=fValue-iOffset, and the abscissa of the right boundary line x2=fValue +iOffset.

Step 3-2: If iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the right boundary line, then the polygon area polygen or the hatch area is a public area ;Otherwise, the polygon area polygen or the fill area hatch is not a public area;

Step 3-3: If the polygon area polygen or the filled area hatch is a public area, allocate the data in the public area to the preset data array for the left laser or the data array for the right laser;

Further, the method of distributing the data in the public area to the preset data array for the left laser or the data array for the right laser includes: if the printing time of the data currently contained in the data array for the left laser is shorter than The printing time of the data currently contained in the data array used for the right laser is short, and the data in the common area is added to the data array used for the left laser; if the printing time of the data currently contained in the data array used for the right laser is shorter than that used for The printing time of the data currently contained in the data array of the left laser is short, so the data in the common area is added to the data array for the right laser.

Step 3-4: If the polygon area polygen or the filled area hatch is not a public area, and if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right boundary line, Then the polygonal area polygen or the filled area hatch falls within the illumination range of the right laser, and the data of the polygonal area polygen or the filled area hatch is added to the data array for the right laser;

Step 3-5: If both iMin1 and iMax1 are greater than the abscissa x2=fValue+iOffset of the border line on the right, then the polygon area polygen or the fill area hatch falls within the illumination range of the laser on the right, and the polygon area polygen or fill The data of the area hatch is added to the data array for the right laser;

Step 3-6: If iMin1 is smaller than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x=fValue+iOffset of the right boundary line, then the polygon area polygen or the filled area hatch is defined by the median line segmentation;

Further, the method for dividing by the median line in the steps 3-6 includes:

Step 3-6-1: First take out the coordinates of the two intersection points of the polygon area polygon or the filling area hatch and the median line;

Step 3-6-2: Traverse the vertices in the polygon area polygen or fill area hatch in turn, add the coordinates of the vertices on the left side of the median line to the data array for the left laser, and add the coordinates of the vertices on the right side of the median line Added to the data array for the right laser; the coordinates of the two intersection points are added to both the data array for the left laser and the data array for the right laser.

Step 3-7: If iMin1 is less than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x=fValue+iOffset of the right boundary line, then the polygon area polygen or the hatch area falls on the left laser Within the illumination range of the polygon area, add the data of the polygon area polygen or the fill area hatch to the data array for the left laser;

Step 3-8: If both iMin1 and iMax1 are smaller than the abscissa x1=fValue-iOffset of the left boundary line, then the polygonal area polygen or the hatch area falls within the illumination range of the left laser, and the polygonal area polygen or fill The data for the area hatch is added to the data array for the left laser.

Further, after the step 3, it also includes:

The host computer starts two threads at the same time, and the two threads take out the data in the data array for the left laser and the data in the data array for the right laser respectively for printing. The printing includes: the data for the left laser The data in the data array starts a thread to perform printing by driving the left laser vibrating mirror to move the left laser emitting the left laser, and the data in the data array for the right laser starts another thread to drive the right laser vibrating mirror to This moves the right laser that emits the right laser to perform printing.

The beneficial effects of the present invention are:

(1) Fully reflect the actual situation of the assembly of the dual lasers of the 3D printing host computer. That is to say, there is an intersection and overlapping area of the illumination range of the two lasers. Before printing, the two lasers need to continuously calibrate the data files to achieve an accurate balance, which can achieve a perfect match between the two parts after division.

(2) The calculation method of which laser printing range the data of all data files is assigned to is reasonable and accurate, and the left area and right area determined by dividing the median line, left boundary line and right boundary line will not appear common edges are blocked Repeated printing twice leads to the waste of resources and the reduction of printing efficiency.

(3) The data allocation algorithm for the cross-overlapping public area of the two lasers' illumination ranges is innovative. It first calculates the printing time of the data currently contained in the left laser and the printing time of the data currently contained in the right laser, and then compares the two sizes . Whichever laser has the shortest printing time, add the data of the polygonal area polygen or the filling area hatch in the current overlapping public area to the laser for printing, which improves the printing balance of the two lasers.

(4) It can ensure that the two lasers start printing at the same time. Combined with the above method of distributing the data in the common area to the preset data array for the left laser or the data array for the right laser, the graphics in the common area can be The data is added to the side of the short printing time, which makes up for the gap of inconsistent printing time, improves the balance of the printing tasks of the dual lasers in 3D printing, and also increases the probability of dual lasers synchronously ending.

It effectively avoids the dual laser printing method in the prior art 3D printing, which does not consider the positional relationship of the complete polygonal area polygon or the two sub-parts of the filled area on the part, and the common side is printed twice, resulting in a waste of resources And it reduces the printing efficiency, and it is difficult to finish printing on both sides synchronously, so that the synchronization is insufficient.

Description of drawings

Fig. 1 is a schematic diagram of the irradiation ranges of the left laser and the right laser in the present invention.

Fig. 2 is a schematic diagram of the intersection area of the dual lasers of the present invention.

Fig. 3 is a schematic diagram of the public area of the present invention.

FIG. 4 is a schematic diagram of the polygonal region polygen or the filled region hatch falling within the illumination range of the laser on the right according to the present invention.

FIG. 5 is another schematic diagram of the polygonal region polygen or the filled region hatch falling within the illumination range of the laser on the right according to the present invention.

Fig. 6 is a schematic diagram of the present invention where iMin1 is smaller than the abscissa x1=fValue-iOffset of the left boundary line, while iMax1 is larger than the abscissa x=fValue+iOffset of the right boundary line.

FIG. 7 is a schematic diagram of the polygonal area polygen or the filled area hatch falling within the illumination range of the laser on the left according to the present invention.

FIG. 8 is another schematic diagram of the polygonal area polygon or the filled area hatch falling within the illumination range of the laser on the left according to the present invention.

Fig. 9 is a structural diagram of modules and threads running on the host computer according to the present invention.

FIG. 10 is an overall flow chart of the splitting method of the 3D printing control system for dual-laser splitting according to the present invention.

Fig. 11 is a flowchart of steps 3-1 to 3-4 of the present invention.

Fig. 12 is a flowchart of steps 3-5 to 3-8 of the present invention.

Fig. 13 is a flowchart of steps 3-6-1 to 3-6-2 of the present invention.

Detailed ways

The application will be further described below in conjunction with the drawings and embodiments.

As shown in Figure 1-Figure 13, the 3D printing control system for dual laser segmentation includes:

The left laser and the right laser are respectively connected with the left laser vibrating mirror and the right laser vibrating mirror, the left laser vibrating mirror and the right laser vibrating mirror are respectively connected with the left vibrating mirror board and the right vibrating mirror board, and the left vibrating mirror Both the mirror board and the right vibrating mirror board are connected with the host computer; the host computer can be a laptop, PLC or PDA.

The modules running on the host computer include:

The processing module also includes: for judging the current polygon area polygon

Or fill the positional relationship between the minimum value iMin1 of the abscissa of all vertices in the area hatch and the maximum value of iMax1 of the abscissa of all vertices and the abscissa x1 of the left border line; if iMin1 is greater than or equal to the abscissa x1 of the left border line=fValue-iOffset, Simultaneously, iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the border line on the right side, so this polygonal area polygen or filling area hatch is just public area; Otherwise, this polygonal area polygen or filling area hatch is just not public area; If this polygonal area polygen Or the filling area hatch is a public area, and the data in the public area is allocated to the preset data array for the left laser or the data array for the right laser; if the polygonal area polygen or the filling area hatch is not a public area, and If iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right boundary line, then the polygonal area polygen or the filled area hatch falls within the illumination range of the right laser, Just add the data of this polygonal area polygen or the filling area hatch into the data array for the right laser; if iMin1 and iMax1 are all greater than the abscissa x2=fValue+iOffset of the right border line, then this polygonal area polygen or filling area hatch Just fall within the illumination range of the laser on the right, just add the data of the polygon area polygen or the fill area hatch into the data array for the right laser; If it is greater than the abscissa x=fValue+iOffset of the right boundary line, then the polygon area polygen or the filled area hatch is divided by the median line; if iMin1 is smaller than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the right side The abscissa x=fValue+iOffset of the boundary line, then the polygonal area polygen or the filling area hatch falls within the illumination range of the left laser, and the data of the polygonal area polygen or the filling area hatch are added to the data for the left laser In the array; if both iMin1 and iMax1 are smaller than the abscissa x1=fValue-iOffset of the left boundary line, then the polygonal area polygen or the filled area hatch falls within the illumination range of the left laser, and the polygonal area polygen or the filled area hatch The data from is added to the data array for the left laser.

The processing module also includes: if the printing time of the data currently contained in the data array for the left laser is shorter than the printing time of the data currently contained in the data array for the right laser, adding the data in the common area for the left The data array of the laser; if the printing time of the data currently contained in the data array for the right laser is shorter than the printing time of the data currently contained in the data array for the left laser, add the data in the common area to the data for the right laser in the data array.

The processing module also includes: for first taking out the coordinates of two intersection points of the polygonal area polygen or the filling area hatch and the median line; The vertex coordinates on the left side of the line are added to the data array for the left laser, and the vertex coordinates on the right side of the median line are added to the data array for the right laser; the coordinates of the two intersection points are added to the data array for the left laser The data array for the right laser is also added to the data array for the right laser.

The host computer also includes two threads, and the two threads are used to print the data in the data array for the left laser and the data in the data array for the right laser respectively, and the printing includes: The data in the data array for the left laser starts a thread to perform printing by driving the left laser galvanometer to move the left laser that emits the left laser, and starts another thread to drive the data in the data array for the right laser The right laser galvanometer moves the right laser that emits the right laser to perform printing.

When using dual laser printing, the 3D printing device is equipped with two lasers, and the two lasers are started to print parts at the same time. At this time, the splitting method of the 3D printing control system for dual laser splitting described in the present invention can be used.

In addition, a left laser and a right laser located above the 3D printing cabin are respectively arranged on the left and right sides of the 3D printing cabin.

When the left laser and the right laser emit the left laser and the right laser respectively, there will be an overlapping area on the substrate in the 3D printing cabin, as shown in Figure 2; the middle of the three lines in the middle of the inner rectangle in Figure 2 Root line, which represents a vertical dividing line divided according to the X-axis direction, its abscissa x=fValue, the vertical dividing line is perpendicular to the X-axis direction, and the method of dividing according to the Y-axis direction is the same as dividing according to the X-axis defense line Reasonably, the X-axis is taken as an example here. Both sides of the vertical dividing line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction. The right boundary line represents the rightmost illumination range boundary of the left laser; the left boundary The line represents the leftmost boundary of the illumination range of the right laser; the distance between the vertical dividing line and the left boundary line is equal to the distance between the vertical dividing line and the right boundary line, both of which are iOffset. Then, through calculation, the abscissa of the left border line is x1=fValue-iOffset, and the abscissa of the right border line is x2=fValue+iOffset.

The splitting method of the 3D printing control system for double laser splitting comprises the following steps:

Step 1: Place the part to be printed on the substrate in the 3D printing cabin, and the host computer parses out the data file corresponding to the part to be printed; this data file is the image in the 3D printing file, and the image may Contains multiple polygonal area polygen or filled area hatch.

Divided by the median line, the left boundary line and the right boundary line according to the X-axis direction, then the median line as its vertical division line is a vertical division line perpendicular to the X-axis direction, and the vertical division line is the data file The rectangular frame where the image is located is cut into two identical sub-rectangular frames on the left and right, and the largest ordinate, the smallest ordinate, the largest abscissa and the smallest abscissa of the rectangular frame where the image is located in the data file are respectively is the largest ordinate, the smallest ordinate, the largest abscissa, and the smallest abscissa of the image. The vertical dividing line is the dividing line that divides the rectangular frame in half in the direction perpendicular to the X axis. The vertical dividing line The abscissa x=fValue;

Step 3: The host computer sequentially processes each polygonal area polygen or filling area hatch of the image in the data file, and performs segmentation on the polygonal area polygen or filling area hatch with a dual laser segmentation mode. In this way, the original image of a data file will be divided and stored in the data array for the left laser and the data array for the right laser.

Sequential processing can perform processing on the polygonal area polygen or the filled area hatch in the image in the order from left to right and then from top to bottom.

The method for performing segmentation with a dual laser segmentation mode on the polygonal area polygen or the filled area hatch specifically includes:

Step 3-1: Determine the positional relationship between the minimum value iMin1 of the abscissa of all vertices in the current polygon area polygen or the filled area hatch, the maximum value iMax1 of the abscissa of all vertices, and the abscissa x1 of the left boundary line, i.e. iMin1 and x1= The size relationship of fValue-iOffset;

Both sides of the median line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction, where the right boundary line represents the rightmost illumination range boundary of the left laser; the left boundary line represents the leftmost illumination range boundary of the right laser ; The distance between the median line and the left boundary line is equal to the distance between the vertical dividing line and the right boundary line, both of which are iOffset, then through calculation, the abscissa of the left boundary line is x1=fValue-iOffset, and the abscissa of the right boundary line is x2 =fValue+iOffset.

Step 3-2: If iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left border line, and iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the right border line simultaneously, then this polygonal area polygen or fill area hatch (ie Fig. 3 Middle pentagon) is just the common area as shown in Figure 3; Otherwise, this polygonal area polygen or filling area hatch just is not public area;

The method of distributing the data in the common area to the preset data array for the left laser or the data array for the right laser includes: if the data array for the left laser now contains data whose printing time is shorter than that for the right If the printing time of the data contained in the data array of the laser is short, the data in the common area will be added to the data array for the left laser; if the printing time of the data contained in the data array for the right laser is shorter than that for the left laser The printing time of the data currently contained in the data array is short, so the data in the common area is added to the data array for the right laser. Here, the printing time for the data currently contained in the data array for the left laser and the printing time for the data currently contained in the data array for the right laser are respectively calculated.

The method for calculating the printing time of the data currently contained in the data array for the left laser includes: first counting the total perimeter of all polygonal regions polygen or filled area hatch in the left laser data array, and then dividing the total perimeter by the left laser The speed of movement during 3D printing results in the printing time for the data currently contained in the data array of the left laser.

The method for calculating the printing time of the data currently contained in the data array for the right laser includes: first counting the total perimeter of all polygonal areas polygen or filling area hatch in the right laser data array, and then dividing the total perimeter by the right laser The moving speed during 3D printing just obtains the printing time for the data currently contained in the data array of the right laser.

Step 3-4: If the polygon area polygen or the filled area hatch is not a public area, and if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right boundary line, As shown in Figure 4, then the polygonal area polygen or the filling area hatch (hexagon as shown in Figure 4) just falls within the illumination range of the laser on the right, and the data of the polygonal area polygen or the filling area hatch are added to Used in the data array of the laser on the right;

Step 3-5: If both iMin1 and iMax1 are greater than the abscissa x2=fValue+iOffset of the right boundary line, i.e. iMin1>fValue+iOffset, iMax>fValue+iOffset, as shown in Figure 5, then the polygonal area polygen or filled area Hatch (hexagon as shown in Figure 5) just falls in the illumination scope of laser on the right side, just add the data of this polygonal area polygen or filling area hatch in the data array that is used for the right side laser;

Step 3-6: If iMin1 is smaller than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x=fValue+iOffset of the right boundary line, then the polygon area polygen or the filled area hatch is defined by the median line Segmentation; as shown in Figure 6.

The method for dividing by the median line in the steps 3-6 includes:

Step 3-6-1: First take out the coordinates of the two intersection points of the polygon area polygen or the filled area hatch and the median line, for example, the coordinates of the two intersection points are (xA, yA) and (xB, yB);

The method of taking out the coordinates of the two intersection points of the polygon area polygen or the filled area hatch and the median line can be illustrated by the following example:

The polygonal area polygen or the filled area hatch is composed of several straight lines (as shown in FIG. 6 ). The polygonal area polygen or the filled area hatch generally has two intersection points with the median line, which are respectively set as A and B. Here, taking the calculation of the coordinates of point A as an example, you can traverse all the vertices in the polygonal area polygen or the filled area hatch in order, and find the first and last two vertex coordinates (x1, y1) and (x2, y2). From these two vertices, calculate the equation of a straight line on which they lie. The method of calculating the straight line equation is: first calculate the slope k=(y2-y1)/(x2-x1), and then use the point slope formula to calculate the straight line equation as y-y1=k(x-x1). Because the straight line equation of the median line is x=fValue and the x coordinates of all points on the median line are equal, so substituting x=fValue into the above straight line equation can find the y value of the point, and calculate the intersection coordinate A(x, y).

The calculation method of point B is similar to that of point A, and will not be repeated here.

Step 3-6-2: Traverse the vertices in the polygon area polygen or fill area hatch in turn, add the coordinates of the vertices on the left side of the median line to the data array for the left laser, and add the coordinates of the vertices on the right side of the median line Added to the data array for the right laser; the coordinates of the two intersection points are added to both the data array for the left laser and the data array for the right laser. Note, however, that there will be no connection between the two intersections in the data array for the left laser and the data array for the right laser.

In this way, the median line divides a polygon area polygen or a filled area hatch into two sub-areas, and the two sub-areas are printed in the left laser and the right laser respectively. When the straight line is divided, adding the intersection point to the left laser ensures that a new straight line is generated in the left sub-region and has an endpoint; it is also added to the right laser to ensure that a new straight line is generated in the right sub-region and has an endpoint. This way when they are printed separately, they have independence and integrity from each other.

Step 3-7: If iMin1 is less than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x=fValue+iOffset of the right boundary line, as shown in Figure 7, then the polygonal area polygen or filled area Hatch (polygon as shown in Figure 7) just falls in the illumination range of left laser, just add the data of this polygon area polygen or filling area hatch in the data array that is used for left laser;

Step 3-8: if iMin1 and iMax1 are all less than the abscissa x1=fValue-iOffset of the left boundary line, as shown in Figure 8, then this polygonal area polygen or filling area hatch (polygon as shown in Figure 8) just falls on Within the illumination range of the left laser, the data of the polygon area polygen or the filled area hatch is added to the data array for the left laser.

After said step 3, also include:

The host computer starts two threads at the same time, and the two threads take out the data in the data array for the left laser and the data in the data array for the right laser respectively for printing. The printing includes: the data for the left laser The data in the data array starts a thread to perform printing by driving the left laser vibrating mirror to move the left laser emitting the left laser, and the data in the data array for the right laser starts another thread to drive the right laser vibrating mirror to This moves the right laser that emits the right laser to perform printing. In this way, printing can be started at the same time, combined with the above method of distributing the data in the common area to the preset data array for the left laser or the data array for the right laser, the graphics data in the common area can be added to the printing time. On the one hand, it makes up for the gap of inconsistent printing time, improves the balance of 3D printing dual-laser printing tasks, and also increases the probability of dual-laser synchronous end.

The present invention proposes an efficient dual-laser segmentation algorithm based on the traditional algorithm for evenly dividing the print area of a part by dual lasers. In the efficient segmentation algorithm, the area where the part is located is divided into three areas, namely the left area, the middle overlapping area and the right area. The left area falls within the printing range of the left laser and is printed by the left laser; the right area falls within the printing range of the right laser and is printed by the right laser; for the middle overlapping area, first calculate the printing time of the existing data of the left laser and Calculate the relationship between the printing time of the existing laser data on the right, and whoever has the shortest time will add the current part to which side to print, so as to ensure that the dual laser printing starts and ends at the same time.

The present application has been described above in the manner of illustrating the embodiments, and those skilled in the art should understand that the present disclosure is not limited to the embodiments described above, and various changes can be made without departing from the scope of the present application. change and replace.

Claims

A 3D printing control system for double laser division, characterized in that it includes:

There are two lasers on the left and right sides of the 3D printing cabin, the laser on the left is the left laser, the laser on the right is the right laser, the laser emitted by the left laser is the left laser, and the laser emitted by the right laser is the right laser. The left laser and the right laser constitute a double laser;

The left laser and the right laser are respectively connected with the left laser vibrating mirror and the right laser vibrating mirror, the left laser vibrating mirror and the right laser vibrating mirror are respectively connected with the left vibrating mirror board and the right vibrating mirror board, and the left vibrating mirror Both the mirror board and the right vibrating mirror board are connected with the upper computer for communication;

The modules running on the host computer include:

An analysis module, the analysis module is used to analyze the data file corresponding to the part currently to be printed;

A segmentation module, the segmentation module is used to divide the image in the data file with a median line, a left boundary line and a right boundary line in the X-axis direction;

A processing module, the processing module is used to sequentially process each polygonal area or filled area of the image in the data file, and perform segmentation on the polygonal area or filled area with a dual laser segmentation mode;

Described processing module also comprises: be used for judging the minimum value iMin1 of all vertex abscissas and the maximum value iMax1 of all vertex abscissas and the abscissa x1 of the left border line in this polygonal area or filling area at present; If iMin1 is greater than Equal to the abscissa x1=fValue-iOffset of the border line on the left, and iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the border line on the right simultaneously, then this polygonal area or filled area is just public area; Otherwise, this polygonal area or filled area is just Not a public area; if the polygonal or filled area is a public area, assign the data in the public area to the preset data array for the left laser or the data array for the right laser; if the polygonal or filled area It is not a public area, and if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right boundary line, then the polygonal area or filled area falls under the illumination of the laser on the right Within the scope, just add the data of this polygonal area or filling area in the data array that is used for right laser; If iMin1 and iMax1 are all greater than the abscissa x2=fValue+iOffset of right border line, then this polygonal area or filling area just If it falls within the illumination range of the laser on the right, add the data of the polygonal or filled area to the data array for the laser on the right; if iMin1 is smaller than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the right boundary The abscissa of the line x=fValue+iOffset, then the polygonal area or filled area is divided by the median line; if iMin1 is less than the abscissa of the left boundary line x1=fValue-iOffset, and iMax1 is less than or equal to the abscissa of the right boundary line x=fValue+iOffset, then this polygonal area or filled area just falls within the illumination range of the laser on the left side, just add the data of this polygonal area or filled area into the data array for the left side laser; if iMin1 and iMax1 are all less than Abscissa x1=fValue-iOffset of the left boundary line, then this polygonal area or filled area just falls within the illumination range of the left laser, the data of this polygonal area or filled area is just added in the data array that is used for the left laser, fValue is the abscissa of the vertical dividing line, and the distance between the vertical dividing line and the left boundary line and the distance between the vertical dividing line and the right boundary line are both iOffset.
According to the 3D printing control system for double laser division according to claim 1,

It is characterized in that, the processing module also includes: if the printing time of the data currently contained in the data array for the left laser is shorter than the printing time of the data currently contained in the data array for the right laser, the data in the common area Add the data array for the left laser; if the printing time of the data currently contained in the data array for the right laser is shorter than the printing time of the data currently contained in the data array for the left laser, add the data in the common area to It is used in the data array of the right laser.
According to the 3D printing control system for double laser division according to claim 1,

It is characterized in that, the processing module also includes: for taking out the coordinates of two intersection points of the polygonal area or filled area and the median line first; The vertex coordinates on the left side of the line are added to the data array for the left laser, and the vertex coordinates on the right side of the median line are added to the data array for the right laser; the coordinates of the two intersection points are added to the data array for the left laser The data array for the right laser is also added to the data array for the right laser.
According to the 3D printing control system for double laser division according to claim 1,

It is characterized in that, the host computer also includes two threads, and the two threads are used to respectively take out the data in the data array for the left laser and the data in the data array for the right laser for printing. Printing includes: start a thread with the data in the data array for the left laser to move the left laser that emits the left laser by driving the left laser galvanometer to perform printing, and start another thread with the data in the data array for the right laser The thread comes to perform printing by driving the right laser vibrating mirror to move the right laser that emits the right laser.
A kind of segmentation method for the 3D printing control system of double laser segmentation, it is characterized in that, comprises the steps:

Step 1: Place the parts to be printed on the substrate in the 3D printing cabin, and the host computer parses out the data files corresponding to the parts to be printed;

Step 2: Then the host computer divides the image in the data file with the median line, the left boundary line and the right boundary line in the X-axis direction;

Step 3: The host computer sequentially processes each polygonal area or filled area of the image in the data file, and performs segmentation on the polygonal area or filled area with a dual laser segmentation mode;

The method for performing segmentation on the polygonal area or filled area with a dual laser segmentation mode specifically includes:

Step 3-1: Determine the positional relationship between the minimum value iMin1 of the abscissa of all vertices in the current polygonal area or filled area, the maximum value of iMax1 of the abscissa of all vertices, and the abscissa x1 of the left boundary line;

Step 3-2: If iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x2=fValue+iOffset of the right boundary line, then the polygonal area or filled area is a public area; otherwise , the polygonal or filled area is not a public area;

Step 3-3: If the polygonal area or filled area is a public area, allocate the data in the public area to the preset data array for the left laser or the data array for the right laser;

Step 3-4: If the polygon area or filled area is not a common area, and if iMin1 is greater than or equal to the abscissa x1=fValue-iOffset of the left border line, and iMax1 is greater than the abscissa x2=fValue+iOffset of the right border line, then the The polygonal area or the filled area just falls within the illumination range of the laser on the right, and the data of the polygonal area or the filled area is added to the data array for the right laser;

Step 3-5: If both iMin1 and iMax1 are greater than the abscissa x2=fValue+iOffset of the right boundary line, then the polygonal area or filled area falls within the illumination range of the laser on the right, and the data of the polygonal area or filled area is Added to the data array for the right laser;

Step 3-6: If iMin1 is less than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is greater than the abscissa x=fValue+iOffset of the right boundary line, then the polygonal area or filled area is divided by the median line;

Step 3-7: If iMin1 is less than the abscissa x1=fValue-iOffset of the left boundary line, and iMax1 is less than or equal to the abscissa x=fValue+iOffset of the right boundary line, then the polygonal area or filled area falls under the illumination of the left laser Within the range, add the data of the polygon area or filled area to the data array for the left laser;

Step 3-8: If both iMin1 and iMax1 are smaller than the abscissa x1=fValue-iOffset of the left boundary line, then the polygonal area or filled area falls within the illumination range of the left laser, and the data of the polygonal area or filled area Added to the data array for the left laser, fValue is the abscissa of the vertical dividing line, the distance between the vertical dividing line and the left boundary line and the distance between the vertical dividing line and the right boundary line are both iOffset.
According to claim 5, the segmentation method for the 3D printing control system for dual laser segmentation is characterized in that, according to the X-axis direction, the median line, the left boundary line and the right boundary line are used as the middle of the vertical dividing line. The bit line is a vertical dividing line perpendicular to the X-axis direction. The vertical dividing line cuts the rectangular frame where the image in the data file is located into two identical sub-rectangular frames on the left and right. The image in the data file is divided into The maximum ordinate, the minimum ordinate, the maximum abscissa and the minimum abscissa of the rectangular frame at are respectively the maximum ordinate, minimum ordinate, maximum abscissa and minimum abscissa of the image. A line is a dividing line that divides the rectangular frame in half in a direction perpendicular to the X axis, and the abscissa of the vertical dividing line is x=fValue;

Both sides of the median line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction, where the right boundary line represents the rightmost illumination range boundary of the left laser; the left boundary line represents the leftmost illumination range boundary of the right laser ; The distance between the median line and the left border line is equal to the distance between the vertical dividing line and the right border line, both are iOffset.
The splitting method for the 3D printing control system for double laser splitting according to claim 6, characterized in that the data in the common area is allocated to the preset data array for the left laser or the data array for the right laser The method includes: if the printing time of the data currently contained in the data array for the left laser is shorter than the printing time of the data currently contained in the data array for the right laser, adding the data in the common area to the data for the left laser Data array; if the data array for the right laser currently contains data whose print time is shorter than the data array for the left laser, add the data in the common area to the data for the right laser inside the array;

The method for dividing by the median line in the steps 3-6 includes:

Step 3-6-1: First take out the coordinates of the two intersection points of the polygonal area or filled area and the median line;

Step 3-6-2: Traverse the vertices in the polygonal area or filled area in turn, add the coordinates of the vertices on the left side of the median line to the data array for the left laser, and add the coordinates of the vertices on the right side of the median line to In the data array for the right laser; the coordinates of the two intersection points are added to both the data array for the left laser and the data array for the right laser.
According to the segmentation method of the 3D printing control system for double laser segmentation according to claim 5, it is characterized in that, after the step 3, it also includes:

The host computer starts two threads at the same time, and the two threads take out the data in the data array for the left laser and the data in the data array for the right laser respectively for printing. The printing includes: the data for the left laser The data in the data array starts a thread to perform printing by driving the left laser vibrating mirror to move the left laser emitting the left laser, and the data in the data array for the right laser starts another thread to drive the right laser vibrating mirror to This moves the right laser that emits the right laser to perform printing.