CN113352619B - Skirt edge generation method and device for starting position, computer equipment and storage medium - Google Patents
Skirt edge generation method and device for starting position, computer equipment and storage medium Download PDFInfo
- Publication number
- CN113352619B CN113352619B CN202110745073.3A CN202110745073A CN113352619B CN 113352619 B CN113352619 B CN 113352619B CN 202110745073 A CN202110745073 A CN 202110745073A CN 113352619 B CN113352619 B CN 113352619B
- Authority
- CN
- China
- Prior art keywords
- graph
- layer
- target
- currently traversed
- outline
- 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
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/10—Additive manufacturing, e.g. 3D printing
Landscapes
- Engineering & Computer Science (AREA)
- Chemical & Material Sciences (AREA)
- Materials Engineering (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Manufacturing & Machinery (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mechanical Engineering (AREA)
- Pure & Applied Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Optics & Photonics (AREA)
- Image Generation (AREA)
Abstract
The application relates to a method and a device for generating a skirt edge at a starting position, computer equipment and a storage medium, wherein the method comprises the following steps: horizontally slicing the model to be printed to obtain the outline of a first-layer horizontal slice; performing oblique slicing on the model to be printed to obtain the outline of each oblique slice; acquiring a graph according to the outline of the first-layer horizontal slice, and adding the graph into a graph set; traversing each graph in the current graph set, acquiring a target profile which is closest to the currently traversed graph in the profiles of all the oblique slices, confirming a target point with the minimum distance from the target profile in the points on the currently traversed graph, confirming an initial position when the target profile is printed according to the target point, and radiating the external of the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge. Under the prerequisite that can't stick to the possibility of hot bed when reducing the model and printing, reduce the area of shirt rim, improve the shaping speed of model, reduce the waste of printing consumptive material and improve the roughness on model surface.
Description
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 skirt at an initial position, a computer device, and a storage medium.
Background
The application field of three-dimensional (3D) printing technology is becoming wider and wider under the push of the intellectualization of computer digital technology, and 3D printing is to manufacture a three-dimensional object by printing a layer by layer of bonding material. Before 3D printing, slicing the model, wherein the current slicing method mainly comprises the steps of horizontally slicing the model and obliquely slicing the model, wherein an included angle between the direction of the obliquely sliced piece and a horizontal plane is larger than zero when the obliquely sliced piece is obliquely sliced; when the model is obliquely sliced to obtain a printed file and the printed file is used for printing, the printed first layer is a long or short line, the first layer is extremely difficult to stick to the hot bed at the moment, in order to enable the first layer to stick to the hot bed, the skirt edge is generated around the outer contour of the first layer when the sliced file is generated, so that the possibility that the first layer sticks to the hot bed can be improved when the skirt edge is printed, but the skirt edge at the moment is larger, the forming speed of the model is reduced, and printing consumables are wasted.
Disclosure of Invention
In view of the above, it is desirable to provide a skirt generating method, apparatus, computer device and storage medium for a start position.
The embodiment of the application provides a skirt edge generation method at an initial position, which comprises the following steps: horizontally slicing the model to be printed layer by layer to obtain the outline of the first layer of horizontal slices; performing oblique slicing on the model to be printed layer by layer to obtain the outline of each oblique slice; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero; acquiring a plurality of graphs according to the outline of the first-layer horizontal slice, and adding the graphs into a graph set; traversing each graph in a current graph set, obtaining a target profile which is closest to the currently traversed graph in the profiles of all layers of oblique slices, confirming a target point with the minimum distance from points on the currently traversed graph to the target profile, confirming an initial position when the target profile is printed according to the target point, and radiating the external part of the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge.
The embodiment of this application still provides a shirt rim of initial position and produces device, includes: the first acquisition module is used for horizontally slicing the model to be printed layer by layer to acquire the outline of the first-layer horizontal slice; the second acquisition module is used for obliquely slicing the model to be printed and acquiring the outline of each layer of oblique slices; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero; a third obtaining module, configured to obtain a plurality of graphs according to the profile of the first-layer horizontal slice, and add the plurality of graphs to a graph set; the generating module is used for traversing each graph in the current graph set, obtaining a target profile which is closest to the currently traversed graph at first in the profiles of all the oblique slices, confirming a target point with the minimum distance to the target profile in points on the currently traversed graph, confirming an initial position when the target profile is printed according to the target point, and radiating outside the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge.
The embodiment of the present application further provides a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the skirt edge generation method at the start position when executing the computer program.
The 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 skirt generating method for the start position described above.
In addition, the confirming a starting position when printing the target contour according to the target point comprises: judging whether the number of the target points is more than 1; if yes, selecting a point closest to the origin of coordinates from the target points as an initial position when the target contour is printed. When the point closest to the origin of coordinates is selected, the nozzle can move to the point closest to the origin of coordinates quickly in the printing process, so that the printing speed can be improved.
In addition, the acquiring a plurality of graphs according to the profile of the first-layer horizontal slice, and adding the plurality of graphs into a graph set includes: judging whether the contour of the first-layer horizontal slice comprises a curve graph or not, if so, performing linear fitting on the curve graph of the contour of the first-layer horizontal slice to obtain a fitted graph, and adding the fitted graph and the linear graph in the contour of the first-layer horizontal slice into a graph set; the determining a target point with a minimum distance to the target contour among the points on the currently traversed graph includes: and identifying a target point with the minimum distance to the target contour in the vertexes of the currently traversed graph. By the method, each graph in the graph set can be a linear image, so that when the initial position is confirmed, only the distance from the vertex to the target contour needs to be calculated, the calculation amount is reduced, and the skirt edge generating speed can be increased.
In addition, after the step of adding the fitted graph and the straight-line image in the contour of the first-layer horizontal slice into a graph set, the method further comprises the following steps: judging whether the current graph set comprises unclosed graphs or not, if so, respectively performing closed repair on each unclosed graph, and respectively updating each unclosed graph into a corresponding closed repaired polygon; judging whether the current graph set comprises intersected polygons or not, if so, respectively removing the overlapped part in each intersected polygon, and updating each intersected polygon into a corresponding polygon with the overlapped part removed. Due to the diversity of the shapes of the models to be printed, the obtained outlines of the first-layer horizontal slices are also diversified, each graph in the graph set is also diversified, no vertex exists at the notch of the unclosed graph, but a skirt edge is possibly generated at the notch, and the skirt edge cannot be generated at the intersection part in the intersected polygon, and the vertex at the position is redundant, so that after each graph in the graph set is updated, the vertex in each graph is more reasonable, the generated skirt edge is more reasonable, and the possibility that the hot bed cannot be stuck during model printing is further reduced.
In addition, after the updating of each of the intersecting patterns to a corresponding one of the patterns with the overlap removed, the method further includes: judging whether the current graph set comprises a concave polygon or not; and if so, dividing each concave polygon into a plurality of convex polygons, and updating each concave polygon into a plurality of corresponding convex polygons respectively. By the method, the concave polygon can be converted into a plurality of convex polygons, so that the skirt edge is generated in each convex polygon, and the possibility that the hot bed cannot be stuck during model printing can be further reduced.
In addition, before the determining whether the concave polygon is included in the current graphics set, the method further includes: simplifying each graph in the current graph set respectively, and updating each graph into each corresponding graph after simplification; and/or after the concave polygons are respectively updated to a plurality of corresponding convex polygons, the method further comprises the following steps: and simplifying each graph in the current graph set respectively, and updating each graph into each corresponding graph after simplification. Since each polygon is subjected to simplification processing, the data amount of an excessively minute polygon can be reduced, the subsequent calculation amount can be reduced, the speed of confirming the start position can be increased, and the speed of generating the skirt can be increased.
In addition, the determining whether the current graphic set includes a concave polygon includes: and traversing each graph in the current graph set, calculating cross products of adjacent edge vectors of the currently traversed graph, judging whether the cross products include cross products smaller than zero, and if so, determining that the currently traversed graph is a concave polygon. Whether the polygon is a concave polygon can be easily identified through the cross product of adjacent edge vectors and the size of zero.
According to the skirt edge generation method, the skirt edge generation device, the computer equipment and the storage medium, when the model to be printed is obliquely sliced, the first few layers of slices are printed and can be basically close to the hot bed part and the next layers of slices are printed and possibly close to the hot bed part, but the initial position when the outline close to the hot bed is printed cannot be directly confirmed according to the slices obtained by oblique slicing, so that the outline of the horizontal oblique slice at the first layer is obtained by horizontally slicing the model to be printed layer by layer, and the outline of the oblique slice at each layer is obtained by obliquely slicing the model to be printed layer by layer; the method comprises the steps of obtaining a plurality of graphs according to the outline of a first layer of horizontal slices, adding the plurality of graphs into a graph set, traversing each graph in the current graph set, obtaining a target outline which is closest to the currently traversed graph in the outlines of each layer of inclined slices, confirming a target point with the minimum distance from a point on the currently traversed graph to the target outline, confirming an initial position when the target outline is printed according to the target point, radiating the outside of the currently traversed graph according to the radiation distance to generate a skirt by taking the initial position as a radiation point, and only generating the skirt around each initial position respectively.
Drawings
FIG. 1 is a flow chart of a skirt generating method of a start position according to a first embodiment of the present application;
FIG. 2 is a schematic illustration of the outline of a first-level horizontal slice of a model to be printed in a 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 a graph A of the skirt generated in the first embodiment of the present application;
FIG. 5 is a flowchart of a skirt generating method at a start position according to a second embodiment of the present application;
FIG. 6 is a diagram illustrating graphs in a current graph set according to a second embodiment of the present application;
FIG. 7 is a flowchart of a specific implementation manner of step 207 in the second embodiment of the present application;
FIG. 8 is a flow chart of a skirt generating method of a start position according to a third embodiment of the present application;
FIG. 9 is a diagram of graphs in a current graph set according to a third embodiment of the present application;
FIG. 10 is a flow chart of a skirt generating method of a start position according to a fourth embodiment of the present application;
FIG. 11 is a flow chart of a skirt generating method of a start position according to a fifth embodiment of the present application;
FIG. 12 is a schematic view of a polygon C2 according to a fifth embodiment of the present application;
FIG. 13 is a simplified schematic diagram of a polygon C3 according to a fifth embodiment of the present application;
FIG. 14 is a schematic view of a skirt generating device in a starting position according to a sixth embodiment of the present application;
fig. 15 is a schematic structural diagram of a computer device according to a seventh embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clearly understood, the present application is further described in 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 skirt at a start position, which is applied to a computer device, and includes: computers, cell phones, etc. The flowchart of the skirt edge generating method at the start position in this embodiment is shown in fig. 1, and includes:
Specifically, after receiving an imported model to be printed, slicing software in the computer device horizontally slices the model to be printed layer by layer, wherein the included angle between the direction of the horizontal slice and the horizontal plane is zero, so that each layer of slices obtained after horizontal slicing is parallel to the bottom of a working space, wherein the working space is a space formed by a printing platform of a printer for printing the model to be printed in the slicing software; after the layer-by-layer horizontal slicing is completed, the outline of the first layer horizontal slice is obtained, the first layer refers to the layer closest to the bottom of the working space, and the outline of the first layer horizontal slice can be obtained according to the first layer slice of the horizontal slice.
102, performing layer-by-layer oblique slicing on a model to be printed, and acquiring the outline of each layer of oblique slices; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero.
Specifically, slice software of the computer device performs layer-by-layer oblique slicing on the model to be printed, an included angle between the direction of the oblique slicing and a horizontal plane is greater than zero, the direction of the oblique slicing can be set according to actual needs, the embodiment is not specifically limited, and after oblique slicing is performed, the outline of each layer of oblique slicing is obtained.
It should be noted that the execution sequence between step 101 and step 102 is not limited, and step 102 may be executed first, and then step 101 is executed.
And 103, acquiring a plurality of graphs according to the outline of the first-layer horizontal slice, and adding the plurality of graphs into a graph set.
Specifically, due to the diversity of shapes of models to be printed, the outline of the first-layer horizontal slice also has diversity, and the outline of the first-layer horizontal slice may include one figure or a plurality of figures, wherein the figures may be closed figures or non-closed figures, for example: when the middle portion of the model to be printed is empty and an unsealed surface exists on the periphery, the outline of the first-layer horizontal slice is an unsealed graph, and when the outline of the first-layer horizontal slice includes a plurality of graphs, intersection may exist among the graphs, as shown in fig. 2, the outline of the first-layer horizontal slice of the model to be printed is a schematic diagram of the outline of the first-layer horizontal slice of the model to be printed, and the outline of the first-layer horizontal slice includes graphs a, B, C, and D, and the embodiment and the following embodiments are specifically described by taking the graph 2 as an example. In this embodiment, after the contour of the first-layer horizontal slice is obtained, the graphics included in the contour of the first-layer horizontal slice are directly added to the graphics set, that is, the graphics in the graphics set are graphics a, B, C, and D.
And 105, acquiring a target contour which is firstly close to the currently traversed graph in the contours of each layer of inclined slices, confirming a target point with the minimum distance to the target contour in points on the currently traversed graph, confirming an initial position when the target contour is printed according to the target point, and radiating the external part of the currently traversed graph according to the radiation distance by taking the initial position as a radiation point to generate a skirt edge.
In one example, a flowchart of a specific implementation of step 105 is shown in fig. 3, and includes:
and 1051, acquiring a target contour which is closest to the currently traversed graph in the contours of the oblique slices of each layer.
And 1056, radiating the outside of the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge.
Specifically, in this embodiment, each graph in the graph set is a graph included in the contour of the first-layer horizontal slice, at this time, there is an overlapping portion between the target contour of the graph that is closest to the current traversal and the graph that is currently traversed, and the target contour of the graph that is closest to the current traversal can be determined according to the distance between the contour of each layer of oblique slice and the graph that is currently traversed and the number of layers in which the contour of the oblique slice is located. If the currently traversed graph is a graph A and the graph A is a rectangle abcd, determining a target contour which is firstly close to the graph A in the inclined slices, wherein the target contour which is firstly close to the graph A is a contour of a part which is overlapped with the graph A at the moment, and if the contour a 'of the first-layer inclined slice is a contour of a part which is overlapped with the graph A at the moment, the contour a' of the first-layer inclined slice is a target contour; calculating the distance between the point on the graph A and the target profile a ', confirming a target point closest to the target profile a', wherein the number of the target points is more than 1 because the target profile is the profile of a part overlapped with the graph A, and if the target point is the point on the side ab, selecting the point closest to the origin of coordinates, namely the point a, from the target points as the initial position when the target profile is printed, wherein the origin of coordinates refers to the point corresponding to the position of the nozzle in the working space; when the point closest to the origin of coordinates is selected, the nozzle can move to the point closest to the origin of coordinates quickly in the printing process, so that the printing speed can be improved. And then, taking the initial position a as a radiation point, radiating to the outside of the graph a according to a preset radiation distance to generate a skirt edge, namely, taking a as the radiation point, intercepting the preset radiation distance on the outline of the graph a, and radiating to the outside of the outline until the preset radiation distance is intercepted again on the outline of the graph a, as shown in fig. 4, a schematic diagram of the graph a for generating the skirt edge is generated, wherein w is the skirt edge.
In one example, when the number of the target points is more than 1, one point is arbitrarily selected from the target points located at both ends of the target contour as a start position when the target contour is printed.
And step 106, judging whether all the graphs in the current graph set are traversed, if so, ending the process, otherwise, entering step 107, and then entering step 105.
In this embodiment, when the model to be printed is obliquely sliced, the first few layers of slices are printed and are basically close to the hot bed part, and the next layers of slices are printed and possibly close to the hot bed part, but the initial position when the outline close to the hot bed is printed cannot be directly confirmed according to the layers of slices obtained by obliquely slicing the models layer by layer, so that the first layer of the horizontal oblique slices is obtained by horizontally slicing the model to be printed layer by layer, and the outline of each layer of oblique slices is obtained by obliquely slicing the model to be printed layer by layer; the method comprises the steps of obtaining a plurality of graphs according to the outline of a first layer of horizontal slices, adding the plurality of graphs into a graph set, traversing each graph in the current graph set, obtaining a target outline which is closest to the currently traversed graph in the outlines of each layer of inclined slices, confirming a target point with the minimum distance from a point on the currently traversed graph to the target outline, confirming an initial position when the target outline is printed according to the target point, radiating the outside of the currently traversed graph according to the radiation distance to generate a skirt by taking the initial position as a radiation point, and only generating the skirt around each initial position respectively.
The second embodiment of the present application relates to a skirt edge generation method, which is applied to a computer device, and includes: the second embodiment is the same as the first embodiment except that: in the first embodiment, each graph in the outline of the first-layer horizontal slice is directly added into a graph set, and in the second embodiment, whether the outline of the first-layer horizontal slice comprises a curve graph or not is judged firstly; if so, carrying out linear fitting on the curve graph of the first-layer horizontal slice outline to obtain a fitted graph, adding the fitted graph and the linear graph in the first-layer horizontal slice outline into a graph set, and confirming a target point with the minimum distance from the top point on the currently traversed graph to the target outline when confirming the target point with the minimum distance from the points on the currently traversed graph to the target outline. Fig. 5 shows a flowchart of the skirt generating method of the present embodiment, which includes:
202, obliquely slicing the model to be printed layer by layer to obtain the outline of each oblique slice; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero.
Steps 201-202 are similar to steps 101-102 in the first embodiment, and are not repeated herein.
Step 203, determine whether the contour of the first layer horizontal slice includes a curve pattern, if yes, go to step 204, then go to step 206, if no, go to step 205, then go to step 206.
Specifically, traversing each graph in the contour of the first-layer horizontal slice, calculating a linear equation according to the coordinates of the head and tail points of the currently traversed graph, if the coordinates of other points of the currently traversed graph except the head and tail points can meet the linear equation, if the coordinates of other points can meet the linear equation, the currently traversed graph is a linear graph, and if one point does not meet the linear equation, the currently traversed graph is a curved graph.
And 204, performing linear fitting on the curve graph of the first-layer horizontal slice outline to obtain a fitted graph, and adding the fitted graph and the linear graph in the first-layer horizontal slice outline into a graph set.
Specifically, there are many ways to fit a curve graph of the contour of the first horizontal slice to a straight line to obtain a fitted graph, for example: a method of recursive invocation may be employed; or, selecting points on the curve graph according to a preset distance, and connecting the selected adjacent points with a straight line to obtain a fitted graph, and the like. Taking the outline of the first-layer horizontal slice in fig. 2 as an example, the graph a is a straight line graph, the graphs B, C, and D are curve graphs, fitting the graphs B, C, and D in a straight line manner to obtain fitting graphs B1, C1, and D1, and taking the fitting graphs B1, C1, and D1 and the straight line graph a in the outline of the first-layer horizontal slice as each graph in the graph set, as shown in fig. 6, the graph is a schematic diagram of each graph in the current graph set.
In step 205, the graphics included in the outline of the first layer horizontal slice are added to the graphics set.
And step 207, acquiring a target contour which is firstly close to the currently traversed graph in the contours of each layer of inclined slices, confirming a target point with the minimum distance to the target contour in the vertexes of the currently traversed graph, confirming an initial position when the target contour is printed according to the target point, and radiating the outside of the currently traversed graph according to the radiation distance by taking the initial position as a radiation point to generate a skirt edge.
In one example, a flowchart of a specific implementation manner of step 207 is shown in fig. 7, and includes:
Specifically, if the currently traversed graph is a fitted graph, a target contour which is firstly close to the currently traversed graph may overlap with the currently traversed graph, may also intersect with the currently traversed graph, and may also have a certain distance from the currently traversed graph, and if the currently traversed graph is a straight-line graph in the first-layer horizontal slice contour, a target contour which is firstly close to the currently traversed graph may overlap with the currently traversed graph; according to the distance between the outline of the oblique slice and the currently traversed graph and the number of layers where the outline of the oblique slice is located, the target outline which is firstly close to the currently traversed graph can be obtained, for example: the target contour that is closest to the currently traversed graph at this time may be the contour corresponding to the 200 th oblique slice. After the target contour is obtained, because the graphs at the moment are all straight-line graphs, namely polygons, the graphs at the moment are provided with vertexes, a target point with the minimum distance to the target contour in the vertexes of the currently traversed graph is confirmed, if the number of the target points is more than 1, a point closest to the origin of coordinates is selected from the target points to serve as an initial position when the target contour is printed, and when the point closest to the origin of coordinates is selected, the nozzle can be moved to the point closest to the origin of coordinates quickly in the printing process, so that the printing speed can be improved. And if the number of the target points is equal to 1, taking the target points as the initial positions of the printing target outlines. And then radiating the outside of the currently traversed graph according to the preset radiation distance by taking the initial position as a radiation point to generate a skirt edge, namely intercepting the preset radiation distance on the outline of the currently traversed graph by taking the initial position as the radiation point, and radiating the preset radiation distance to the outside of the outline until intercepting the preset radiation distance on the outline of the currently traversed graph again.
In one example, when the number of the target points is more than 1, one point is arbitrarily selected from the target points located at both ends of the target contour as a start position when the target contour is printed.
And step 208, judging whether all the graphs in the current graph set are traversed, if so, ending the process, otherwise, entering step 209 first, and then entering step 207.
Step 209 traverses the next graph in the current set of graphs.
In this embodiment, each graph in the graph set is a linear image, so that when the start position is confirmed, only the distance from the vertex to the target contour needs to be calculated, the calculation amount is reduced, and the speed of generating the skirt edge can be increased.
The third embodiment of the present application relates to a skirt generating method, applied to a computer device, such as: the third embodiment is substantially the same as the second embodiment except that: after each graph in the graph set is obtained, each graph in the graph set is also updated. Fig. 8 shows a flowchart of the skirt generating method of the present embodiment, which includes:
Step 303, determine whether the contour of the first layer horizontal slice includes a curve pattern, if yes, go to step 304, then go to step 306, if no, go to step 305, then go to step 306.
And 304, performing linear fitting on the curve graph of the first-layer horizontal slice outline to obtain a fitted graph, and adding the fitted graph and the linear graph in the first-layer horizontal slice outline into a graph set.
Steps 301-305 are similar to step 205 in the second embodiment and will not be described again.
And 307, performing closed repairing on each unclosed graph, and updating each unclosed graph into a corresponding polygon subjected to closed repairing.
Step 308, determining whether the current graph set includes an intersecting polygon, if yes, entering step 309, then entering step 3010, and if not, entering step 3010.
Specifically, there are many methods for performing closed repair on an unclosed graph, such as: two points at the opening can be connected by a line segment, and a polygon can be added at the opening, so that a closed repaired graph is obtained, wherein the closed repaired graph is composed of a plurality of edges, namely the closed repaired graph is the closed repaired polygon; an intersecting polygon refers to a set of polygons that have an intersection. Taking fig. 6 as an example for description, it is determined whether an unclosed graph is included in the current graph set, the graph B1 is an unclosed graph, the graph B1 is subjected to closure repair first, to obtain a polygon B2 after closure repair, the graph B1 is updated to the graph B2, the current graph set includes the graphs a, B2, C1, and D1, it is then determined whether an intersected polygon is included in the current graph set, the graphs C1 and D1 are a group of polygons which are intersected, overlapping portions in the graphs C1 and D1 are removed, and the graphs C1 and D1 are updated to a corresponding polygon C2 after the overlapping portions are removed, as shown in fig. 8, which is a schematic diagram of each graph in the current graph set.
Steps 3010-3013 are similar to steps 206-209 of the second embodiment and are not described here again.
In this embodiment, due to the diversity of the shapes of the models to be printed, the obtained profile of the first-layer horizontal slice also has diversity, each graph in the graph set also has diversity, the unclosed graph does not have a vertex at the notch, but a skirt is possibly generated at the notch, the skirt cannot be generated at the intersection part in the intersected polygon, and the vertex at the position has redundancy, so that after each graph in the graph set is updated, the vertex in each graph is more reasonable, the generated skirt is more reasonable, and the possibility that the model cannot stick to a hot bed during printing is further reduced.
The fourth embodiment of the present application relates to a skirt edge generation method, which is applied to a computer device, and includes: the fourth embodiment is the same as the third embodiment except that: after each intersected graph is updated to a corresponding graph with the overlapped part removed, the method further comprises the following steps: judging whether the current graph set comprises a concave polygon or not; if yes, each concave polygon is divided and converted into a plurality of convex polygons, and each concave polygon is updated into a plurality of corresponding convex polygons. Fig. 10 shows a flowchart of the skirt edge generating method of the present embodiment, which includes:
and step 401, performing layer-by-layer horizontal slicing on the model to be printed, and acquiring the outline of the first-layer horizontal slice.
And step 404, performing linear fitting on the curve graph of the first-layer horizontal slice outline to obtain a fitted graph, and adding the fitted graph and the linear graph in the first-layer horizontal slice outline into a graph set.
And 407, respectively performing closed repair on each unclosed graph, and respectively updating each unclosed graph into a corresponding polygon subjected to closed repair.
Step 408, determining whether the current graph set includes an intersected polygon, if yes, entering step 409, and if not, entering step 4010.
And 409, respectively removing the overlapped part in each intersected polygon, and updating each intersected polygon into a corresponding polygon with the overlapped part removed.
In one example, determining whether a concave polygon is included in the current graphics set includes: and traversing each graph in the current graph set, calculating cross products of adjacent edge vectors of the currently traversed graph, judging whether the cross products include cross products smaller than zero, and if so, determining that the currently traversed graph is a concave polygon.
Specifically, the following will be specifically described as an example: if the graphs in the current graph set are polygons A, B and C, the graph traversed currently is a polygon A, and the polygon A comprises edges ab, bc, cd, de, ef and fa, then calculating the cross product of an ab vector and a bc vector, the cross product of a bc vector and a cd vector, the cross product of a cd vector and a de vector, the cross product of a de vector and an ef vector, and the cross product of an ef vector and a fa vector, if the cross product of the ab vector and the bc vector is less than zero, the cross product of the de vector and the ef vector is less than zero, namely the cross product comprises a cross product less than zero, the polygon A is a concave polygon, if the cross product does not comprise a product less than zero, the polygon A is a convex polygon, and traversing B and C sequentially according to the method. Whether the polygon is a concave polygon can be easily identified by the cross product of adjacent edge vectors and the size of zero.
In one example, determining whether the current graphics set includes a concave polygon includes: traversing each graph in the current graph set, calculating cross products of adjacent edge vectors of the currently traversed graph, and judging whether the cross products comprise cross products smaller than zero, if so, determining that the currently traversed graph is a concave polygon, and determining that the vertex of an angle formed by adjacent edges corresponding to the cross products smaller than zero is a concave point of the currently traversed polygon; the method for converting each concave polygon into a plurality of convex polygons by dividing each concave polygon comprises the following steps: the concave polygon is divided into a plurality of concave polygons by using the extension lines of the sides of the concave polygons passing through the concave points.
Specifically, if the polygon a includes the sides ab, bc, cd, de, ef, fa, the cross product of the ab vector and bc vector, the cross product of the bc vector and cd vector, the cross product of the cd vector and de vector, the cross product of the de vector and ef vector, and the cross product of the ef vector and fa vector are calculated, if the cross product of the ab vector and bc vector is less than zero, and the cross product of the de vector and ef vector is less than zero, the vertex d of the angle formed by ab and bc is a concave point, and the vertex e of the angle formed by de and ef is a concave point, then the polygon A1 is divided by using the extension line of cb or ab to obtain two polygons A1 and A2, and the concave point e is located on the polygon A2, then the polygon A2 is divided by using the extension line of de or fe to obtain two polygons a21 and a22, and then the concave polygon a can be converted into a plurality of convex polygons A1, a21, a22. By the method, the convex polygon can be converted into the plurality of concave polygons in a simpler way, the concave points can be confirmed when judging whether the polygon is the concave polygon or not, and the confirmation is not required to be carried out through other calculation, so that the conversion speed is improved.
Steps 4012-4015 are similar to steps 3010-3013 in the third embodiment and are not described here again.
In this embodiment, the concave polygon can be converted into a plurality of convex polygons by such a method, and thus, a skirt is generated in each convex polygon, which can further reduce the possibility that the hot bed cannot be stuck during the printing of the model.
The fifth embodiment of the present application relates to a skirt edge generation method, which is applied to a computer device, and includes: computer, cell-phone etc., the fifth embodiment is roughly the same as the fourth embodiment, the difference lies in: and simplifying each graph in the current graph set respectively, and updating each graph into each corresponding graph after simplification. Fig. 11 shows a flowchart of the skirt generating method of the present embodiment, which includes:
502, obliquely slicing the model to be printed layer by layer to obtain the outline of each oblique slice; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero.
Step 503, determining whether the contour of the first-layer horizontal slice includes a curve pattern, if so, entering step 504, and if not, entering step 505.
And step 504, performing linear fitting on the curve graph of the first-layer horizontal slice outline to obtain a fitted graph, and adding the fitted graph and the linear graph in the first-layer horizontal slice outline into a graph set.
And 505, adding the graphics included by the outline of the first layer horizontal slice into the graphics set.
And 507, respectively performing closed repair on each unclosed graph, and respectively updating each unclosed graph into a corresponding polygon subjected to closed repair.
Step 508, determining whether the current graph set includes an intersected polygon, if yes, going to step 509, and if no, going to step 5010.
And 509, removing the overlapped part in each intersected polygon, and updating each intersected polygon into a corresponding polygon with the overlapped part removed.
In step 5010, each graph in the current graph set is simplified and updated to the corresponding simplified graph.
Specifically, the polygon is simplified according to a preset simplification algorithm, for example: pock algorithm (Douglas-Peucker, DP), etc. The following briefly describes the process of processing polygons according to a preset simplified algorithm: as shown in fig. 12, which is a schematic diagram of a polygon C2, two points ej that are farthest apart in the polygon are connected to form a straight line ej, distances from other points located at two sides of the straight line ej to the straight line ej are respectively calculated, where the point corresponding to the maximum distance at one side is h, eh and hj are connected to form a straight line, where the point corresponding to the maximum distance at one side is m, em and mj are connected to form a straight line, and then the distance from the point projected on eh to eh is calculated, if the point corresponding to the maximum distance is g, the maximum distance is smaller than a preset distance, all the points projected on eh are removed, the distance from the point projected on hj to hj is calculated, if the point corresponding to the maximum distance is i, the maximum distance is smaller than the preset distance, the point projected on hj is removed, the distance from the point projected on em to em is calculated, if the point corresponding to the maximum distance is o and the maximum distance is greater than the preset distance, respectively connecting eo and om into a straight line, calculating the distance from the point projected on eo to eo, if the point corresponding to the maximum distance is p and the maximum distance is less than the preset distance, removing all the points projected on eo, calculating the distance from the point projected on om to om, if the point corresponding to the maximum distance is n and the maximum distance is less than the preset distance, removing all the points projected on om, calculating the distance from the point projected on mj to mj, if the point corresponding to the maximum distance is k and the maximum distance is less than the preset distance, removing the points projected on mj, and obtaining a simplified polygon C3, which is a schematic diagram of the simplified polygon C3 and is shown in fig. 13.
In step 5011, it is determined whether the current graph set includes a concave polygon. If yes, go to step 5012, if no, go to step 5013.
In step 5012, each concave polygon is divided into a plurality of convex polygons, and each concave polygon is updated to a corresponding plurality of convex polygons.
And 5015, judging whether each graph in the current graph set is traversed or not, if so, ending the process, otherwise, entering 5016 and entering 5017.
Steps 5011-5016 are similar to steps 4010-4015 in the third embodiment and are not described here again.
In one example, steps 5011, 5012 may be performed first, and then step 5010 may be performed.
In one example, after step 5012 is executed, the simplification processing may be performed on each graph in the current graph set, and the graphs may be updated to the corresponding graphs after the simplification processing, and then the process may proceed to step 5013.
In this embodiment, since each polygon is simplified, the data amount of an excessively small polygon can be reduced, the subsequent calculation amount can be reduced, the speed of confirming the start position can be increased, and the speed of generating the skirt can be increased.
A sixth embodiment of the present application relates to a skirt generating device, which is schematically shown in fig. 14 and includes:
the first obtaining module 601, the first obtaining module 601 is configured to perform layer-by-layer horizontal slicing on the model to be printed, and obtain a profile of a first-layer horizontal slice.
The second obtaining module 602, the second obtaining module 602 is configured to perform oblique slicing on the model to be printed layer by layer, and obtain the outline of each oblique slice; wherein, the included angle between the direction of the inclined slice and the horizontal plane is larger than zero.
A third obtaining module 603, where the third obtaining module 603 is configured to obtain a plurality of graphs according to the profile of the first-layer horizontal slice, and add the plurality of graphs into the graph set.
The generating module 604 is configured to traverse each graph in the current graph set, obtain a target contour, which is closest to the currently traversed graph first, in the contours of the oblique slices, determine a target point, which has a minimum distance to the target contour, from among points on the currently traversed graph, determine an initial position when the target contour is printed according to the target point, and radiate the outside of the currently traversed graph according to a radiation distance by using the initial position as a radiation point to generate a skirt.
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 here. 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 seventh 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. 15. 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 skirt generating method. 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.
It will be appreciated by those skilled in the art that the configuration shown in fig. 15 is a block diagram of only a portion of the configuration associated with the present application, and is not intended to limit the computing device to which the present application may be applied, and that a particular computing device may include more or fewer components than 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.
An eighth 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 the 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 of the above-described 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), among others.
All possible combinations of the technical features in the above embodiments may not be described for the sake of brevity, but should be considered as being within the scope of the present disclosure 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 specific and detailed, but not to be understood 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 (10)
1. A method of generating a skirt at a start position, comprising:
horizontally slicing the model to be printed layer by layer to obtain the outline of the first layer of horizontal slices;
performing oblique slicing on the model to be printed layer by layer to obtain the outline of each oblique slice; wherein the included angle between the direction of the inclined slice and the horizontal plane is more than zero;
acquiring a plurality of graphs according to the outline of the first-layer horizontal slice, and adding the graphs into a graph set;
traversing each graph in a current graph set, obtaining a target profile which is closest to the currently traversed graph in the profiles of all layers of oblique slices, confirming a target point with the minimum distance from points on the currently traversed graph to the target profile, confirming an initial position when the target profile is printed according to the target point, and radiating the external part of the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge.
2. The skirt generating method of starting position according to claim 1, wherein said confirming the starting position when printing the target contour according to the target point comprises:
judging whether the number of the target points is more than 1;
if yes, selecting a point closest to the origin of coordinates from the target points as an initial position when the target contour is printed.
3. The method for generating the skirt at the start position according to claim 1 or 2, wherein the obtaining a plurality of graphs according to the contour of the first-layer horizontal slice, and adding the plurality of graphs into a graph set comprises: judging whether the contour of the first-layer horizontal slice comprises a curve graph or not, if so, performing linear fitting on the curve graph of the contour of the first-layer horizontal slice to obtain a fitted graph, and adding the fitted graph and the linear graph in the contour of the first-layer horizontal slice into a graph set;
the determining a target point with a minimum distance to the target contour among the points on the currently traversed graph includes: and identifying a target point with the minimum distance to the target contour in the vertexes of the currently traversed graph.
4. The method for generating a starting position skirt according to claim 3, wherein after adding the fitted graph and the straight-line image in the contour of the first-layer horizontal slice into a graph set, the method further comprises:
judging whether the current graph set comprises unclosed graphs or not, if so, respectively performing closed repair on each unclosed graph, and respectively updating each unclosed graph into a corresponding closed-repaired polygon;
judging whether the current graph set comprises intersected polygons or not, if so, respectively removing the overlapped part in each intersected polygon, and updating each intersected polygon into a corresponding polygon with the overlapped part removed.
5. The method for generating a starting position skirt according to claim 4, wherein after the updating each of the intersecting polygons to a corresponding one of the polygons without overlapping part, the method further comprises:
judging whether the current graph set comprises a concave polygon or not;
and if so, dividing each concave polygon into a plurality of convex polygons, and updating each concave polygon into a plurality of corresponding convex polygons respectively.
6. The method as claimed in claim 5, wherein before the determining whether the current graphic set includes the concave polygon, the method further comprises: simplifying each graph in the current graph set respectively, and updating each graph into each corresponding graph after simplification; and/or
After the updating of the concave polygons to corresponding convex polygons, the method further includes:
and respectively simplifying each graph in the current graph set, and updating each graph into each corresponding graph after simplification.
7. The method for generating a starting position skirt according to claim 5, wherein the determining whether the current graphic set includes a concave polygon comprises:
traversing each graph in the current graph set, calculating cross products of adjacent edge vectors of the currently traversed graph, judging whether the cross products include cross products smaller than zero, and if so, determining that the currently traversed graph is a concave polygon.
8. A skirt generating device in a starting position, comprising:
the first acquisition module is used for horizontally slicing the model to be printed layer by layer to acquire the outline of the first-layer horizontal slice;
the second acquisition module is used for obliquely slicing the model to be printed layer by layer to acquire the outline of each layer of oblique slices; wherein the included angle between the direction of the inclined slice and the horizontal plane is more than zero;
a third obtaining module, configured to obtain a plurality of graphs according to the profile of the first-layer horizontal slice, and add the plurality of graphs into a graph set;
the generating module is used for traversing each graph in the current graph set, obtaining a target profile which is closest to the currently traversed graph at first in the profiles of all the oblique slices, confirming a target point with the minimum distance to the target profile in points on the currently traversed graph, confirming an initial position when the target profile is printed according to the target point, and radiating outside the currently traversed graph according to a preset radiation distance by taking the initial position as a radiation point to generate a skirt edge.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the skirt generating method of a starting position according to any one of claims 1 to 7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the skirt generating method of a starting position according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110745073.3A CN113352619B (en) | 2021-06-30 | 2021-06-30 | Skirt edge generation method and device for starting position, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110745073.3A CN113352619B (en) | 2021-06-30 | 2021-06-30 | Skirt edge generation method and device for starting position, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113352619A CN113352619A (en) | 2021-09-07 |
| CN113352619B true CN113352619B (en) | 2022-11-11 |
Family
ID=77537772
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110745073.3A Active CN113352619B (en) | 2021-06-30 | 2021-06-30 | Skirt edge generation method and device for starting position, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113352619B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115139528B (en) * | 2022-06-10 | 2024-04-16 | 深圳市纵维立方科技有限公司 | Slice processing method and device in 3D printing, storage medium and electronic equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| NL2018728B1 (en) * | 2017-04-18 | 2018-10-29 | Stephan Schuermann Holding B V | A gantry-type three dimensional printing apparatus for printing a three dimensional work piece in a layer wise manner. |
| CN112140532A (en) * | 2020-08-08 | 2020-12-29 | 华融普瑞(北京)科技有限公司 | Novel manufacturing process of PC-ABS (polycarbonate-acrylonitrile butadiene styrene) automobile interior trim part |
-
2021
- 2021-06-30 CN CN202110745073.3A patent/CN113352619B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113352619A (en) | 2021-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dai et al. | Support-free volume printing by multi-axis motion | |
| US7436407B2 (en) | Topology determination, decomposable shape generation, and structured mesh generation | |
| KR102024078B1 (en) | Slicing and/or texturing for three-dimensional printing | |
| CN103093036B (en) | Work pieces process emulation | |
| JP4381743B2 (en) | Method and program for generating volume data from boundary representation data | |
| CN113591300B (en) | Method, device, computer equipment and storage medium for generating 3D printing file | |
| CN113352619B (en) | Skirt edge generation method and device for starting position, computer equipment and storage medium | |
| CN113715338A (en) | Three-dimensional model slicing method, printing method and related equipment | |
| CN113580577A (en) | 3D printing file generation method and device, computer equipment and storage medium | |
| JP3557839B2 (en) | How to create mesh data on a curved surface | |
| CN113010960B (en) | Method and device for generating part manufacturing control data and computer equipment | |
| US11416655B2 (en) | Analysis mesh generation method, recording medium, and analysis mesh generation device | |
| Bo et al. | Support fast generation algorithm based on discrete‐marking in stereolithgraphy rapid prototyping | |
| JPH07254075A (en) | Method for deforming three-dimensional object and modeling system | |
| JP2007172180A (en) | Design data generation device and design data generation program | |
| JP2002207777A (en) | Method for generating neutral plane model | |
| CN113752561A (en) | 3D printing file generation method and device, computer equipment and storage medium | |
| CN110717291B (en) | Welding structure deformation simulation method, device, equipment and storage medium | |
| CN113844034A (en) | Three-dimensional model punching processing method, printing method, related equipment and storage medium | |
| JP3550949B2 (en) | Modeling method for press forming analysis | |
| JP2011079105A (en) | Method, device and program for interference check | |
| CN112464388A (en) | Parameterization method and device for free deformation of windward side of lifting body | |
| JPH07302356A (en) | Method and device for preparing free curved surface | |
| JP2007172181A (en) | Design data creation device and design data generation program | |
| JP6823412B2 (en) | Manufacturing method of 3D model |
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 |