CN113591300A

CN113591300A - 3D printing file generation method and device, computer equipment and storage medium

Info

Publication number: CN113591300A
Application number: CN202110861667.0A
Authority: CN
Inventors: 敖丹军; 黄显彬; 王文彬
Original assignee: Shenzhen Chuangxiang 3D Technology Co Ltd
Current assignee: Shenzhen Chuangxiang 3D Technology Co Ltd
Priority date: 2021-07-29
Filing date: 2021-07-29
Publication date: 2021-11-02
Anticipated expiration: 2041-07-29
Also published as: WO2023005852A1; CN113591300B

Abstract

The application relates to a method and a device for generating a 3D printing file, computer equipment and a storage medium, wherein the method comprises the following steps: carrying out layered slicing on the model to be printed to obtain each layer of slice data; confirming each graph in the first-layer outline according to the first-layer slice data; selecting a target point from points on each graph; the target point represents the position where the edge warping is easy to occur during printing; confirming the radiation range of the radiation point of the corresponding skirt edge according to each target point; radiating according to the radiation range and the preset height corresponding to the radiation point to obtain skirt data; and obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a print file according to the combined slice data of each layer. The skirt is only generated around the target point during printing, so that the target point can be well stuck to the hot bed, the size of the skirt is reduced, the model forming speed can be improved, the waste of printing consumables is reduced, the contact between other parts and the skirt is reduced, and the flatness of the surface of the model can be improved.

Description

3D printing file generation method and device, computer equipment and storage medium

Technical Field

The present application relates to the field of 3D printing technologies, and in particular, to a method and an apparatus for generating a 3D print file, a computer device, and a storage medium.

Background

The application field of three-dimensional (3D) printing technology is becoming wider and wider under the promotion of the intellectualization of computer digital technology, and 3D printing is to slice a model first and then print a layer of bonding material to manufacture a three-dimensional object according to a slice file generated by slicing. However, in the printing process, the edge warping may occur, which may affect the quality of the printed object, and in order to prevent the edge warping from occurring in the printing process, the current main practice is to generate a skirt around the outer contour of the first slice before generating the slice file, or generate a base larger than the outer contour of the first slice below the first slice, but the generated skirt or base is large, which reduces the molding speed of the model and wastes printing consumables.

Disclosure of Invention

In view of the above, it is necessary to provide a method and an apparatus for generating a 3D print file, a computer device, and a storage medium.

The embodiment of the application provides a method for generating a 3D printing file, which comprises the following steps: carrying out layered slicing on the model to be printed to obtain each layer of slice data; confirming each graph in the first-layer outline according to the first-layer slice data; selecting a target point from points on each graph in the first-layer contour; the target point represents a position where the edge warping is easy to occur during printing; confirming the radiation points of the skirt edges corresponding to the target points according to the target points, and confirming the radiation range corresponding to the radiation points in the direction parallel to the first layer of slices; traversing each radiation point, and radiating according to the radiation range and height corresponding to the currently traversed radiation point to obtain skirt data; and obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file.

The embodiment of the present application further provides a device for generating a 3D print file, including: the slicing module is used for carrying out layered slicing on the model to be printed to obtain each layer of slicing data; the first confirming module is used for confirming each graph in the first-layer outline according to the first-layer slice data; a selecting module for selecting a target point from points on each graph in the first layer contour; the target point represents a position where the edge warping is easy to occur during printing; the second confirming module is used for confirming the radiating points of the skirt edges corresponding to the target points according to the target points and confirming the radiating ranges corresponding to the radiating points in the direction parallel to the first layer of slices; the skirt data generation module is used for traversing each radiation point, and performing radiation according to the radiation range and the radiation height corresponding to the currently traversed radiation point to obtain skirt data; and the printing file generation module is used for obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file.

The embodiment of the application also provides computer equipment, which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the generation method of the 3D printing file when executing the computer program.

An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the method for generating a 3D print file described above.

In addition, the determining the radiation points of the skirt corresponding to the target points according to the target points includes: confirming the printing sequence of each target point according to the first layer slicing data, and connecting the target points in sequence according to the printing sequence; selecting first-class target points, the distances between which and two adjacent target points are larger than a preset distance, from the target points, and respectively taking each target point in the first-class target points as a radiating point of a skirt corresponding to each target point in the first-class target points; taking the target points of all the target points except the first type target point as second type target points, dividing the second type target points into a plurality of groups, and taking the middle point of the connecting line of the two second type target points with the farthest distance in each group as the radiation point of the skirt edge corresponding to each target point in one group; wherein the second type target points in each group are connected in sequence. By the method, when the second type target points exist in the target points, skirt edge data can be obtained quickly without generating a skirt edge at each second type target point.

In addition, the determining a radiation range corresponding to each radiation point in a direction parallel to the first slice includes: if the radiation point is the target point in the first-class target point, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle with the radiation point as the center of the circle and the preset distance as the diameter; if the radiation points are the middle points of the connecting lines of the two second-class target points which are farthest away from each group, confirming that the radiation range corresponding to the radiation points in the direction parallel to the first-layer slice is a circle which takes the m radiation points as the circle center and the sum of the preset distance and the connecting lines as the diameter; wherein m is a positive integer. The radiation range obtained by the method can cover all target points, so that the confirmed radiation range is more reasonable, and when the radiation range is round, the generated skirt edge is not easy to warp, and the influence on the model to be printed is reduced.

In addition, the determining a radiation range corresponding to each radiation point in a direction parallel to the first slice includes: if the radiation point is a target point in the first class of target points, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first layer of slice is a regular polygon with the radiation point as the center and the preset distance as the diameter of a circumscribed circle; if the radiation point is the midpoint of a connecting line of two second-class target points which are farthest from each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a regular polygon which takes the radiation point as the center and the sum of the n preset distances and the connecting line as the diameter of a circumscribed circle; wherein n is a positive integer. The irradiation range obtained by the method can cover all target points, so that the confirmed irradiation range is more reasonable.

In addition, the radiation is performed according to the preset radiation range and the preset radiation height corresponding to the currently traversed radiation point to obtain skirt data, and the method includes: calculating the coordinates of three vertexes of each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point and the corresponding radiation range, and respectively calculating the coordinates of the three vertexes of each triangular patch positioned on the top surface, the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the top surface and the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point, the corresponding radiation range and the preset height; wherein the side surface is located between the top surface and the bottom surface; and combining the coordinates of the three vertexes of the triangular patches positioned on the bottom surface, the coordinates of the three vertexes of the triangular patches positioned on the top surface, the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the top surface and the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the bottom surface to obtain skirt data. Because the skirt edge is simply constructed by the triangular surface patch, the related data of the triangular surface patch is directly generated when the skirt edge data is acquired, so that the subsequent acquired combined model to be printed is quicker, and the printed file is obtained more quickly.

If the coordinates of the currently traversed radiation point are (x, y, 0), the coordinates of three vertexes of the ith triangular patch positioned on the bottom surface are (x, y, 0), (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r sin (i × a), 0), respectively; the coordinates of three vertexes of the ith triangular patch positioned on the top surface are (x, y, h), (x + r) cos ((i-1) a), y + r sin (i a), h), (x + r cos (i a), y + r sin (i a), h) respectively; the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the top surface are (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), h), (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r sin (i × a), h); the coordinates of three vertices of the triangular patch located on the side surface and connected to the ith triangular patch located on the bottom surface are (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r × sin (i × a), and h), where r is the radius of the corresponding radiation range, h is the preset height, a is a preset radian, and i is an integer not less than 1 and not more than (2 pi/a).

In addition, the determining each graph in the first-layer contour according to the first-layer slice data includes: confirming the first-layer contour according to the first-layer slice data; and if the first-layer contour comprises a curve graph, performing linear fitting on the curve graph in the first-layer contour to obtain a fitted graph, and taking the fitted graph and the linear graph in the first-layer contour as each graph in the first-layer contour. When the first layer of outline comprises the curve graph, the number of points on the curve graph is large, the calculated amount of the target points selected from the points of the first layer of outline is large, the curve graph is firstly fitted into a linear fit, and therefore all the graphs in the first layer of outline are linear graphs, the number of the points on the linear graphs is reduced compared with the number of the points on the curve graph, the target points can be selected out quickly, and printed files can be obtained quickly.

In addition, the selecting a target point from points on each graph in the first layer contour includes: and selecting vertexes corresponding to included angles with preset degrees from the vertexes of the graphs in the first-layer outline as target points according to the included angles at the vertexes of the graphs in the first-layer outline. The included angle at each vertex is simple to calculate, so that the process of determining whether the included angle is the position where the edge is easy to warp during printing is simple through the included angle of the preset degree, the target point can be selected out quickly, and the printed file can be obtained quickly.

In addition, the preset degree is not more than 90 degrees. Because the vertex that the contained angle that is not more than 90 degrees corresponds is more sharp position, and more sharp position takes place to stick up the limit more easily, so will predetermine the number of degrees and set up to be not more than 90 degrees, the target point of choosing is more reasonable, has further reduced the possibility that takes place to stick up the limit when printing.

In addition, the obtaining of the combined slice data of each layer according to the skirt data and the slice data of each layer includes: generating a skirt edge according to the skirt edge data, and slicing the skirt edge in layers to obtain slice data of each layer of skirt edge; and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer to obtain the merged slice data of each layer. By the method, each layer of skirt slice data can be obtained only by slicing the local skirt, the slicing speed is high, and subsequent operation can be performed quickly, so that the combined each layer of slice data is obtained quickly.

In addition, the merging operation is performed on the skirt edge slice data and the slice data of the corresponding layer respectively to obtain merged slice data of each layer, and the merging operation includes: and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer through a Boolean algorithm to obtain the merged slice data of each layer. Because the union operation of the Boolean algorithm is simple, the union operation is carried out on the skirt data and the slice data of the corresponding layer through the Boolean algorithm, the merged slice data of each layer can be obtained quickly, and therefore the print file can be generated quickly.

In addition, the height is calculated by the following formula: h ═ H × d; and H is the height, H is the height of the model to be printed, and d is a preset ratio. The height obtained through calculation is more reasonable, the obtained skirt data can be more reasonable, and the possibility of printing the raised edge is further reduced.

In addition, the distance between the point on the outline of the radiation range, which is farthest from the corresponding radiation point, and the corresponding radiation point is calculated by the following formula: d ═ h × m; and D is the distance between the farthest point and the corresponding radiation point, h is the height of the model to be printed, and m is a preset ratio. The height obtained through calculation is more reasonable, the obtained skirt data can be more reasonable, and the possibility of printing the raised edge is further reduced.

In addition, the height becomes gradually smaller along a direction in which the radiation point points to the profile of the radiation range. By the method, the volume of the skirt can be further reduced on the premise of reducing the possibility of printing raised edges.

According to the method, the device, the computer equipment and the storage medium, the model to be printed is sliced in a layered mode to obtain slice data of each layer; confirming each graph in the first-layer outline according to the first-layer slice data; selecting radiation points from points on each graph in the first-layer outline; the target point represents a position where the edge warping is easy to occur during printing; confirming the radiation points of the skirt edges corresponding to the target points according to the target points, and confirming the radiation range corresponding to the radiation points in the direction parallel to the first layer of slices; traversing each radiation point, taking the currently traversed radiation point as a radiation point, and radiating the radiation point to the outside of the outline according to the corresponding radiation range and the preset height to obtain skirt data; and obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file. . When the printing is carried out, only the positions where the edges are easy to warp during printing, namely the peripheries of the radiation points, respectively generate the skirts, the target points can be well stuck on the hot bed, and compared with the generation of the skirts at the peripheries of the outer contour of the first layer of slices, the volume of the skirts is reduced, so that the forming speed of the model can be improved, the waste of printing consumables is reduced, only the skirts are respectively generated at the peripheries of the target points, the contact areas of other parts and the skirts are reduced, the stripping is reduced, and the flatness of the surface of the model can be improved.

Drawings

Fig. 1 is a flowchart of a 3D print file generation method according to a first embodiment of the present application;

FIG. 2 is a front view of the skirt at one point of radiation in the first embodiment of the present application;

FIG. 3 is a flowchart of a specific implementation manner of step 105 in the first embodiment of the present application;

FIG. 4 is a schematic view of the skirt at a radiation point according to the first embodiment of the present application;

FIG. 5 is a flowchart of a specific implementation manner of step 106 in the first embodiment of the present application;

FIG. 6 is a top view of a mold to be printed including a skirt in a first embodiment of the present application;

fig. 7 is a flowchart of a 3D print file generation method according to a second embodiment of the present application;

fig. 8 is a schematic structural diagram of a 3D print file generation apparatus according to a third embodiment of the present application;

fig. 9 is a schematic structural diagram of a computer device according to a fourth embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

The first embodiment of the present application relates to a method for generating a 3D print file, which is applied to a computer device, for example: computers, cell phones, etc. A flowchart of a method for generating a 3D print file according to this embodiment is shown in fig. 1, and includes:

and 101, performing layered slicing on the model to be printed to obtain slice data of each layer.

Specifically, after receiving an imported model to be printed, slicing software in the computer device performs horizontal layered slicing on the model to be printed, wherein the included angle between the direction of the horizontal layered slicing and the horizontal plane is zero; and slicing the model to be printed in a layered manner to obtain slice data of each layer.

And 102, confirming each graph of the first-layer outline according to the first-layer slice data.

103, selecting a target point from points on each graph in the first-layer contour; wherein the target point represents a position at which warping is likely to occur during printing.

In particular, the first layer refers to the layer closest to the bottom of the workspace, i.e. the layer closest to the hot bed when printing; the working space is a space formed by a printing platform of a printer for printing a model to be printed in slicing software and comprises an X axis, a Y axis and a Z axis, and the bottom of the working space is a plane formed by the X axis and the Y axis. After the slice data of each layer is obtained, the first layer profile can be confirmed according to the first layer slice data, and due to the diversity of the model to be printed, the first layer profile also has diversity and may include a linear graph and/or a curved graph, in this embodiment, after the first layer profile is obtained, if the first layer profile includes the curved graph and the linear graph, the curved graph and the linear graph are taken as the graphs of the first layer profile, if the first layer profile includes the linear graph, the linear graph is taken as the graphs of the first layer profile, if the first layer profile includes the curved graph, the curved graph is taken as the graphs of the first layer profile, and then a target point is selected from points on the graphs of the first layer profile, and since the concave and convex points are not smooth enough and edge warping is easy to occur, concave and convex points are selected from points on the graphs of the first layer profile as the target point, it can be known that, for the linear graph, the concave-convex points are the vertexes.

And 104, confirming the radiating points of the skirt edges corresponding to the target points according to the target points, and confirming the radiating ranges corresponding to the radiating points in the direction parallel to the first layer of slices.

In one example, identifying the radiation points of the skirt corresponding to the target points according to the target points comprises: confirming the printing sequence of each target point according to the first layer of slice data, and connecting the target points in sequence according to the printing sequence; selecting first-class target points with the distance between each target point and two adjacent target points larger than a preset distance from each target point, and respectively taking each target point in the first-class target points as a radiating point of a skirt edge corresponding to each target point in the first-class target points; taking target points except the first type target points in all the target points as second type target points, dividing the second type target points into a plurality of groups, and taking the middle point of a connecting line of the two second type target points with the farthest distance in each group as a radiating point of a skirt edge corresponding to each target point in one group; wherein the second type target points in each group are connected in sequence.

Specifically, the preset distance may be set according to actual needs, and this embodiment is not specifically limited, and is described as an example below, it is determined from the first slice data that the printing order of the target points is P1, P2, P3, P4, P5, P6, and P7, and P1, P2, P3 are sequentially connected, where if the distance between P3 and P3 is greater than the preset distance, that is, the distance between P3 and two adjacent target points is greater than the preset distance, P3 and P3 are the first class, the skirt of P3 is taken as the radiation point corresponding to P3, and the radiation point corresponding to P3; p1, P2, P4, P5, P6 are second-class target points, since P1, P2 are sequentially connected, P1, P2 are one group, i.e., group a, and P4, P5, P6 are sequentially connected, P4, P5, P6 are one group, i.e., group B, for group a, the two points farthest away are P1, P2, for group a, the midpoint P8 of the connecting line P1P2 of P1, P2 is taken as the radiation point of the skirt to which group a corresponds, and for group B, if the two points farthest away are P4, P6, P9 of the connecting line P4P6 of P4, P6 is taken as the radiation point of group a corresponding to group a. After obtaining each radiation point, the radiation range corresponding to each radiation point in the direction parallel to the first slice may be set according to actual needs as long as the radiation range can cover the target point, and it is worth noting that for a group including a plurality of target points, the radiation range needs to cover the plurality of target points in the group, where the radiation range may be a circle, a hexagon, a pentagon, an irregular figure, or the like. By the method, when the second type target points exist in the target points, skirt edge data can be obtained quickly without generating a skirt edge at each second type target point.

In one example, identifying the radiation range corresponding to each radiation point in a direction parallel to the slice of the first slice includes: if the radiation point is a target point in the first-class target point, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle with the radiation point as the center of the circle and a preset distance as the diameter; if the radiation point is the middle point of the connecting line of the two second-class target points with the farthest distance in each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle with the radiation point as the center of the circle and the sum of m preset distances and the connecting line as the diameter; wherein m is a positive integer.

Specifically, in the above example, if the radiation points P3 and P7 are the target points of the first class of target points, it is determined that the radiation range in the direction parallel to the first slice corresponding to P3 is a circle having the center at P3 and a diameter at a predetermined distance, the radiation range in the direction parallel to the first slice corresponding to P7 is a circle having the center at P7 and a diameter at a predetermined distance, the radiation points P8 and P9 are midpoints between lines connecting two second class target points in each group which are farthest from each other, it is determined that the radiation range in the direction parallel to the first slice corresponding to P8 is the center at P8 and a circle having the sum of m predetermined distances and the lengths of P1P2 is the diameter, it is determined that the radiation range in the direction parallel to the first slice corresponding to P9 is the circle having the center at P9 and the sum of m predetermined distances and the lengths of P4P6 is the diameter, and m is a positive integer, for example: m may be 2. The radiation range obtained by the method can cover all target points, so that the confirmed radiation range is more reasonable, and when the radiation range is round, the generated skirt edge is not easy to warp, and the influence on the model to be printed is reduced.

In one example, identifying the radiation range corresponding to each radiation point in a direction parallel to the slice of the first slice includes: if the radiation point is a target point in the first class of target points, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first layer of slice is a regular polygon with the radiation point as the center and a preset distance as the diameter of a circumscribed circle; if the radiation point is the middle point of the connecting line of the two second-class target points with the farthest distance in each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a regular polygon which takes the radiation point as the center and takes the sum of n preset distances and the connecting line as the diameter of the circumscribed circle; wherein n is a positive integer.

Specifically, as explained in the above example, if the radiation points P3, P7 are the target points of the first class of target points, it is confirmed that the radiation range in the direction parallel to the first slice corresponding to P3 is a circle centered on P3 and having a predetermined distance as the diameter of the circumscribed circle, the radiation range in the direction parallel to the first slice corresponding to P7 is a regular polygon centered on P7 and having a predetermined distance as the diameter of the circumscribed circle, the radiation points P8, P9 are midpoints between lines connecting the two second class target points in each group that are farthest from each other, it is confirmed that the radiation range in the direction parallel to the first slice corresponding to P8 is a regular polygon centered on P8 and having the sum of m predetermined distances and the length of P1P2 as the diameter of the circumscribed circle, it is confirmed that the radiation range in the direction parallel to the first slice corresponding to P9 is a regular polygon centered on P9 and having the sum of m predetermined distances and the length of P4P6 as the diameter of the circumscribed circle, m is a positive integer, for example: m can be 2, and the regular polygon can be a regular triangle, a regular quadrangle, a regular pentagon, and the like. The irradiation range obtained by the method can cover all target points, so that the confirmed irradiation range is more reasonable.

In one example, confirming the radiation points of the skirt corresponding to the target points according to the target points, and confirming the radiation range corresponding to the radiation points in the direction parallel to the first slice comprises the following steps: and taking the target points as the radiation points of the skirt edges corresponding to the target points respectively. Specifically, each target point is directly set as a radiation point of the skirt corresponding to each target point regardless of the distance between the target points. After the radiation points are obtained, the radiation range corresponding to each radiation point in the direction parallel to the first layer of slices can be set according to actual needs as long as the radiation range can cover the target point, wherein the radiation range can be a circle, a hexagon, a pentagon, an irregular figure and the like.

In one example, the distance between the point on the contour of the radiation range farthest from the corresponding radiation point and the corresponding radiation point is calculated by the following formula: d ═ h × m; wherein D is the distance between the farthest point and the corresponding radiation point, h is the height of the model to be printed, and m is a preset ratio. The height obtained through calculation is more reasonable, the obtained skirt data can be more reasonable, and the possibility of printing the raised edge is further reduced. In one example, the predetermined ratio m is 1/20-1/50. When the preset ratio is set by such a method, the volume of the skirt can be reduced while making the calculated height more reasonable.

And 105, traversing each radiation point, and radiating according to the radiation range and height corresponding to the currently traversed radiation point to obtain skirt data.

Specifically, each radiation point corresponds to skirt data, so that a skirt is generated at each radiation point during printing, the currently traversed radiation point is taken as the radiation point on the bottom surface, and the skirt data can be obtained according to the radiation range and the height of the currently traversed radiation point in the direction parallel to the first layer slice; the height refers to the height of the skirt, and the heights in the vertical direction of the points in the radiation range can be the same or different.

In one example, the height is calculated by the following formula: h ═ H × d; wherein H is the height, H is the height of the model to be printed, and d is a preset ratio.

Specifically, in the present embodiment, the heights in the vertical direction of the radiation points are the same, and the height of the model to be printed is the distance between the highest layer slice and the lowest layer slice, for example: if the height of the model to be printed is 10cm and the preset ratio is 1/50, the calculated height is 0.2 cm. The height obtained through calculation is more reasonable, the obtained skirt data can be more reasonable, and the possibility of printing the raised edge is further reduced.

In one example, the predetermined ratio is 1/50-1/100. When the preset ratio is set by such a method, the volume of the skirt can be reduced while making the calculated height more reasonable.

In one example, the height may be preset according to the actual needs of the user.

In one example, the height is gradually reduced along the direction in which the radiation spot points to the contour of the radiation range. By the method, the volume of the skirt can be further reduced on the premise of reducing the possibility of printing raised edges.

Specifically, when the height is gradually decreased along the direction in which the radiation point points to the contour of the radiation range, the height of the skirt generated is not equal, but gradually decreased from the vertical direction in which the radiation point is located, and when the radiation range is a circle, if the height is gradually decreased by the same amount, the skirt generated is a cone, as shown in fig. 2, fig. 2 is a front view of the skirt at the radiation point; wherein H is the height of the radiation point in the vertical direction. In one example, the height of the radiation spot in the vertical direction is calculated by the following formula: h ═ H × d; wherein H is the height, H is the height of the model to be printed, and d is a preset ratio. In one example, the predetermined ratio d is 1/50-1/100.

In one example, a specific process of obtaining skirt data by performing radiation according to the radiation range and height corresponding to the currently traversed radiation point is shown in fig. 3, and includes:

step 1051, calculating coordinates of three vertexes of each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point and the corresponding preset radiating range, and respectively calculating the coordinates of the three vertexes of each triangular patch positioned on the top surface, the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the top surface, and the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point, the corresponding preset radiating range and the height; wherein the side surface is located between the top surface and the bottom surface.

Step 1052, combining the coordinates of the three vertexes of the triangular patches positioned on the top surface, the coordinates of the three vertexes of the triangular patches positioned on the bottom surface, the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the top surface, and the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the bottom surface to obtain the skirt data.

Specifically, the graph can be composed of triangular patches, and since the bottom surface is also the layer closest to the hot bed during printing, it can be known that the contours of the bottom surface and the first layer are flush, the coordinates of three vertexes of each triangular patch located on the bottom surface can be calculated only according to the coordinates of the currently traversed radiation point and the preset radiation range; if a certain height exists between the top surface and the bottom surface, the coordinates of three vertexes of each triangular patch positioned on the top surface are calculated according to the coordinates of the currently traversed radiation point, the preset radiation range and the height; since the side surfaces are located between the top surface and the bottom surface, that is, the side surfaces need to be connected with both the top surface and the bottom surface, the triangular patch of the side surface includes each triangular patch connected with each triangular patch located on the top surface and each triangular patch connected with each triangular patch located on the bottom surface, and since the side surfaces also have heights, the coordinates of three vertexes of each triangular patch located on the side surface and connected with each triangular patch located on the top surface and the coordinates of three vertexes of each triangular patch located on the side surface and connected with each triangular patch located on the bottom surface need to be calculated respectively according to the coordinates of the currently traversed radiation point, the corresponding radiation range and the height; the connection between the triangular patches means that two triangular patches share one edge. And combining the coordinates of the three vertexes of the triangular patches positioned on the bottom surface, the coordinates of the three vertexes of the triangular patches positioned on the top surface, the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the top surface and the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the bottom surface to obtain the skirt data. Because the skirt edge is simply constructed by the triangular surface patch, the related data of the triangular surface patch is directly generated when the skirt edge data is acquired, so that the subsequent acquired combined model to be printed is quicker, and the printed file is obtained more quickly.

In one example, if the coordinates of the currently traversed radiation point are (x, y, 0), the coordinates of the three vertices of the ith triangle patch on the top surface are (x, y, h), (x + r × cos (i × a), y + r × sin (i × a), h), (x + r × cos ((i +1) × a), y + r sin ((i +1) × a), h), respectively; the coordinates of three vertexes of the ith triangular patch positioned on the bottom surface are (x, y, 0), (x + r) cos (i a), y + r sin (i a), 0), (x + r cos ((i +1) a), y + r sin ((i +1) a), 0); the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the top surface are (x + r × cos (i × a), y + r × sin (i × a), h), (x + r × cos ((i +1) × a), y + r × sin ((i +1) × a), h), (x + r × cos (i a), y + r × sin (i a), 0); the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the bottom surface are (x + r × cos (i × a), y + r × sin (i × a), 0), (x + r × cos ((i +1) × a), y + r × sin ((i +1) × a), 0), (x + r × cos ((i +1) × a), and y + r × sin ((i +1) × a, h), wherein r is the radius of the corresponding radiation range, h is a preset height, a is a preset radian, and i is an integer not less than 1 and not more than (2 pi/a).

Specifically, as an example, if the radius r of the radiation range corresponding to the currently traversed radiation point is 2, the preset height h is 2, and the preset radian a is pi/45, the value of i is an integer not greater than 1 and not greater than 90, that is, 90 triangular patches are located on the bottom surface, and 180 triangular patches are located on the side surface, where 90 triangular patches are located on the side surface and connected to the triangular patch located on the top surface, and 90 triangular patches are located on the side surface and connected to the triangular patch located on the bottom surface. The coordinates of three vertexes of the 1 st triangular patch positioned on the bottom surface are respectively (x, y, 0), (x +2 × cos (pi/45), y +2 × sin (pi/45), 0), the coordinates of three vertexes of the 2 nd triangular patch positioned on the bottom surface are respectively (x, y, 0), (x +2 × cos (pi/45), y +2 × sin (pi/45), 0), (x +2 × cos (2 pi/45), y +2 × sin (2 pi/45), 0), and the coordinates of three vertexes of the 90 th triangular patch positioned on the bottom surface are respectively (x, y, 0), (x +2 × cos (89 pi/45), y +2 × sin (89 pi/45), 0), (x +2, y, 0); coordinates of three vertexes of the 1 st triangular patch positioned on the top surface are (x, y, 2), (x +2 × cos (pi/45), y +2 × sin (pi/45), 2), coordinates of three vertexes of the 2 nd triangular patch positioned on the top surface are (x, y, h), (x +2 × cos (pi/45), y +2 × sin (pi/45), 2), (x +2 × cos (2 pi/45), y +2 × sin (2 pi/45), 2), and. The coordinates of the three vertices of the triangular patch located on the side and connected to the 1 st triangular patch located on the bottom surface are (x +2, y, 2), (x +2, y, 0), (x +2 x cos (pi/45), y +2 x sin (pi/45), 2), the coordinates of the three vertices of the triangular patch located on the side and connected to the 2 nd triangular patch located on the bottom surface are (x +2 x cos (pi/45), y +2 x sin (pi/45), 0), (x +2 x cos (2 pi/45), y +2 x sin (2 pi/45), 2.,. the coordinates of the three vertices of the triangular patch located on the side and connected to the 90 th triangular patch located on the bottom surface are (x +2 x cos (pi/45), respectively, y +2 sin (89 pi/45), 2), (x +2cos (89 pi/45), y +2 sin (89 pi/45), 0), (x +2, y, 2); coordinates of three vertexes of the triangular patch located on the side surface and connected with the 1 st triangular patch located on the top surface are respectively (x +2cos (89 pi/45), y +2 sin (89 pi/45), 0), (x +2, y, 0) and (x +2, y, 2), after the coordinates of each triangular patch are obtained, the coordinates are combined to obtain skirt edge data, and a skirt edge is generated according to the skirt edge data, as shown in fig. 4, the skirt edge structure diagram at a radiation point is shown, and the coordinates of the three vertexes of the triangular patch in the diagram are obtained through calculation by the method. By this method, the coordinates of the three vertices of each triangular patch can be calculated relatively easily.

In one example, the coordinates of the four vertices of each of the four corner patches on the bottom surface may be calculated according to the coordinates of the currently traversed radiation point and the corresponding radiation range, and the coordinates of the four vertices of each of the four corner patches on the top surface, the coordinates of the four vertices of each of the four corner patches on the side surface and connected to each of the four corner patches on the top surface, and the coordinates of the four vertices of each of the four corner patches on the side surface and connected to each of the four corner patches on the bottom surface may be calculated according to the coordinates of the currently traversed radiation point, the corresponding radiation range, and the height; wherein the side surface is located between the top surface and the bottom surface; and combining the coordinates of the four vertexes of the four corner patches positioned on the bottom surface, the coordinates of the four vertexes of the four corner patches positioned on the top surface, the coordinates of the four vertexes of the four corner patches positioned on the side surface and connected with the three corner patches positioned on the top surface, and the coordinates of the four vertexes of the four corner patches positioned on the side surface and connected with the four corner patches positioned on the bottom surface to obtain the skirt data.

And step 106, obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file.

In one example, a specific flowchart for obtaining the merged slice data of each layer according to the skirt data and the slice data of each layer is shown in fig. 5, and includes:

and step 1061, generating the skirt according to the skirt data, and slicing the skirt in a layered manner to obtain slice data of each layer of skirt.

And 1062, performing union operation on the skirt edge slice data and the slice data of the corresponding layer respectively to obtain the merged slice data of each layer.

Specifically, a skirt is generated according to skirt data, each layer of skirt slice data can be obtained by horizontally slicing the skirt, because intersection exists between each layer of skirt slice data and each layer of slice data, if union operation is not performed, repeated data exists between each layer of skirt slice data and each layer of slice data, union operation needs to be performed on each layer of skirt slice data and each layer of slice data, one repeated data between each layer of skirt slice data and each layer of slice data is removed, merged each layer of slice data is obtained, a print file is obtained according to the merged each layer of slice data, the print file is sent to a 3D printer, the 3D printer can print a model to be printed including the skirt according to the print file, as shown in fig. 5, fig. 5 is a schematic diagram of projection of the model to be printed including the skirt, wherein the shaded area is a skirt. By the method, each layer of skirt slice data can be obtained only by slicing the local skirt, the slicing speed is high, and subsequent operation can be performed quickly, so that the combined each layer of slice data is obtained quickly.

In one example, the merging operation is performed on the skirt slice data and the slice data of the corresponding layer respectively to obtain merged slice data of each layer, including: and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer through a Boolean algorithm to obtain the merged slice data of each layer. Because the union operation of the Boolean algorithm is simple, the union operation is carried out on the skirt data and the slice data of the corresponding layer through the Boolean algorithm, the merged slice data of each layer can be obtained quickly, and therefore the print file can be generated quickly.

In one example, the combined slice data of each layer is obtained according to the skirt data and the slice data of each layer, and comprises: and performing union operation on the skirt data and each layer of slice data to obtain a combined model to be printed, and performing layered slicing on the combined model to be printed to obtain a printed file.

Specifically, intersection exists between the skirt data and each layer of slice data, if union operation is not performed, repeated data exists between the skirt data and each layer of slice data, the skirt data and each layer of slice data are directly merged, the skirt and the model to be printed cannot be combined into a model to be printed, and therefore layering slicing cannot be performed, therefore union operation needs to be performed on the skirt data and each layer of slice data, one repeated data between the skirt data and each layer of slice data is removed, the skirt and the model to be printed can be combined into a model to be printed, and the merged model to be printed is obtained; after the merged model to be printed is obtained, the merged model to be printed is sliced layer by layer to obtain merged slice data of each layer, a print file is obtained according to the merged slice data of each layer, the print file is sent to a 3D printer, the 3D printer can print out a model to be printed including a skirt edge according to the print file, as shown in fig. 6, fig. 6 is a top view of the model to be printed including the skirt edge. In one example, performing union operation on the skirt data and the slice data of each layer to obtain a merged model to be printed includes: and performing union operation on the skirt data and each layer of slice data through a Boolean algorithm to obtain a merged model to be printed. The union operation of the Boolean algorithm is simple, so that the union operation is performed on the skirt data and each layer of slice data through the Boolean algorithm, the merged model to be printed can be obtained quickly, and the printing file can be generated quickly.

In the embodiment, the model to be printed is sliced in layers to obtain slice data of each layer; confirming each graph in the first-layer outline according to the first-layer slice data; selecting a target point from points on each graph in the first-layer contour; the target point represents a position where the edge warping is easy to occur during printing; confirming the radiation points of the skirt edges corresponding to the target points according to the target points, and confirming the radiation range corresponding to the radiation points in the direction parallel to the first layer of slices; traversing each radiation point, and radiating according to the radiation range and height corresponding to the currently traversed radiation point to obtain skirt data; and obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file. When printing, only the position where the edge is easily warped when printing, namely the skirt borders are respectively generated around the target point, the target point can be well stuck on the hot bed, and compared with the skirt borders generated around the outer contour of the first layer slice, the volume of the skirt borders is reduced, so that the forming speed of the model can be improved, the waste of printing consumables is reduced, only the skirt borders are respectively generated around the target point, the contact areas of other parts and the skirt borders are reduced, stripping is reduced, and the flatness of the surface of the model can be improved.

The second embodiment of the present application relates to a method for generating a 3D print file, which is applied to a computer device, for example: the second embodiment is substantially the same as the first embodiment except that: in the second embodiment, it is determined whether the first-layer contour includes a curve image, and if the first-layer contour includes a curve pattern, the curve pattern in the first-layer contour is fitted in a straight line manner to obtain a fitted pattern, and the fitted pattern and the straight line pattern in the first-layer contour are used as each pattern of the first-layer contour. Fig. 7 shows a flowchart of a method for generating a 3D print file according to this embodiment, which includes:

step 201, slicing the model to be printed in layers to obtain slice data of each layer.

Step 201 is similar to step 101 in the first embodiment, and is not described herein again.

Step 202, determining the first-layer contour according to the first-layer slice data, and judging whether the first-layer contour comprises a curve graph. If so, go to step 203 and then to step 205, otherwise, go to step 204 and then to step 205.

And 203, performing linear fitting on the curve graph in the first-layer contour to obtain a fitted graph, and taking the fitted graph and the linear graph in the first-layer contour as each graph in the first-layer contour.

And step 204, taking the straight line graph in the first-layer outline as each graph in the first-layer outline.

Specifically, after a first-layer contour is obtained, traversing non-intersected graphs in the first-layer contour, calculating a linear equation according to coordinates of two points which are farthest away from the currently traversed graph, judging whether coordinates of other points of the currently traversed graph except the two points can meet the linear equation, if the other points meet the linear equation, the currently traversed graph is a straight-line graph, and if one point does not meet the linear equation, the currently traversed graph is a curve graph; and traversing the non-intersected graphs in the first-layer outline, wherein if one graph is a curve graph, the first-layer outline comprises the curve graph. When the first-layer contour comprises a curve pattern, performing linear fitting on the first-layer contour to obtain a fitted pattern, wherein the linear fitting is performed in many ways, for example: a recursive calling method can be adopted; or selecting points on the curve graph according to a preset distance, connecting the selected adjacent points by using a straight line to obtain a fitting graph, and the like, wherein the method for linearly fitting is not specifically limited; taking the fitted graph and the linear graph in the first-layer profile as each graph in the first-layer profile, wherein each graph in the first-layer profile is a linear graph; and when the first-layer contour does not comprise the curve figures, all the figures in the first-layer contour are straight-line figures, and the straight-line figures in the first-layer contour are directly used as all the figures in the first-layer contour.

Step 205, selecting a target point from points on each graph in the first layer outline; wherein the target point represents a position at which warping is likely to occur during printing.

In one example, selecting a target point from points on each graphic in the first layer contour includes: and selecting vertexes corresponding to included angles with preset degrees from the vertexes of the graphs in the first-layer outline as target points according to the included angles at the vertexes of the graphs in the first-layer outline.

Specifically, after obtaining each graph in the first layer profile, obtaining an end point shared by any two edges in the graph to obtain each vertex of the graph, and calculating an included angle at the vertex according to the two edges sharing the vertex, it can be known that the two edges sharing the vertex divide an angle of 360 degrees into two included angles, that is, the included angle at each vertex includes two included angles, if one of the included angles at a certain vertex is an included angle meeting a preset number of degrees, the vertex is a target point, and since the calculation of the included angle at each vertex is simple, the process of determining whether the included angle is a position where the edge is easy to warp during printing through the included angle of the preset number of degrees is simple, the target point can be selected quickly, and thus a printed file can be obtained quickly. The following is illustrated as an example: if the vertex is B and the two edges sharing the vertex B are AB and BC, according to the vector formula: the included angle θ can be calculated by cos (θ) ═ (AB · BC)/(| AB | · | BC |), and if the included angle θ is 75 degrees, the two included angles at the vertex B are 75 degrees and 285 degrees, respectively; if the vertex is C and the two edges sharing the vertex C are BC and CD, the angle θ can be calculated according to the vector formula cos (θ) ═ BC · CD/(| BC | · | CD |), and if the angle θ is 135 degrees, the two angles at the vertex C are 135 degrees and 225 degrees, respectively. In an example, if the predetermined number of degrees is not greater than 90 degrees, a vertex corresponding to an included angle not greater than 90 degrees is selected from vertices of each graph in the first layer of the contour as the target point, and as explained in the above example, the vertex B has an included angle of 75 degrees, that is, the vertex B includes an included angle not greater than 90 degrees, and the vertex B is the target point. Because the vertex that the contained angle that is not more than 90 degrees corresponds is more sharp position, and more sharp position takes place to stick up the limit more easily, so will predetermine the number of degrees and set up to be not more than 90 degrees, the target point of choosing is more reasonable, has further reduced the possibility that takes place to stick up the limit when printing.

In one example, the vertices of each graph in the top layer contour are taken as target points.

And step 206, confirming the radiating points of the skirt edges corresponding to the target points according to the target points, and confirming the radiating ranges corresponding to the radiating points in the direction parallel to the first layer of slices.

And step 207, traversing each radiation point, and radiating according to the radiation range and the preset height corresponding to the currently traversed radiation point to obtain skirt data.

And step 208, obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a print file according to the combined slice data of each layer, so that the printer prints the model to be printed including the skirt according to the print file.

The steps 206-208 are similar to the steps 104-106 in the first embodiment, and will not be described herein again.

In this embodiment, when the first layer profile includes the curved graph, there are many points on the curved graph, the calculation amount of selecting the radiation point from the points of the first layer profile is large, and the curved graph is fitted into the linear fitting first, so that each graph in the first layer profile is a linear graph, and the points on the linear graph are reduced compared with the points on the curved graph, so that the radiation point can be selected quickly, and the printed file can be obtained quickly.

A third embodiment of the present application relates to a 3D print file generation apparatus, a schematic structural diagram of the print file generation apparatus is shown in fig. 8, and the apparatus includes:

the slicing module 301 is configured to slice the model to be printed in layers to obtain slice data of each layer;

a first determining module 302, configured to determine each graph in the first-layer contour according to the first-layer slice data;

a selecting module 303, configured to determine each graph in the first-layer contour according to the first-layer slice data, and select a target point from points on each graph in the first-layer contour; the target point represents a position where the edge warping is easy to occur during printing;

a second determining module 304, configured to determine, according to each target point, a radiation point of the skirt corresponding to each target point, and determine a radiation range corresponding to each radiation point in a direction parallel to the first slice;

the skirt data generation module 305 is configured to traverse each radiation point, and perform radiation according to a radiation range and a radiation height corresponding to the currently traversed radiation point to obtain skirt data;

and the print file generation module 306 is configured to obtain combined slice data of each layer according to the skirt data and the slice data of each layer, and obtain a print file according to the combined slice data of each layer, so that the printer prints the model to be printed including the skirt according to the print file. For the specific limitations of the apparatus, reference may be made to the limitations of the method described above, which are not described in detail herein. The various modules in the above-described apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one example, the identifying, according to the target points, the radiation points of the skirt corresponding to the target points includes: confirming the printing sequence of each target point according to the first layer slicing data, and connecting the target points in sequence according to the printing sequence; selecting first-class target points, the distances between which and two adjacent target points are larger than a preset distance, from the target points, and respectively taking each target point in the first-class target points as a radiating point of a skirt corresponding to each target point in the first-class target points; taking the target points of all the target points except the first type target point as second type target points, dividing the second type target points into a plurality of groups, and taking the middle point of the connecting line of the two second type target points with the farthest distance in each group as the radiation point of the skirt edge corresponding to each target point in one group; wherein the second type target points in each group are connected in sequence.

In one example, the determining a radiation range corresponding to each radiation point in a direction parallel to the slice of the first layer includes: if the radiation point is the target point in the first-class target point, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle with the radiation point as the center of the circle and the preset distance as the diameter; if the radiation point is the midpoint of a connecting line of two second-class target points which are farthest from each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle which takes the radiation point as the center of a circle and the sum of m preset distances and the connecting line as the diameter; wherein m is a positive integer.

In one example, the determining a radiation range corresponding to each radiation point in a direction parallel to the slice of the first layer includes: if the radiation point is a target point in the first class of target points, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first layer of slice is a regular polygon with the radiation point as the center and the preset distance as the diameter of a circumscribed circle; if the radiation point is the midpoint of a connecting line of two second-class target points which are farthest from each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a regular polygon which takes the radiation point as the center and the sum of the n preset distances and the connecting line as the diameter of a circumscribed circle; wherein n is a positive integer.

In one example, the radiating according to the radiation range and the height corresponding to the currently traversed radiation point to obtain the skirt data includes: calculating the coordinates of three vertexes of each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point and the corresponding radiation range, and respectively calculating the coordinates of the three vertexes of each triangular patch positioned on the top surface, the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the top surface and the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point, the corresponding radiation range and the corresponding height; wherein the side surface is located between the top surface and the bottom surface; and combining the coordinates of the three vertexes of the triangular patches positioned on the bottom surface, the coordinates of the three vertexes of the triangular patches positioned on the top surface, the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the top surface and the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the bottom surface to obtain skirt data.

In one example, if the coordinates of the currently traversed radiation point are (x, y, 0), the coordinates of the three vertices of the i-th triangle patch on the bottom surface are (x, y, 0), (x + r x cos ((i-1) a), y + r x sin ((i-1) a), 0), (x + r x cos (i a), y + r sin (i a), 0), respectively; the coordinates of three vertexes of the ith triangular patch positioned on the top surface are (x, y, h), (x + r) cos ((i-1) a), y + r sin (i a), h), (x + r cos (i a), y + r sin (i a), h) respectively; the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the top surface are (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), h), (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r sin (i × a), h); the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the bottom surface are (x + r & ltx & gt & lt x & gt & lt x & gt & lt x + r & gt & lt x & gt & lt x & gt & lt x & gt & lt & gt a & lt 0, x + r & lt x & lt & gt & lt & gt & lt & gt & lt cos (i & gt & lt & gt a & gt a & lt x & gt a & gt, a & lt x & gt, a & lt & gt, a & lt x & gt, a & lt x & gt a & gt, a & gt a & lt cos & gt, a & lt cos (i & gt, a & gt a & lt x & gt, a & gt a & lt x & gt a & gt and a & gt a & lt x.

In one example, the identifying each graph in the top-layer contour according to the top-layer slice data includes: confirming the first-layer contour according to the first-layer slice data; and if the first-layer contour comprises a curve graph, performing linear fitting on the curve graph in the first-layer contour to obtain a fitted graph, and taking the fitted graph and the linear graph in the first-layer contour as each graph in the first-layer contour.

In one example, the selecting a target point from points on each graph in the top layer contour includes: and selecting vertexes corresponding to included angles with preset degrees from the vertexes of the graphs in the first-layer outline as target points according to the included angles at the vertexes of the graphs in the first-layer outline.

In one example, the predetermined number of degrees is not greater than 90 degrees.

In one example, the obtaining merged slice data of each layer according to the skirt data and the slice data of each layer includes: generating a skirt edge according to the skirt edge data, and slicing the skirt edge in layers to obtain slice data of each layer of skirt edge; and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer to obtain the merged slice data of each layer.

In one example, the merging the skirt slice data and the slice data of the corresponding layer to obtain merged slice data of each layer includes: and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer through a Boolean algorithm to obtain the merged slice data of each layer.

In one example, the height is calculated by the following formula: h ═ H × d; and H is the height, H is the height of the model to be printed, and d is a preset ratio.

In one example, the distance between the point on the contour of the radiation range farthest from the corresponding radiation point and the corresponding radiation point is calculated by the following formula: d ═ h × m; and D is the distance between the farthest point and the corresponding radiation point, h is the height of the model to be printed, and m is a preset ratio.

In one example, the height is gradually reduced along a direction in which the radiation point points to the contour of the radiation range.

For the specific limitations of the apparatus, reference may be made to the limitations of the method described above, which are not described in detail herein. The various modules in the above-described apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

A fourth embodiment of the present application provides a computer device, which may be a terminal, such as: the internal structure of a computer, a mobile phone and the like can be shown in fig. 9. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless communication can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a method of generating a 3D print file. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.

Those skilled in the art will appreciate that the architecture shown in fig. 9 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.

In one example, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps in the above-described method embodiments when executing the computer program.

A fifth embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and the computer program realizes the steps in the above-mentioned method embodiments when being executed by a processor.

In one example, a computer program product or computer program is provided that includes computer instructions stored in a computer-readable storage medium. The computer instructions are read by a processor of a computer device from a computer-readable storage medium, and the computer instructions are executed by the processor to cause the computer device to perform the steps in the above-mentioned method embodiments.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), for example.

The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A method for generating a 3D printing file is characterized by comprising the following steps:

carrying out layered slicing on the model to be printed to obtain each layer of slice data;

confirming each graph in the first-layer outline according to the first-layer slice data;

selecting a target point from points on each graph in the first-layer contour; the target point represents a position where the edge warping is easy to occur during printing;

confirming the radiation points of the skirt edges corresponding to the target points according to the target points, and confirming the radiation range corresponding to the radiation points in the direction parallel to the first layer of slices;

traversing each radiation point, and radiating according to the radiation range and the height corresponding to the currently traversed radiation point to obtain skirt data;

and obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file.

2. The method for generating a 3D print file according to claim 1, wherein the identifying the radiation points of the skirt corresponding to the target points according to the target points comprises:

confirming the printing sequence of each target point according to the first layer slicing data, and connecting the target points in sequence according to the printing sequence;

selecting first-class target points, the distances between which and two adjacent target points are larger than a preset distance, from the target points, and respectively taking each target point in the first-class target points as a radiating point of a skirt corresponding to each target point in the first-class target points;

taking the target points of all the target points except the first type target point as second type target points, dividing the second type target points into a plurality of groups, and taking the middle point of the connecting line of the two second type target points with the farthest distance in each group as the radiation point of the skirt edge corresponding to each target point in one group; wherein the second type target points in each group are connected in sequence.

3. The method for generating a 3D print file according to claim 2, wherein the confirming of the radiation range corresponding to each radiation point in the direction parallel to the slice of the first layer comprises:

if the radiation point is the target point in the first-class target point, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle with the radiation point as the center of the circle and the preset distance as the diameter;

if the radiation point is the midpoint of a connecting line of two second-class target points which are farthest from each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a circle which takes the radiation point as the center of a circle and the sum of m preset distances and the connecting line as the diameter; wherein m is a positive integer.

4. The method for generating a 3D print file according to claim 2, wherein the confirming of the radiation range corresponding to each radiation point in the direction parallel to the slice of the first layer comprises:

if the radiation point is a target point in the first class of target points, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first layer of slice is a regular polygon with the radiation point as the center and the preset distance as the diameter of a circumscribed circle;

if the radiation point is the midpoint of a connecting line of two second-class target points which are farthest from each group, confirming that the radiation range corresponding to the radiation point in the direction parallel to the first-layer slice is a regular polygon which takes the radiation point as the center and the sum of the n preset distances and the connecting line as the diameter of a circumscribed circle; wherein n is a positive integer.

5. The method for generating a 3D print file according to claim 1, wherein the radiating according to the radiation range and the height corresponding to the currently traversed radiation point to obtain the skirt data includes:

calculating the coordinates of three vertexes of each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point and the corresponding radiation range, and respectively calculating the coordinates of the three vertexes of each triangular patch positioned on the top surface, the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the top surface and the coordinates of the three vertexes of each triangular patch positioned on the side surface and connected with each triangular patch positioned on the bottom surface according to the coordinates of the currently traversed radiating point, the corresponding radiation range and the corresponding height; wherein the side surface is located between the top surface and the bottom surface;

and combining the coordinates of the three vertexes of the triangular patches positioned on the bottom surface, the coordinates of the three vertexes of the triangular patches positioned on the top surface, the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the top surface and the coordinates of the three vertexes of the triangular patches positioned on the side surface and connected with the triangular patches positioned on the bottom surface to obtain skirt data.

6. The method for generating a 3D print file according to claim 5, wherein if the coordinates of the currently traversed radiation point is (x, y, 0),

the coordinates of three vertexes of the ith triangular patch positioned on the bottom surface are (x, y, 0), (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r × sin (i × a), 0);

the coordinates of three vertexes of the ith triangular patch positioned on the top surface are (x, y, h), (x + r) cos ((i-1) a), y + r sin (i a), h), (x + r cos (i a), y + r sin (i a), h) respectively;

the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the top surface are (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), h), (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r sin (i × a), h);

the coordinates of three vertexes of the triangular patch positioned on the side surface and connected with the ith triangular patch positioned on the bottom surface are (x + r × cos ((i-1) × a), y + r × sin ((i-1) × a), 0), (x + r × cos (i × a), y + r × sin (i × a), 0), (x + r × cos (i a), y + r × sin (i × a), h) respectively;

wherein r is the radius of the corresponding radiation range, h is the preset height, a is the preset radian, and i is an integer not less than 1 and not more than (2 pi/a).

7. The method for generating a 3D print file according to claim 1, wherein the identifying each figure in the top layer outline from the top layer slice data includes:

confirming the first-layer contour according to the first-layer slice data;

and if the first-layer contour comprises a curve graph, performing linear fitting on the curve graph in the first-layer contour to obtain a fitted graph, and taking the fitted graph and the linear graph in the first-layer contour as each graph in the first-layer contour.

8. The method for generating a 3D print file according to claim 7, wherein the selecting a target point from the points on the graphics in the top layer outline comprises:

and selecting vertexes corresponding to included angles with preset degrees from the vertexes of the graphs in the first-layer outline as target points according to the included angles at the vertexes of the graphs in the first-layer outline.

9. The generation method of the 3D print file according to claim 8, wherein the preset degree is not more than 90 degrees.

10. The method for generating a 3D print file according to claim 1, wherein the obtaining of the combined slice data of each layer from the skirt data and the slice data of each layer includes:

generating a skirt edge according to the skirt edge data, and slicing the skirt edge in layers to obtain slice data of each layer of skirt edge;

and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer to obtain the merged slice data of each layer.

11. The method for generating a 3D print file according to claim 10, wherein the merging the skirt slice data and the slice data of the corresponding layer to obtain merged slice data of each layer includes:

and respectively carrying out union operation on the skirt edge slice data and the slice data of the corresponding layer through a Boolean algorithm to obtain the merged slice data of each layer.

12. The method for generating a 3D print file according to claim 1, wherein the height is calculated by the following formula:

H＝h*d；

and H is the height, H is the height of the model to be printed, and d is a preset ratio.

13. The method for generating a 3D print file according to claim 1, wherein the distance between the point on the contour of the radiation range farthest from the corresponding radiation point and the corresponding radiation point is calculated by the following formula:

D＝h*m；

and D is the distance between the farthest point and the corresponding radiation point, h is the height of the model to be printed, and m is a preset ratio.

14. The method of generating a 3D printed file according to claim 1, wherein the height is gradually reduced along a direction in which the radiation point points to the outline of the radiation range.

15. An apparatus for generating a 3D print file, comprising:

the slicing module is used for carrying out layered slicing on the model to be printed to obtain each layer of slicing data;

the first confirming module is used for confirming each graph in the first-layer outline according to the first-layer slice data;

a selecting module for selecting a target point from points on each graph in the first layer contour; the target point represents a position where the edge warping is easy to occur during printing;

the second confirming module is used for confirming the radiating points of the skirt edge corresponding to the target points according to the target points and confirming the radiating range corresponding to the radiating points in the direction parallel to the first layer of slices;

the skirt data generation module is used for traversing each radiation point, and performing radiation according to the radiation range and the radiation height corresponding to the currently traversed radiation point to obtain skirt data;

and the printing file generation module is used for obtaining combined slice data of each layer according to the skirt data and the slice data of each layer, and obtaining a printing file according to the combined slice data of each layer, so that the printer prints the model to be printed comprising the skirt according to the printing file.

16. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method of generating a 3D printed file according to any one of claims 1 to 14 when executing the computer program.

17. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of generating a 3D print file according to any one of claims 1 to 14.