CN113942230B - 3D printing control system for double-laser segmentation and segmentation method thereof - Google Patents
3D printing control system for double-laser segmentation and segmentation method thereof Download PDFInfo
- Publication number
- CN113942230B CN113942230B CN202111559838.0A CN202111559838A CN113942230B CN 113942230 B CN113942230 B CN 113942230B CN 202111559838 A CN202111559838 A CN 202111559838A CN 113942230 B CN113942230 B CN 113942230B
- Authority
- CN
- China
- Prior art keywords
- laser
- area
- data
- line
- data array
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/30—Auxiliary operations or equipment
- B29C64/386—Data acquisition or data processing for additive manufacturing
- B29C64/393—Data acquisition or data processing for additive manufacturing for controlling or regulating additive manufacturing processes
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/20—Apparatus for additive manufacturing; Details thereof or accessories therefor
- B29C64/264—Arrangements for irradiation
- B29C64/268—Arrangements for irradiation using laser beams; using electron beams [EB]
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/20—Apparatus for additive manufacturing; Details thereof or accessories therefor
- B29C64/264—Arrangements for irradiation
- B29C64/277—Arrangements for irradiation using multiple radiation means, e.g. micromirrors or multiple light-emitting diodes [LED]
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y30/00—Apparatus for additive manufacturing; Details thereof or accessories therefor
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y50/00—Data acquisition or data processing for additive manufacturing
- B33Y50/02—Data acquisition or data processing for additive manufacturing for controlling or regulating additive manufacturing processes
Landscapes
- Engineering & Computer Science (AREA)
- Chemical & Material Sciences (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- Optics & Photonics (AREA)
- Mechanical Engineering (AREA)
- Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Plasma & Fusion (AREA)
- Laser Beam Processing (AREA)
Abstract
A3D printing control system for double laser segmentation and a segmentation method thereof comprise: the module running on the upper computer comprises: the analysis module is used for analyzing a data file corresponding to a part to be printed currently; the segmentation module is used for segmenting the 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; a processing module for sequentially processing each polygon region polygen or fill region hash of the image in the data file. The defects that in the prior art, the position relation of a complete polygonal region polygon on a part or two sub-parts divided from a filling region is not considered in a double-laser printing method in 3D printing, and a common edge is repeatedly printed twice, so that resource waste is caused, the printing efficiency is reduced, and the balance of printing on two sides is difficult to realize are effectively overcome.
Description
Technical Field
The application relates to the technical field of 3D printing control, in particular to a 3D printing control system aiming at double laser segmentation and a segmentation method thereof.
Background
With the continuous breakthrough of 3D printing research and development technology, 3D printing has been successfully applied to the fields of aerospace, biomedical, architecture, automobiles, and the like, and has continuously made breakthrough progress. To better improve performance, the range is from single laser printing of parts to multiple laser simultaneous printing.
Currently, 3D printers supporting dual laser printing are numerous. The time consuming of dual laser printing is quite different. The time taken to print a part with dual lasers depends on the goodness of the dual laser segmentation algorithm.
In particular, when a 3D printer actually prints a part, if only one laser is used for printing, it will take a long time to print a complete part, especially a large part. However, if two lasers divide the part into two parts and print the parts simultaneously, the printing time of the parts can be greatly shortened. The time for the dual laser printing of the part depends on the algorithm for the dual laser to divide the part. The algorithm is superior and efficient, and the printed parts not only have complete cutting joints, but also have greatly shortened printing time. Therefore, the research of the dual laser segmentation algorithm is very important for all manufacturers. While dual laser printing focuses on the balance of the left and right regions. The data resources of the left laser printing area and the right laser printing area are balanced.
In the existing double-laser printing method in 3D printing, the whole part on the substrate is uniformly divided into two parts according to a median parting line, the part on the left side is subjected to laser printing on the left side, and the part on the right side is subjected to laser printing on the right side.
Such a division method may have the following problems:
1, a complete graphic region on the part, such as a polygon region polygon or a fill region hash, is strictly divided into two sub-portions by a median division line, without considering the positional relationship of the two sub-portions at all.
2. Sometimes, the same edge or line appears in a local area, and the same edge or line is printed on the left side and the right side by laser, so that the common edge is printed twice repeatedly, resource waste is formed, and the printing efficiency is reduced.
3. Due to the fact that the parts are divided according to the median dividing line, data of the parts on two sides are not uniform. The left laser and the right laser start printing at the same time, but the balance is insufficient.
Disclosure of Invention
In order to solve the problems, the 3D printing control system and the transmission method for double laser segmentation are provided, and the defects that in the double laser printing method in the 3D printing in the prior art, the position relation of a complete polygonal region polygon or two sub-parts segmented from a filling region on a part is not considered, and the common edge is repeatedly printed twice, so that resource waste is formed, the printing efficiency is reduced, and the balance of printing on two sides is difficult to realize are effectively overcome.
In order to overcome the defects in the prior art, the application provides a solution for a double-laser-segmentation 3D printing control system and a transmission method, and the solution is as follows:
a 3D printing control system for dual laser splitting, comprising:
the left side and the right side of the 3D printing cabin are respectively provided with two lasers, the laser positioned on the left side is a left laser, the laser positioned on the right side is a right laser, the laser emitted by the left laser is a left laser, the laser emitted by the right laser is a right laser, and the left laser and the right laser form double lasers;
the left laser and the right laser are respectively connected with a left laser galvanometer and a right laser galvanometer, the left laser galvanometer and the right laser galvanometer are respectively connected with a left galvanometer board card and a right galvanometer board card, and the left galvanometer board card and the right galvanometer board card are both in communication connection with an upper computer;
the module running on the upper computer comprises:
the analysis module is used for analyzing a data file corresponding to a part to be printed currently;
the segmentation module is used for segmenting the 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 the processing module is used for sequentially processing each polygonal area polygen or filling area hash of the image in the data file and executing segmentation on the polygonal area polygen or filling area hash by using a double laser segmentation mode.
Further, the processing module further includes: for judging the current polygonal area
The position relationship between the minimum value iMin1 of the abscissas of all the vertices and the maximum value iMax1 of the abscissas of all the vertices in the polygen or the filling area hash and the abscissa x1 of the left boundary line; if iMin1 is equal to or greater than x1= fValue-iOffset of the left border line, while iMax1 is equal to or less than x2= fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is a common region; otherwise, the polygon region polygen or the fill region hash is not a common region; if the polygon region polygen or the filling region hash is a common region, distributing the data of the common region into a preset data array for the left laser or a preset data array for the right laser; if the polygon region polygen or the fill region hash is not a common region, and if iMin1 is equal to or greater than x1= fValue-iOffset of the left border line, and if iMax1 is greater than x2= fValue + iOffset of the right border line, then the polygon region polygen or the fill region hash falls within the illumination range of the right laser light, the data of the polygon region polygen or the fill region hash is added to the data array for the right laser light; if both iMin1 and iMax1 are greater than the abscissa x2= fValue + iOffset of the right border line, then the polygon polygen or fill area hash falls within the illumination range of the right laser, and the data of the polygon polygen or fill area hash is added to the data array for the right laser; if the iMin1 is smaller than the abscissa x1= fValue-iOffset of the left border line, while the iMax1 is larger than the abscissa x = fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is divided by the median line; if iMin1 is less than x1= fValue-iOffset for the left border line, while iMax1 is less than or equal to x = fValue + iOffset for the right border line, then the polygon region polygen or fill region hash falls within the illumination range of the left laser, and the data for the polygon region polygen or fill region hash is added to the data array for the left laser; if both iMin1 and iMax1 are smaller than the abscissa x1 of the left border line = fValue-iOffset, then the polygon region polygen or fill region hash falls within the illumination range of the left laser, and the data of the polygon region polygen or fill region hash is added to the data array for the left laser, fValue being the abscissa of the vertical dividing line, the distance of the vertical dividing line from the left border line and the distance of the vertical dividing line from the right border line being iOffset.
Further, the processing module further includes: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; if the data array for the right laser contains data having a shorter print time than the data array for the left laser, the data for the common area is added to the data array for the right laser.
Further, the processing module further includes: the coordinate of two intersection points of the polygonal region polygen or the filling region hash and the median line is taken out firstly; the vertex coordinates in the polygon region polygen or the filling region hash are sequentially traversed, the vertex coordinates on the left side of the median line are added into the data array for the left laser, and the vertex coordinates on the right side of the median line are added into the data array for the right laser; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser.
Further, the host computer still includes two threads, two threads are used for taking out the data in the data array that is used for the laser on the left side and the data that is used for the laser on the right side in the data array respectively and prints, and this printing includes: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser.
A segmentation method for a dual laser segmented 3D printing control system, comprising the steps of:
step 1: placing the part to be printed on a substrate in a 3D printing cabin, and analyzing a data file corresponding to the current part to be printed by an upper computer;
step 2: then, the upper computer divides the 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;
further, dividing the image in the data file into a rectangular frame and a right rectangular frame, wherein the central line is perpendicular to the X-axis direction, the vertical dividing line is a vertical dividing line which is perpendicular to the X-axis direction and is used for cutting the rectangular frame where the image is located in the data file into a left rectangular frame and a right rectangular frame which are the same, the maximum ordinate, the minimum ordinate, the maximum abscissa and the minimum abscissa of the rectangular frame where the image is located in the data file are respectively the maximum ordinate, the minimum ordinate, the maximum abscissa and the minimum abscissa of the image, the vertical dividing line is a dividing line which is divided from the rectangular frame in half in the direction perpendicular to the X-axis direction, and the abscissa X = fValue of the vertical dividing line;
two sides of the median line are respectively adjacent to a mutually parallel boundary line perpendicular to the X-axis direction, wherein 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 partition line and the right boundary line, which are all iOffset.
And step 3: and the upper computer sequentially processes each polygon area polygen or filling area hash of the image in the data file and performs segmentation on the polygon area polygen or filling area hash by using a double laser segmentation mode.
Further, the method for performing the division on the polygon region polygen or the filling region hash by using the dual laser division mode specifically includes:
step 3-1: judging the position relationship between the minimum value iMin1 of the abscissa of all the vertexes in the current polygonal region polygen or filling region hash and the maximum value iMax1 of the abscissa of all the vertexes and the abscissa x1 of the left boundary line;
furthermore, two sides of the median line are respectively adjacent to a mutually parallel boundary line perpendicular to the X-axis direction, wherein 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 partition line and the right boundary line, which are all iOffset, 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 equal to or greater than x1= fValue-iOffset of the left border line, while iMax1 is equal to or less than x2= fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is a common region; otherwise, the polygon region polygen or the fill region hash is not a common region;
step 3-3: if the polygon region polygen or the filling region hash is a common region, distributing the data of the common region into a preset data array for the left laser or a preset data array for the right laser;
further, a method for allocating data of a common area to a preset data array for a left laser or a preset data array for a right laser includes: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; if the data array for the right laser contains data having a shorter print time than the data array for the left laser, the data for the common area is added to the data array for the right laser.
Step 3-4: if the polygonal region polygen or the fill region hash is not public
Co-region, and if iMin1 is greater than or equal to x1= fValue-iOffset of the left border line, and iMax1 is greater than x2= fValue + iOffset of the right border line, then the polygon region polygen or fill region hash falls within the illumination range of the right laser, adding the data of the polygon region polygen or fill region hash 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 border line, then the polygon polygen or fill area hash falls within the illumination range of the right laser, and the data of the polygon polygen or fill area hash is added to the data array for the right laser;
step 3-6: if the iMin1 is smaller than the abscissa x1= fValue-iOffset of the left border line, while the iMax1 is larger than the abscissa x = fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is divided by the median line;
further, the method for dividing by using the middle bit line in the step 3-6 comprises:
step 3-6-1: firstly, taking out coordinates of two intersection points of the polygonal region polygen or the filling region hash and the median line;
step 3-6-2: sequentially traversing vertexes in the polygon region polygen or the filling region hash, adding vertex coordinates positioned on the left side of the median line into a data array for left laser, and adding vertex coordinates positioned on the right side of the median line into a data array for right laser; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser.
Step 3-7: if iMin1 is less than x1= fValue-iOffset for the left border line, while iMax1 is less than or equal to x = fValue + iOffset for the right border line, then the polygon region polygen or fill region hash falls within the illumination range of the left laser, and the data for the polygon region polygen or fill region hash is added 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, the polygon region polygen or fill region hash falls within the illumination range of the left laser light, and the data of the polygon region polygen or fill region hash is added to the data array for the left laser light.
Further, after the step 3, the method further includes:
the host computer starts two threads simultaneously, and these two threads will be used for the data in the data array of left side laser and the data that is used for the data array of right laser to take out and print respectively, should print and include: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser.
The invention has the beneficial effects that:
(1) the actual assembling condition of the dual lasers of the 3D printing upper computer is fully reflected. Namely, the two lasers have intersection and overlapping areas of illumination ranges, the data files need to be continuously calibrated before the two lasers are printed so as to achieve accurate balance, and perfect matching of the two divided parts can be realized.
(2) The calculation method for the printing range of which laser the data of all the data files are distributed to is reasonable and accurate, the determined left area and the right area are divided by the median line, the left boundary line and the right boundary line, and the problems that the common edge is repeatedly printed twice, so that the resource waste is caused and the printing efficiency is reduced are solved.
(3) The data distribution algorithm of the crossed and overlapped public area of the illumination ranges of the two lasers is innovative, the printing time of the left laser currently containing data and the printing time of the right laser currently containing data are calculated respectively, and then the sizes of the two are compared. The data of the polygon region polygen or the filling region hash in the current overlapped public region is added to the laser for printing when the printing time of the laser is short, so that the printing balance of the two lasers is improved.
(4) The method can ensure that the two lasers start to print simultaneously, and by combining the method for distributing the data of the public area to the preset data array for the left laser or the preset data array for the right laser, the graphic data of the public area can be added to the side with short printing time, so that the difference of inconsistent printing time is made up, the balance of the printing task amount of the double lasers for 3D printing is improved, and the probability of synchronous ending of the double lasers is also improved.
The defects that in the 3D printing method in the prior art, the position relation of a complete polygonal region polygon on a part or two sub-parts divided from a filling region is not considered, the common edge is repeatedly printed twice, so that resource waste is caused, the printing efficiency is reduced, and the synchronization is insufficient due to the difficulty in finishing the printing synchronization of two sides are overcome.
Drawings
Fig. 1 is a schematic view of the illumination ranges of the left laser and the right laser of the present invention.
Fig. 2 is a schematic diagram of the intersection region of the dual lasers of the present invention.
Fig. 3 is a schematic diagram of the common area of the present invention.
Fig. 4 is a schematic diagram of the polygon region polygen or the fill region notch of the present invention falling within the illumination range of the right laser.
Fig. 5 is another schematic diagram of the polygon region polygen or the fill region notch of the present invention falling within the illumination range of the right laser.
Fig. 6 is a schematic diagram of the present invention where iMin1 is less than the abscissa of the left boundary line x1= fValue-iOffset, while iMax1 is greater than the abscissa of the right boundary line x = fValue + iOffset.
Fig. 7 is a schematic diagram of the polygon region polygen or the filling region notch of the present invention falling within the illumination range of the left laser.
Fig. 8 is another schematic diagram of the polygonal region polygen or the filled region hash of the present invention falling within the illumination range of the left laser.
FIG. 9 is a block diagram of modules and threads running on the upper computer of the present invention.
Fig. 10 is an overall flowchart of a division method of the 3D printing control system for dual laser division of the present invention.
FIG. 11 is a flow chart of step 3-1 through step 3-4 of the present invention.
Fig. 12 is a flow chart of steps 3-5 through 3-8 of the present invention.
FIG. 13 is a flow chart of step 3-6-1 through step 3-6-2 of the present invention.
Detailed Description
The present application will be further described with reference to the accompanying drawings and examples.
As shown in fig. 1 to 13, the 3D printing control system for dual laser division includes:
the left side and the right side of the 3D printing cabin are respectively provided with two lasers, the laser positioned on the left side is a left laser, the laser positioned on the right side is a right laser, the laser emitted by the left laser is a left laser, the laser emitted by the right laser is a right laser, and the left laser and the right laser form double lasers;
the left laser and the right laser are respectively connected with a left laser galvanometer and a right laser galvanometer, the left laser galvanometer and the right laser galvanometer are respectively connected with a left galvanometer board card and a right galvanometer board card, and the left galvanometer board card and the right galvanometer board card are both in communication connection with an upper computer; the upper computer can be a notebook computer, a PLC or a PDA.
The module running on the upper computer comprises:
the analysis module is used for analyzing a data file corresponding to a part to be printed currently;
the segmentation module is used for segmenting the 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 the processing module is used for sequentially processing each polygonal area polygen or filling area hash of the image in the data file and executing segmentation on the polygonal area polygen or filling area hash by using a double laser segmentation mode.
The processing module further comprises: used for judging the current polygon region polygen
Or the minimum value iMin1 of all vertex abscissas and the maximum value iMax1 of all vertex abscissas in the filling area hash are in the position relationship with the abscissa x1 of the left boundary line; if iMin1 is equal to or greater than x1= fValue-iOffset of the left border line, while iMax1 is equal to or less than x2= fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is a common region; otherwise, the polygon region polygen or the fill region hash is not a common region; if the polygon region polygen or the filling region hash is a common region, distributing the data of the common region into a preset data array for the left laser or a preset data array for the right laser; if the polygon region polygen or the fill region hash is not a common region, and if iMin1 is equal to or greater than x1= fValue-iOffset of the left border line, and if iMax1 is greater than x2= fValue + iOffset of the right border line, then the polygon region polygen or the fill region hash falls within the illumination range of the right laser light, the data of the polygon region polygen or the fill region hash is added to the data array for the right laser light; if both iMin1 and iMax1 are greater than the abscissa x2= fValue + iOffset of the right border line, then the polygon polygen or fill area hash falls within the illumination range of the right laser, and the data of the polygon polygen or fill area hash is added to the data array for the right laser; if the iMin1 is smaller than the abscissa x1= fValue-iOffset of the left border line, while the iMax1 is larger than the abscissa x = fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is divided by the median line; if iMin1 is less than x1= fValue-iOffset for the left border line, while iMax1 is less than or equal to x = fValue + iOffset for the right border line, then the polygon region polygen or fill region hash falls within the illumination range of the left laser, and the data for the polygon region polygen or fill region hash is added to the data array for the left laser; if both iMin1 and iMax1 are smaller than the abscissa x1= fValue-iOffset of the left boundary line, the polygon region polygen or fill region hash falls within the illumination range of the left laser light, and the data of the polygon region polygen or fill region hash is added to the data array for the left laser light.
The processing module further comprises: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; if the data array for the right laser contains data having a shorter print time than the data array for the left laser, the data for the common area is added to the data array for the right laser.
The processing module further comprises: the coordinate of two intersection points of the polygonal region polygen or the filling region hash and the median line is taken out firstly; the vertex coordinates in the polygon region polygen or the filling region hash are sequentially traversed, the vertex coordinates on the left side of the median line are added into the data array for the left laser, and the vertex coordinates on the right side of the median line are added into the data array for the right laser; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser.
The host computer still includes two threads, two threads are used for taking out the data that will be used for in the data array of left side laser and the data that are used for in the data array of right side laser respectively and print, and this printing includes: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser.
When the double-laser printing is used, two lasers are arranged in the 3D printing equipment, and the two lasers are started to print parts simultaneously. The splitting method of the 3D printing control system for dual laser splitting described in the present invention may be employed at this time.
In addition, a left laser and a right laser which are positioned above the 3D printing cabin are respectively arranged on the left side and the right side in the 3D printing cabin, and when the left laser and the right laser respectively emit left laser and right laser, the illumination ranges are shown in fig. 1.
When the left laser and the right laser respectively emit left laser and right laser, there will be an overlapping area on the substrate in the 3D printing cabin, as shown in fig. 2; in fig. 2, the line among the three lines in the middle of the internal rectangle is a vertical dividing line divided in the X-axis direction, and the abscissa X = fValue, the vertical dividing line is perpendicular to the X-axis direction, and the division in the Y-axis direction is the same as the division in the X-axis direction, where, taking the X-axis as an example, two sides of the vertical dividing line are adjacent to a boundary line parallel to each other and perpendicular to the X-axis direction, and 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 vertical dividing line and the left boundary line is equal to the distance between the vertical dividing line and the right boundary line, which are all iOffset. Then the abscissa of the left border line is x1= fValue-iOffset and the abscissa of the right border line is x2= fValue + iOffset.
The dividing method for the double-laser divided 3D printing control system comprises the following steps:
step 1: placing the part to be printed on a substrate in a 3D printing cabin, and analyzing a data file corresponding to the current part to be printed by an upper computer; this data file is the image in the 3D printed file, which may contain a number of polygon areas polygen or fill areas hash.
Step 2: then, the upper computer divides the 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;
dividing the image in the data file into a rectangular frame and a rectangular frame, wherein the rectangular frame is divided into a left rectangular frame and a right rectangular frame, the left rectangular frame and the right rectangular frame are respectively a maximum ordinate, a minimum ordinate, a maximum abscissa and a minimum abscissa of the rectangular frame, the maximum ordinate, the maximum abscissa and the minimum abscissa of the rectangular frame are respectively a maximum ordinate, a minimum ordinate, a maximum abscissa and a minimum abscissa of the rectangular frame, the vertical dividing line is a dividing line which is divided into two halves from the rectangular frame in a direction perpendicular to the X axis, and the abscissa X = fValue;
two sides of the median line are respectively adjacent to a mutually parallel boundary line perpendicular to the X-axis direction, wherein 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 partition line and the right boundary line, which are all iOffset.
And step 3: and the upper computer sequentially processes each polygon area polygen or filling area hash of the image in the data file and performs segmentation on the polygon area polygen or filling area hash by using a double laser segmentation mode. Thus, the image of the original data file will be divided and stored in the data array for the left laser and the data array for the right laser.
The sequential processing can perform processing on the polygon region polygen or the fill region hash in the image in order from left to right and then from top to bottom.
The method for performing segmentation on the polygonal region polygen or the filled region hash in a dual laser segmentation mode specifically includes:
step 3-1: judging the position relationship between the minimum value iMin1 of the abscissas of all the vertexes in the polygon region polygen or the filling region notch and the maximum value iMax1 of the abscissas of all the vertexes and the abscissa x1 of the left boundary line, namely the size relationship between iMin1 and x1= fValue-iOffset;
two sides of the median line are respectively adjacent to a mutually parallel boundary line perpendicular to the X-axis direction, wherein 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 partition line and the right boundary line, which are all iOffset, and then 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 equal to or greater than x1= fValue-iOffset for the left border line and iMax1 is equal to or less than x2= fValue + iOffset for the right border line, then the polygon region polygen or fill region hash (i.e., the pentagon in fig. 3) is a common region as shown in fig. 3; otherwise, the polygon region polygen or the fill region hash is not a common region;
step 3-3: if the polygon region polygen or the filling region hash is a common region, distributing the data of the common region into a preset data array for the left laser or a preset data array for the right laser;
the method for distributing the data of the common area to the preset data array for the left laser or the data array for the right laser comprises the following steps: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; if the data array for the right laser contains data having a shorter print time than the data array for the left laser, the data for the common area is added to the data array for the right laser. Here, the printing time of the data included in the data array for the left laser and the printing time of the data included in the data array for the right laser are calculated, respectively.
A method of calculating a print time for data contained in a data array representation for a left hand laser, comprising: firstly, counting the total circumference of all polygon areas polygen or filling areas hash in the left laser data array, and then dividing the total circumference by the moving speed of the left laser in 3D printing to obtain the printing time of the data contained in the data array for the left laser.
A method of calculating a print time for data contained in a data array representation for a right hand laser, comprising: firstly, counting the total circumference of all polygon areas polygen or filling areas hash in the right laser data array, and then dividing the total circumference by the moving speed of the right laser in 3D printing to obtain the printing time of data contained in the right laser data array.
Step 3-4: if the polygonal region polygen or the fill region hash is not public
Co-region, and if iMin1 is greater than or equal to x1= fValue-iOffset of the left border line, and iMax1 is greater than x2= fValue + iOffset of the right border line, as shown in fig. 4, then the polygon region polygen or fill region hash (the hexagon shown in fig. 4) falls within the illumination range of the right laser light, and the data of the polygon region polygen or fill region hash is added to the data array for the right laser light;
step 3-5: if both iMin1 and iMax1 are greater than the abscissa of the right border line x2= fValue + iOffset, i.e., iMin1> fValue + iOffset, iMax > fValue + iOffset, as shown in fig. 5, then the polygon region polygen or fill region hash (shown as a hexagon in fig. 5) falls within the illumination range of the right laser light, and the data of the polygon region polygen or fill region hash is added to the data array for the right laser light;
step 3-6: if the iMin1 is smaller than the abscissa x1= fValue-iOffset of the left border line, while the iMax1 is larger than the abscissa x = fValue + iOffset of the right border line, then the polygon region polygen or fill region hash is divided by the median line; as shown in fig. 6.
The method for dividing by using the median line in the step 3-6 comprises the following steps:
step 3-6-1: firstly, taking out coordinates of two intersection points of the polygonal region polygen or the filling region hash and the median line, wherein the coordinates of the two intersection points are (xA, yA) and (xB, yB) respectively;
the method of extracting the coordinates of the two intersections of the polygon region polygen or the fill region hash and the median line can be described as follows:
the polygon region polygen or the fill region hash is formed by a plurality of straight lines (as shown in fig. 6), and there are two intersections between the polygon region polygen or the fill region hash and the median line, which are respectively designated as a and B. Taking the calculation of the coordinates of the point a as an example, all the vertices in the polygon region polygen or the fill region hash can be sequentially traversed to find the coordinates (x1, y1) of the head and the tail vertices of the straight line intersecting the median line (x2, y 2). And calculating a straight line equation of the two vertexes. The method for calculating the linear equation comprises the following steps: the slope k = (y2-y1)/(x2-x1) is calculated, and then the linear equation y-y1= k (x-x1) is calculated by using a point-slope formula. Since the equation for the straight line on the median line is x = fValue and the x coordinates of all points on the median line are equal, the point y value can be obtained by substituting x = fValue into the above equation for the point y, and the intersection coordinate a (x, y) can be calculated.
The calculation method of point B is similar to that of point a, and is not described herein again.
Step 3-6-2: sequentially traversing vertexes in the polygon region polygen or the filling region hash, adding vertex coordinates positioned on the left side of the median line into a data array for left laser, and adding vertex coordinates positioned on the right side of the median line into a data array for right laser; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser. But note that no links are created between these 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 polygonal region polygen or fill region hash into two sub-regions, which are printed in the left and right laser, respectively. After the straight line is divided, the intersection point is added into the left laser to ensure that a new straight line is generated in the left sub-area and has an end point; the addition of the right laser also ensures that a new straight line is created in the right subregion, with an end point. Thus providing independence and integrity to each other when they are printed separately.
Step 3-7: if iMin1 is less than x1= fValue-iOffset of the left border line, and iMax1 is less than or equal to x = fValue + iOffset of the right border line, as shown in fig. 7, then the polygon region polygen or fill region hash (the polygon shown in fig. 7) falls within the illumination range of the left laser, and the data of the polygon region polygen or fill region hash is added to the data array for the left laser;
step 3-8: if both iMin1 and iMax1 are less than the abscissa x1= fValue-iOffset of the left border line, as shown in fig. 8, then the polygon region polygen or fill region hash (the polygon shown in fig. 8) falls within the illumination range of the left laser, and the data of the polygon region polygen or fill region hash is added to the data array for the left laser.
After the step 3, the method further comprises the following steps:
the host computer starts two threads simultaneously, and these two threads will be used for the data in the data array of left side laser and the data that is used for the data array of right laser to take out and print respectively, should print and include: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser. Therefore, printing can be started simultaneously, and by combining the method for distributing the data of the public area to the preset data array for the left laser or the preset data array for the right laser, the graphic data of the public area can be added to the side with short printing time, so that the difference of inconsistent printing time is made up, the balance of the printing task amount of the 3D printing double lasers is improved, and the probability of synchronous ending of the double lasers is also improved.
The invention provides an efficient double-laser segmentation algorithm based on a traditional algorithm for averagely segmenting a part printing area by double lasers. An efficient segmentation algorithm divides the area where the part is located into three regions, namely a left region, a middle overlapping region and a right region. The left area is in the printing range of the left laser and is printed by the left laser; the right area falls in the printing range of the right laser and is printed by the right laser; for the middle overlapping area, the size relationship between the printing time of the left laser existing data and the printing time of the right laser existing data is calculated, and the current part is added to the side to be printed when the printing time is short, so that the simultaneous start and the simultaneous end of the double-laser printing are ensured.
The present application has been described above in an illustrative manner by way of embodiments, and it will be understood by those skilled in the art that the present disclosure is not limited to the embodiments described above, and various changes, modifications and substitutions can be made without departing from the scope of the present application.
Claims (8)
1. A 3D printing control system for dual laser splitting, comprising:
the left side and the right side of the 3D printing cabin are respectively provided with two lasers, the laser positioned on the left side is a left laser, the laser positioned on the right side is a right laser, the laser emitted by the left laser is a left laser, the laser emitted by the right laser is a right laser, and the left laser and the right laser form double lasers;
the left laser and the right laser are respectively connected with a left laser galvanometer and a right laser galvanometer, the left laser galvanometer and the right laser galvanometer are respectively connected with a left galvanometer board card and a right galvanometer board card, and the left galvanometer board card and the right galvanometer board card are both in communication connection with an upper computer;
the module running on the upper computer comprises:
the analysis module is used for analyzing a data file corresponding to a part to be printed currently;
the segmentation module is used for segmenting the 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;
a processing module for sequentially processing each polygon area or fill area of the image in the data file, performing segmentation on the polygon area or fill area using a dual laser segmentation mode;
the processing module further comprises: the method is used for judging the position relationship between the minimum value iMin1 of the horizontal coordinates of all the vertexes in the current polygonal area or filling area and the maximum value iMax1 of the horizontal coordinates of all the vertexes and the horizontal coordinate x1 of the left boundary line; if iMin1 is equal to or greater than x1= fValue-iOffset for the left border line, while iMax1 is equal to or less than x2= fValue + iOffset for the right border line, then the polygon area or fill area is a common area; otherwise, the polygon area or the fill area is not a common area; if the polygonal area or the filling area is a common area, distributing the data of the common area into a preset data array for left laser or a preset data array for right laser; if the polygon or fill area is not a common area, and if iMin1 is equal to or greater than x1= fValue-iOffset abscissa of the left border line, while iMax1 is greater than x2= fValue + iOffset abscissa of the right border line, then the polygon or fill area falls within the illumination range of the right laser light, and the data of the polygon or fill area is added to the data array for the right laser light; if both iMin1 and iMax1 are greater than the abscissa x2= fValue + iOffset of the right border line, then the polygon or fill area falls within the illumination range of the right laser light, and the data of the polygon or fill area is added to the data array for the right laser light; if the iMin1 is less than the abscissa x1= fValue-iOffset of the left boundary line, while the iMax1 is greater than the abscissa x = fValue + iOffset of the right boundary line, then the polygon area or fill area is partitioned with the median line; if iMin1 is less than x1= fValue-iOffset on the abscissa of the left border line, while iMax1 is less than or equal to x = fValue + iOffset on the abscissa of the right border line, then the polygon or fill area falls within the illumination range of the left laser light, and the data of the polygon or fill area is added to the data array for the left laser light; if both iMin1 and iMax1 are less than the abscissa of the left boundary line x1= fValue-iOffset, then the polygon or fill area falls within the illumination range of the left laser, and the data of the polygon or fill area is added to the data array for the left laser, fValue being the abscissa of the vertical dividing line, the distance of the vertical dividing line from the left boundary line and the distance of the vertical dividing line from the right boundary line being iOffset.
2. The 3D printing control system for dual laser splitting according to claim 1,
characterized in that, the processing module further comprises: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; if the data array for the right laser contains data having a shorter print time than the data array for the left laser, the data for the common area is added to the data array for the right laser.
3. The 3D printing control system for dual laser splitting according to claim 1,
characterized in that, the processing module further comprises: the coordinates of two intersection points of the polygonal area or the filling area and the median line are taken out firstly; the system comprises a polygon area, a filling area, a median line, a data array and a control area, wherein the polygon area is used for filling laser on the left side of the polygon area; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser.
4. The 3D printing control system for dual laser splitting according to claim 1, wherein the upper computer further comprises two threads for respectively taking out data in the data array for the left laser and data in the data array for the right laser for printing, the printing comprising: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser.
5. A segmentation method for a dual-laser segmented 3D printing control system is characterized by comprising the following steps:
step 1: placing the part to be printed on a substrate in a 3D printing cabin, and analyzing a data file corresponding to the current part to be printed by an upper computer;
step 2: then, the upper computer divides the 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 step 3: the upper computer sequentially processes each polygonal area or filling area of the image in the data file and performs segmentation on the polygonal area or the filling area in a double-laser segmentation mode;
the method for performing segmentation on the polygonal area or the filling area by using a dual laser segmentation mode specifically comprises the following steps:
step 3-1: judging the position relationship between the minimum value iMin1 of all vertex abscissas and the maximum value iMax1 of all vertex abscissas in the current polygonal area or filling area and the abscissa x1 of the left boundary line;
step 3-2: if iMin1 is equal to or greater than x1= fValue-iOffset for the left border line, while iMax1 is equal to or less than x2= fValue + iOffset for the right border line, then the polygon area or fill area is a common area; otherwise, the polygon area or the fill area is not a common area;
step 3-3: if the polygonal area or the filling area is a common area, distributing the data of the common area into a preset data array for left laser or a preset data array for right laser;
step 3-4: if the polygonal area or filled area is not public
Co-region, and if iMin1 is greater than or equal to x1= fValue-iOffset of the left boundary line, while iMax1 is greater than x2= fValue + iOffset of the right boundary line, then the polygon or fill region falls within the illumination range of the right laser light, and the data of the polygon or fill region is added to the data array for the right laser light;
step 3-5: if both iMin1 and iMax1 are greater than the abscissa x2= fValue + iOffset of the right border line, then the polygon or fill area falls within the illumination range of the right laser light, and the data of the polygon or fill area is added to the data array for the right laser light;
step 3-6: if the iMin1 is less than the abscissa x1= fValue-iOffset of the left boundary line, while the iMax1 is greater than the abscissa x = fValue + iOffset of the right boundary line, then the polygon area or fill area is partitioned with the median line;
step 3-7: if iMin1 is less than x1= fValue-iOffset on the abscissa of the left border line, while iMax1 is less than or equal to x = fValue + iOffset on the abscissa of the right border line, then the polygon or fill area falls within the illumination range of the left laser light, and the data of the polygon or fill area is added to the data array for the left laser light;
step 3-8: if both iMin1 and iMax1 are less than the abscissa of the left boundary line x1= fValue-iOffset, then the polygon or fill area falls within the illumination range of the left laser, and the data of the polygon or fill area is added to the data array for the left laser, fValue being the abscissa of the vertical dividing line, the distance of the vertical dividing line from the left boundary line and the distance of the vertical dividing line from the right boundary line being iOffset.
6. The splitting method of a 3D printing control system for dual laser splitting according to claim 5, characterized in that the X-axis direction is divided by a median line, a left boundary line and a right boundary line, the median line as the vertical dividing line is the vertical dividing line vertical to the X-axis direction, the vertical dividing line is used for cutting a rectangular frame where the image in the data file is positioned into a left sub rectangular frame and a right sub rectangular frame which are the same, the maximum ordinate, the minimum ordinate, the maximum abscissa and the minimum abscissa of the rectangular frame in which the image in the data file is located are respectively the maximum ordinate, the minimum ordinate, the maximum abscissa and the minimum abscissa of the image, the vertical dividing line is a dividing line which divides the rectangular frame into two halves in the direction perpendicular to the X axis, and the abscissa X = fValue of the vertical dividing line;
two sides of the median line are respectively adjacent to a mutually parallel boundary line perpendicular to the X-axis direction, wherein 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 partition line and the right boundary line, which are all iOffset.
7. The splitting method of the 3D printing control system for the dual laser splitting according to claim 6, wherein the method of allocating the data of the common area to the preset data array for the left laser or the data array for the right laser comprises: adding the data of the common area to the data array for the left laser if the data array for the left laser includes data having a shorter print time than the data array for the right laser; adding the data of the common area to the data array for the right laser if the data array for the right laser includes data having a shorter print time than the data array for the left laser;
the method for dividing by using the median line in the step 3-6 comprises the following steps:
step 3-6-1: firstly, taking out coordinates of two intersection points of the polygonal area or the filling area and the median line;
step 3-6-2: sequentially traversing vertexes in the polygonal area or the filling area, adding vertex coordinates positioned on the left side of the median line into a data array for left laser, and adding vertex coordinates positioned on the right side of the median line into a data array for right laser; the coordinates of the two intersection points are added to the data array for the left laser as well as to the data array for the right laser.
8. The splitting method for a dual laser split 3D printing control system according to claim 5, further comprising, after the step 3:
the host computer starts two threads simultaneously, and these two threads will be used for the data in the data array of left side laser and the data that is used for the data array of right laser to take out and print respectively, should print and include: and starting the data in the data array for the right laser to execute printing by driving the right laser galvanometer to move the right laser which emits the right laser.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111559838.0A CN113942230B (en) | 2021-12-20 | 2021-12-20 | 3D printing control system for double-laser segmentation and segmentation method thereof |
| PCT/CN2022/137384 WO2023116442A1 (en) | 2021-12-20 | 2022-12-08 | 3d printing control system for double-laser segmentation and segmentation method of 3d printing control system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111559838.0A CN113942230B (en) | 2021-12-20 | 2021-12-20 | 3D printing control system for double-laser segmentation and segmentation method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113942230A CN113942230A (en) | 2022-01-18 |
| CN113942230B true CN113942230B (en) | 2022-04-05 |
Family
ID=79339386
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111559838.0A Active CN113942230B (en) | 2021-12-20 | 2021-12-20 | 3D printing control system for double-laser segmentation and segmentation method thereof |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113942230B (en) |
| WO (1) | WO2023116442A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113942230B (en) * | 2021-12-20 | 2022-04-05 | 南京铖联激光科技有限公司 | 3D printing control system for double-laser segmentation and segmentation method thereof |
| CN114536772B (en) * | 2022-04-21 | 2022-07-12 | 南京铖联激光科技有限公司 | Intelligent partition control system in 3D printing system and control method thereof |
| CN117962299B (en) * | 2024-03-15 | 2024-09-13 | 爱司凯科技股份有限公司 | Unidirectional blowing multi-laser head data segmentation printing method |
| CN118024563B (en) * | 2024-03-15 | 2024-07-19 | 爱司凯科技股份有限公司 | 8 Laser head printing data segmentation method |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3700470B2 (en) * | 1999-05-26 | 2005-09-28 | セイコーエプソン株式会社 | Image printing method and apparatus for tape printer |
| CN107498052B (en) * | 2017-09-22 | 2019-03-05 | 华中科技大学 | A kind of load balancing scanning manufacturing process for more laser SLM forming devices |
| CN111070685A (en) * | 2019-12-24 | 2020-04-28 | 广州晋原铭科技有限公司 | 3D printing method based on multi-galvanometer |
| CN113487101A (en) * | 2021-07-23 | 2021-10-08 | 大连理工大学 | Additive manufacturing path planning algorithm based on double laser heads |
| CN113942230B (en) * | 2021-12-20 | 2022-04-05 | 南京铖联激光科技有限公司 | 3D printing control system for double-laser segmentation and segmentation method thereof |
-
2021
- 2021-12-20 CN CN202111559838.0A patent/CN113942230B/en active Active
-
2022
- 2022-12-08 WO PCT/CN2022/137384 patent/WO2023116442A1/en unknown
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023116442A1 (en) | 2023-06-29 |
| CN113942230A (en) | 2022-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113942230B (en) | 3D printing control system for double-laser segmentation and segmentation method thereof | |
| EP4331813A1 (en) | Slicing method, printing method, and device and apparatus for mapping three-dimensional model | |
| CN100550059C (en) | A kind of vector graph acceleration method and multimedia player | |
| US20060197999A1 (en) | Image processing apparatus, image processing method, and image processing program | |
| EP2002352B1 (en) | Applying effects to a merged text path | |
| CN110968039B (en) | Graph cutting and sorting processing method applied to laser cutting numerical control machining | |
| US11219928B2 (en) | Shape packing technique | |
| US9607417B2 (en) | Parallel rendering of region-based graphics representations | |
| CN101882327B (en) | Information processing apparatus and information processing method | |
| US8723884B2 (en) | Scan converting a set of vector edges to a set of pixel aligned edges | |
| JP2009134620A (en) | Drawing device, drawing program and drawing method | |
| CN104572610B (en) | A kind of automatic keyline layout method and device | |
| CN111143502A (en) | Map tile efficient generation method and device | |
| CN110001066B (en) | Method for determining filling direction of minimum partition in three-dimensional printing | |
| US9710943B2 (en) | 2D region rendering | |
| CN113052928B (en) | Image processing method and image processing system | |
| CN101686309B (en) | Method and device of generating trapping by image path | |
| CN109359381B (en) | Laser path planning method based on voxels | |
| CN107457981A (en) | 3D printing method and system | |
| KR930011770B1 (en) | High quality pattern generating apparatus and method | |
| CN114536772B (en) | Intelligent partition control system in 3D printing system and control method thereof | |
| CN116089557A (en) | Data processing method, device and storage medium | |
| JP5782401B2 (en) | Image forming apparatus | |
| CN102456000B (en) | Method and device for eliminating crack in page | |
| CN114834043A (en) | Laser three-dimensional processing model slice data processing 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 |