CN104331555A - Slicing processing method aiming at non-closed STL model with boundaries - Google Patents
Slicing processing method aiming at non-closed STL model with boundaries Download PDFInfo
- Publication number
- CN104331555A CN104331555A CN201410605438.2A CN201410605438A CN104331555A CN 104331555 A CN104331555 A CN 104331555A CN 201410605438 A CN201410605438 A CN 201410605438A CN 104331555 A CN104331555 A CN 104331555A
- Authority
- CN
- China
- Prior art keywords
- fragment
- steps
- boundary edge
- limit
- triangle
- 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.)
- Granted
Links
Landscapes
- Processing Or Creating Images (AREA)
- Image Generation (AREA)
Abstract
The invention discloses a slicing processing method aiming at a non-closed STL model with boundaries for a 3D (three-dimensional) printer. The method comprises the following steps that point, edge and surface information of triangles in an STL model are extracted, and in addition, the topology relationship among the point, edge and surface information is built; all boundary edges are extracted according to the boundary edge judging rule; lamination slicing processing is carried out on non-closed lattices to obtain non-closed 2D polygons; printable inner and outer contour lines obtained after the deflection processing on the polygons are subjected to path optimization for reducing idle strokes; a slicing file is used for outputting universal Gcode files which are read and printed by the 3D printer. The invention provides the slicing method aiming at non-closed STL model input from the boundary extraction aspect for the first time, and breaks through the limitation that the traditional 3D printer can only carry out the slicing processing on the closed STL model, and the slicing processing on the non-closed STL model with the boundaries is realized, so that the non-closed STL model can be directly printed and formed.
Description
Technical field
The present invention relates to computer integrated manufacturing system field, be specifically related to a kind of sliced sheet processing method for the non-close STL model with border.
Background technology
3D printing technique is one and has frontier nature, guiding emerging technology, is specially adapted to short run, personalization, complex structure, the manufacturing of starting material costliness.Along with the development of 3D printing technique, will there is deep change in traditional mode of production and production technology, the industries such as design, building, space flight, medical science, education also will be subject to far-reaching influence.3D printing technique is called by " economist " magazine for 2012 " important symbol of the third time industrial revolution ", thinks that it is the important opportunity promoting the new round industrial revolution, has caused global extensive concern.
Fusion sediment type (Fused Deposition Modeling) three-dimensional printing technology is the one of 3D printing technique, adopts discrete/accumulation principle, under control of the computer three-dimensional model is directly manufactured 3D solid.Ultimate principle heats shower nozzle under control of the computer, by thermoplastic, polymeric materials heat fused, makes it extrude from nozzle in the molten state, extrude the self-adhesive successively stack shaping of a material by high temperature.Wherein, the task of computer disposal is: the transmission of slicing treatment and instruction.Slicing treatment is that friendship is asked in the layering of STL grid model, to obtain the two-dimensional silhouette that can print, then reasonably plans printing path.Instruction transmission is that this action is sent to hardware, and provides the control inerface controlling other functions.The commercialization 3D Printing software of main flow, as Slic3r, Makeware etc. are integrated with this two large functional module, wherein most crucial is slicing treatment module (slice engine), and the Slicing Algorithm for STL model is then the key of slicing treatment.
Existing slicing treatment algorithm requires that the model of input must be closed triangle gridding, directly cannot carry out slicing treatment to nonocclusive triangle gridding.But in actual applications, some is by scanning, modeling and editor and amended model, if the partial model etc. after cloth, blade, segmentation is all that non-close STL (STereo Lithography) model of a class with border is for being input as nonocclusive STL model, directly slicing treatment is carried out to it, the section file generated can actually print, and this is significant for the popularization and application promoting 3 D-printing.
Summary of the invention
In order to the problem that the model solving existing slicing treatment algorithm restriction input must be closed triangle gridding, the invention provides a kind of sliced sheet processing method for the non-close STL model with border, make slicing treatment can generate nonocclusive planar polygons by Boundary Extraction, and according to the shaping characteristic of non-close STL model to the internal and external contour line Zuo Liao path optimization after planar polygons bias treatment, to improve shaping efficiency.
The technical scheme that the present invention takes is as follows:
For a sliced sheet processing method for the non-close STL model with border, comprise the following steps:
Step 1, the point extracting STL model intermediate cam shape dough sheet, limit and surface information, and set up point, topological relation between limit and surface information;
The data structure composition in the point of topological relation, limit and face is respectively:
Point data structure comprises the index value in point coordinate and the face adjacent with point;
Face data structure comprises the index value of abutment points and the index value of adjacent surface;
Limit data structure comprises the index value of the index value on limit, the adjacent surface index value on limit and two abutment points.
Step 2, utilize topological relation, extract all boundary edge of STL model according to boundary edge judgment rule;
1. travel through each bar limit of all triangle surfaces, according to the judgment rule of boundary edge, if the number of its adjacent tri patch of limit is 1, be boundary edge;
2. the data structure form of the boundary edge of all extractions by boundary edge is stored again, so that search and access.
Boundary Extraction rule is:
If triangle mesh curved surface is M=(v
i, v
j... v
n), any summit in M is v
i=(x
i, y
i, z
i), if the limit edge (v that certain two summit in triangle mesh curved surface M connect
i, v
j) be certain tri patch Δ v
iv
jv
klimit, then claim limit edge (v
i, v
j) be Δ v
iv
jv
kadjacent side.With L (v
i, v
j) represent all and comprise limit edge (v
i, v
j) the set of tri patch.For limit edge (v
i, v
j), the number of its adjacent tri patch is used | L (v
i, v
j) | represent.If the adjacent leg-of-mutton number one associated by limit is 1, then this limit is boundary edge.If the adjacent leg-of-mutton number one associated by limit is 2, be then referred to as inner edge.Meanwhile, 2 summits of boundary edge are frontier point, and the triangle having 1 or two frontier point is referred to as edge triangles.
The expression formula of Boundary Extraction rule is:
BoundaryEdge： {edge(v
i,v
j)|if:|L(v
i,v
j)|＝1}，
Wherein x
i, y
i, z
ifor vertex v
icoordinate; v
i, v
j... v
npoint on representation space intermediate cam grid model;
Limit edge (v
i, v
j) be Δ v
iv
jv
kadjacent side, L (v
i, v
j) represent all and comprise limit edge (v
i, v
j) the set of tri patch, | L (v
i, v
j) | represent the number of its adjacent tri patch, if the number of its adjacent tri patch of limit is 1, be boundary edge.
Step 3, hierarchy slicing process is carried out to non-close grid, obtains nonocclusive planar polygons, specifically comprise the following steps:
1. the total number of plies n of section of model and all slice plane z is obtained according to section precision
i(i=1,2 ... n);
2. a triangle surface of STL model is read, according to the maximal value z of this triangle each point z coordinate
max, minimum value z
minand section precision, K slice plane z of reverse and triangle intersect
j, 1≤j≤n;
3. the slice plane section fragment crossing with triangle surface is obtained, for the interpolation of section fragment is used to indicate the indication information of fragment summit whether in boundary edge of cutting into slices: read a crossing slice plane z
jand calculate intersection point, obtain one and belong to this leg-of-mutton section fragment (line segment that slice plane is crossing with triangle surface needs to set up fragment data structure), for this section fragment adds indication information BorderFlag.According to this leg-of-mutton dough sheet index, search in boundary edge set and whether there is boundary edge and belong to this tri patch.If exist, then calculate and whether have fragment summit in boundary edge, in boundary edge, then BorderFlag is set to True, be not then set to False.If do not exist, then BorderFlag is directly set to False;
Wherein, obtain section fragment to comprise the following steps:
A by fabrication orientation Z and leg-of-mutton method, the direction D of () section fragment vows that the vector product of N is determined:
D＝Z×N
Wherein, Z is fabrication orientation, and N is that the method for triangle surface is vowed;
Section fragment summit is linked in sequence formation planar polygons successively, and planar polygons (planar polygons outline line) is slice plane and the triangle grid model crossing polygonal profile formed afterwards in space.
The calculating of (b) layered plane (slice plane) and triangle surface intersection point:
P(t)＝p+t(q-p)，t∈[0,1]
Wherein, Z=h is layered plane height, p=(x
p, y
p, z
p), q=(x
q, y
q, z
q) be two summits on a triangle limit, z
qp=(x is put under representing cartesian space coordinate system
p, y
p, z
p) Z coordinate; z
pq=(x is put under representing cartesian space coordinate system
q, y
q, z
q) Z coordinate.
Layered plane and the intersection point of triangle surface are the crossing point of slice plane and each tri patch.
C after () triangle intersection, the data structure of gained section fragment is:
Section fragment data structure comprises fragment starting point, face index, fragment whether has added polygon and border piece segment mark is shown.
4. 3. recording step cuts into slices the triangle surface index information belonging to fragment, and traversal obtains all section fragments of K slice plane and triangle surface: if K slice plane and this tri patch to ask friendship all to calculate complete, then perform next step; Otherwise turn 2., read plane that is next and this triangle intersect;
5. by all crossing section fragment of layer storage slice plane with triangle surface: all crossing section fragment storing this triangle surface by layer, and turn 1.; If all triangle surfaces all ask friendship to be disposed, then turn next step;
6. travel through the indication information of all section fragments, obtain the initial tie point of planar polygons: all section fragments (from i=0) of reading i-th=i+1 layer, judge whether to have in this layer BorderFlag to be the fragment of True.If exist, then taking out first, outline line direction BorderFlag is the fragment of True, and is set to by tri patch belonging to this fragment and works as front piece; If no, represent that this layer is closed, take out any one section fragment on outline line direction, and tri patch belonging to this fragment is set to works as front piece;
7. judge whether adjacent surface exists section fragment: read an adjacent surface when front piece, judge whether this adjacent surface exists the fragment of i-th layer.If do not exist, directly turn 8.; If exist, then judge whether this fragment has joined in polygon.If joined in polygon, then turn 8.; If do not join in polygon, then this fragment is added in polygon, and this dough sheet is set to works as front piece, turns 9.;
8. travel through all of its neighbor face and whether there is section fragment; Judge whether adjacent surface travels through complete, if do not travel through complete, then turn 7.; If travel through complete, then turn next step;
9. certain one deck section fragment the multiple paired appearance in summit in boundary edge time, be really the cut into slices triangle surface at fragment place with indication information be that initial dough sheet connects planar polygons: judge that in this adjacent surface, whether fragment indication information BorderFlag is for True.If not True, then perform next step; If True, then judge whether outline line direction exists the fragment of next BorderFlag=True.If exist, this fragment is set to and works as front piece, and turn 7.; If do not exist, then perform next step;
10. travel through all slicing layers, every layer forms a planar polygons: judge whether to have traveled through this layer of all fragment.If do not travel through complete, then turn 7.; If travel through complete, then store this layer of all non-close polygon or closed polygon.Judge whether i≤n, if then turn 6., otherwise algorithm terminates.
Step 4, carry out path optimization to the printable internal and external contour line after polygon bias treatment, to reduce idle motion, method comprises the following steps:
1. utilize the polygon of polygon bias treatment storehouse to the two dimension generated to carry out polygon bias treatment (Offset), generate printable Internal periphery and outline;
2. carry out excellent stroke of path to the printable Internal periphery generated and outline, wherein the strategy of path optimization is:
A. in same layer, adjacent wheels profile direction of scanning is contrary;
B. the order of adjacent layer contour scanning is contrary;
C. adjacent layer same profile scan direction is contrary.
Step 5, by the general Gcode file of section file output, read for 3D printer and print.
More preferably, the data structure of step 2, boundary edge consists of: the data structure of boundary edge comprises: the index value of boundary edge one endvertex, the index value on boundary edge other end summit, affiliated dough sheet index.
More preferably, the data structure of the of step 3 the crossing section fragment stored by layer 5. walked comprises the set of segments of every layer and fragment and corresponding face index.
Present invention employs the dicing method based on topology information, solve a kind of slicing treatment problem of the non-close STL model with border from the angle of boundary information extraction, having broken existing slicing treatment algorithm can only for the limitation of closed STL model slice process.The present invention, also from the angle that improve shaping efficiency, adopts the profile scan strategy being different from closed STL model, and the shaping characteristic for the non-close STL model on band border has done the path optimization of contour scanning.The present invention had both solved the slicing treatment problem of non-close STL model, improve shaping efficiency again from practical application angle, and this has important value for the popularization and application promoting 3 D-printing.
The present invention, according to the information of the boundary edge of STL model, carries out hierarchy slicing process in conjunction with the dicing method based on topological relation information to non-close grid, obtains nonocclusive planar polygons; By to the section of STL model layers, travel through the section fragment that iteration obtains all layers, and connect the section fragment of every layer by outline line direction
Accompanying drawing explanation
Fig. 1 is a kind of sliced sheet processing method schematic flow sheet for the non-close STL model with border of the present invention;
The point data structural representation of Fig. 2 (a) topological relation;
The face data structure schematic diagram of Fig. 2 (b) topological relation;
The limit data structure schematic diagram of Fig. 2 (c) topological relation;
Fig. 3 is the data structure diagram describing boundary edge;
Fig. 4 is the schematic diagram of frontier point and boundary edge;
Fig. 5 is the process flow diagram of hierarchy slicing algorithm;
Fig. 6 is the demonstration graph of planar polygons generative process in hierarchy slicing;
The demonstration graph of the outline line that Fig. 7 (a) slice plane is crossing with triangle surface;
The schematic diagram in the outline line direction that Fig. 7 (b) slice plane is crossing with triangle surface;
Fig. 8 (a) is the demonstration graph that in path optimization's strategy same layer, order backward alternately combines;
Fig. 8 (b) is the demonstration graph of the scanning result of path optimization's strategy adjacent layer;
Fig. 9 is printing test result exploded view actual after slicing treatment: (a) is the front exploded view printed based on closed model, b () is the reverse side exploded view printed based on closed model, (c) is for the present invention is directed to the front exploded view of the slicing treatment of the non-close STL model with border; D () is for the present invention is with the reverse side exploded view of the slicing treatment of the non-close STL model on border.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.
Below in conjunction with accompanying drawing, the present invention will be further described.
As shown in Figure 1, a kind of sliced sheet processing method for the non-close STL model with border, comprises the following steps:
Step 1, input STL model, extract the point of STL model intermediate cam shape, limit and surface information and the topological relation set up therebetween, the data structure such as Fig. 2 (a), 2 (b), 2 (c) that describe topology information show; State the point of topological relation, the data structure composition in limit and face is respectively: point data structure comprises the index value faceIndexList in point coordinate vertice and the face adjacent with point; Face data structure comprises index value touching [0], touching [1], the touching [2] of index value index [0], the index [1] of abutment points, index [2] and adjacent surface; Limit data structure comprises index value AdjacentVertice [0], the AdjacentVertice [1] of the index value Edgeindex on limit, adjacent surface index value AdjacentFace [0], the AdjacentFace [1] on limit and two abutment points.
The data structure in the point of topological relation, limit and face is
Step 2, extracts all boundary edge of model according to border judgment rule, describe the data structure of boundary edge as shown in Figure 3, the method for Boundary Extraction is as follows:
1. travel through each bar limit of all triangle surfaces, according to the judgment rule of boundary edge, if the number of its adjacent tri patch of limit is 1, be boundary edge;
2. the data structure form of the boundary edge of all extractions by boundary edge is stored again, so that search and access.
As shown in Figure 4, the relation of frontier point and boundary edge, fillet point forms boundary edge, and Boundary Extraction rule is:
If triangle mesh curved surface is M=(v
i, v
j... v
n), any summit in M is v
i=(x
i, y
i, z
i), if the limit edge (v that certain two summit in triangle mesh curved surface M connect
i, v
j) be certain tri patch Δ v
iv
jv
klimit, then claim limit edge (v
i, v
j) be Δ v
iv
jv
kadjacent side.With L (v
i, v
j) represent all and comprise limit edge (v
i, v
j) the set of tri patch.For limit edge (v
i, v
j), the number of its adjacent tri patch is used | L (v
i, v
j) | represent.If the adjacent leg-of-mutton number one associated by limit is 1, then this limit is boundary edge.If the adjacent leg-of-mutton number one associated by limit is 2, be then referred to as inner edge.Meanwhile, 2 summits of boundary edge are frontier point, and the triangle having 1 or two frontier point is referred to as edge triangles.
Boundary Extraction regular expression is:
BoundaryEdge： {edge(v
i,v
j)|if:|L(v
i,v
j)|＝1}，
Wherein x
i, y
i, z
ifor vertex v
icoordinate; v
i, v
j... v
npoint on representation space intermediate cam grid model;
Limit edge (v
i, v
j) be Δ v
iv
jv
kadjacent side, L (v
i, v
j) represent all and comprise limit edge (v
i, v
j) the set of tri patch, | L (v
i, v
j) | represent the number of its adjacent tri patch.
The data structure of boundary edge is:
Step 3, according to the information of the boundary edge of STL model, in conjunction with the dicing method based on topological relation information, hierarchy slicing process is carried out to non-close grid, obtain nonocclusive planar polygons, as shown in Figure 5 hierarchy slicing process is carried out to non-close grid, obtain nonocclusive planar polygons, the process of the generation of planar polygons as shown in Figure 6; Specifically comprise the following steps:
1. the total number of plies n of section of model and all slice plane z is obtained according to section precision
i(i=1,2 ... n);
2. a triangle surface of STL model is read, according to the maximal value z of this triangle each point z coordinate
max, minimum value z
minand section precision, K slice plane z of reverse and triangle intersect
j, 1≤j≤n;
3. the slice plane section fragment crossing with triangle surface is obtained, for the interpolation of section fragment is used to indicate the indication information of fragment summit whether in boundary edge of cutting into slices: read a crossing slice plane z
jand calculate intersection point, obtain one and belong to this leg-of-mutton fragment (needing to set up fragment data structure), for this fragment adds indication information BorderFlag.According to this leg-of-mutton dough sheet index, search in boundary edge set and whether there is boundary edge and belong to this tri patch.If exist, then calculate and whether have fragment summit in boundary edge, in boundary edge, then BorderFlag is set to True, be not then set to False.If do not exist, then BorderFlag is directly set to False;
Wherein, obtain section fragment to comprise the following steps:
A by fabrication orientation Z and leg-of-mutton method, the direction D of () described section fragment vows that the vector product of N is determined:
D＝Z×N
Wherein, Z is fabrication orientation, and N is that the method for triangle surface is vowed;
Section fragment summit is linked in sequence formation planar polygons successively, and planar polygons (planar polygons outline line) is slice plane and the triangle grid model crossing polygonal profile formed afterwards in space.
The calculating of (b) layered plane (slice plane) and triangle surface intersection point:
P(t)＝p+t(q-p)，t∈[0,1]
Wherein, Z=h is layered plane height, p=(x
p, y
p, z
p), q=(x
q, y
q, z
q) be two summits on a triangle limit.
As shown in Fig. 7 a, 7b, layered plane and the intersection point of triangle surface are the crossing point of slice plane and each tri patch.
C after () triangle intersection, the data structure of gained section fragment is:
Described section fragment data structure comprises fragment starting point, face index, fragment whether has added polygon and border piece segment mark is shown.
The i.e. data structure of gained fragment after triangle intersection:
4. the triangle surface index information of recording step 3. belonging to described section fragment, traversal obtains all section fragments of K slice plane and described triangle surface: if K slice plane and this tri patch to ask friendship all to calculate complete, then perform next step; Otherwise turn 2., read plane that is next and this triangle intersect;
5. store all crossing section fragment of triangle surface by layer: all crossing section fragment storing this triangle surface by layer, and turn 1.; If all triangle surfaces all ask friendship to be disposed, then turn next step;
The data structure of fragment is handed over to comprise the set of segments of every layer and fragment and corresponding face index by asking of storing of layer.Namely the data structure stored by layer is:
6. travel through the indication information of all section fragments, obtain the initial tie point of planar polygons: all section fragments (from i=0) of reading i-th=i+1 layer, judge whether to have in this layer BorderFlag to be the fragment of True.If exist, then taking out first, outline line direction BorderFlag is the fragment of True, and is set to by tri patch belonging to this fragment and works as front piece; If no, represent that this layer is closed, take out any one fragment on outline line direction, and tri patch belonging to this fragment is set to works as front piece;
7. judge whether adjacent surface exists section fragment: read an adjacent surface when front piece, judge whether this adjacent surface exists the fragment of i-th layer.If do not exist, directly turn 8.; If exist, then judge whether this fragment has joined in polygon.If joined in polygon, then turn 8.; If do not join in polygon, then this fragment is added in polygon, and this dough sheet is set to works as front piece, turns 9.;
8. travel through all of its neighbor face and whether there is section fragment; Judge whether adjacent surface travels through complete, if do not travel through complete, then turn 7.; If travel through complete, then turn next step;
9. certain one deck section fragment the multiple paired appearance in summit in boundary edge time, be really the cut into slices triangle surface at fragment place with indication information be that initial dough sheet connects planar polygons: judge that in this adjacent surface, whether fragment indication information BorderFlag is for True.If not True, then perform next step; If True, then judge whether outline line direction exists the fragment of next BorderFlag=True.If exist, this fragment is set to and works as front piece, and turn 7.; If do not exist, then perform next step;
10. travel through all slicing layers, every layer forms a planar polygons: judge whether to have traveled through this layer of all fragment.If do not travel through complete, then turn 7.; If travel through complete, then store this layer of all non-close polygon or closed polygon.Judge whether i≤n, if then turn 6., otherwise algorithm terminates.
Step 4, carries out path optimization to the printable internal and external contour line after polygon bias treatment, and to reduce idle motion, as shown in Fig. 8 (a), 8 (b), the method for path optimization is as follows:
1. in same layer, adjacent wheels profile direction of scanning is contrary;
2. the order of adjacent layer contour scanning is contrary
3. adjacent layer same profile scan direction is contrary.
Step 5, export Gcode and print, printing test result exploded view actual after slicing treatment as shown in Figure 9: (a) is the front exploded view printed based on closed model, b () is the reverse side exploded view printed based on closed model, (c) is for the present invention is directed to the front exploded view of the slicing treatment of the non-close STL model with border; D () is for the present invention is with the reverse side exploded view of the slicing treatment of the non-close STL model on border, can find out, figure (a) and figure (b) is closed printing, time-write interval is of a specified duration, efficiency is low, the figure (c) that the present invention prints, figure (d) pro and con are that non-close prints, and printing effect is high, saves material.
The inventive method is by based on based on the sliced sheet processing method of topology information, from the angle of Boundary Extraction, solving the direct slicing process problem of non-close STL model for being input as band border, to make in practical application a lot of non-close STL model can direct slicing process also actual printing shaping expeditiously.
Those skilled in the art can change the present invention or modification design but do not depart from thought of the present invention and scope.Therefore, if these amendments of the present invention and modification belong within the claims in the present invention and equivalent technical scope thereof, then the present invention is also intended to comprise these change and modification.
Claims (9)
1., for a sliced sheet processing method for the non-close STL model with border, it is characterized in that, comprise the following steps,
Steps A 1, extracts the point of STL model intermediate cam shape dough sheet, limit and surface information, and sets up described point, topological relation between limit and surface information;
Steps A 2, utilizes described topological relation, extracts all boundary edge of STL model according to boundary edge judgment rule;
Steps A 3, according to the information of the boundary edge of STL model, carries out hierarchy slicing process in conjunction with the dicing method based on topological relation information to non-close grid, obtains nonocclusive planar polygons;
Steps A 4, makes polygon bias treatment to described nonocclusive planar polygons, obtains inner outline and outer contour, carries out path optimization, to reduce idle motion to inner outline and outer contour;
Steps A 5, by the general print file of section file output, read for 3D printer and print.
2. a kind of sliced sheet processing method for the non-close STL model with border according to claim 1, is characterized in that, the data structure composition in the point of topological relation described in steps A 1, limit and face is respectively:
The index value in face that point data structure comprises point coordinate and adjoins with described point;
Face data structure comprises the index value of abutment points and the index value of adjacent surface;
Limit data structure comprises the index value of the index value on limit, the adjacent surface index value on limit and two abutment points.
3. a kind of sliced sheet processing method for the non-close STL model with border according to claim 1, it is characterized in that, the Boundary Extraction rule described in steps A 2 is:
If triangle mesh curved surface is M=(v
i, v
j... v
n), any summit in M is v
i=(x
i, y
i, z
i), if the limit edge (v that certain two summit in triangle mesh curved surface M connect
i, v
j) be tri patch Δ v
iv
jv
klimit, then limit edge (v
i, v
j) be Δ v
iv
jv
kadjacent side; With L (v
i, v
j) represent all and comprise limit edge (v
i, v
j) the set of tri patch; Limit edge (v
i, v
j) adjacent tri patch number use | L (v
i, v
j) | represent; If the adjacent leg-of-mutton number one associated by limit is 1, shown limit is boundary edge; If the adjacent leg-of-mutton number one associated by limit is 2, be then inner edge, and two of boundary edge summits are frontier point, the triangle surface having one or two frontier point is edge triangles;
The expression formula of described border judgment rule is:
BoundaryEdge：{edge(v
i,v
j)|if:|L(v
i,v
j)|＝1}；
Wherein x
i, y
i, z
ifor vertex v
icoordinate; v
i, v
j... v
npoint on representation space intermediate cam grid model.
4. a kind of sliced sheet processing method for the non-close STL model with border according to claim 1, it is characterized in that, steps A 2 specifically comprises the following steps:
Steps A 21, travel through each bar limit of all triangle surfaces, according to the judgment rule of boundary edge, if the number of the adjacent tri patch on a limit is 1, described limit is boundary edge;
Steps A 22, the data structure form of the boundary edge of all extractions by boundary edge to be stored again, so that search and access.
5. a kind of sliced sheet processing method for the non-close STL model with border according to right 4, it is characterized in that, the data structure of the boundary edge described in steps A 22 consists of:
The data structure of boundary edge comprises: the index value of boundary edge one endvertex, the index value on boundary edge other end summit, affiliated triangle surface index.
6. a kind of sliced sheet processing method for the non-close STL model with border according to right 4, it is characterized in that, steps A 3 specifically comprises the following steps:
Steps A 31, according to section precision obtain the total number of plies n of section of STL model and all slice plane z
i(i=1,2 ... n);
A triangle surface of steps A 32, reading STL model, according to the maximal value z of described triangle surface each point z coordinate
max, minimum value z
minwith section precision, K slice plane z of reverse and triangle intersect
j, 1≤j≤n;
Steps A 33, obtain the slice plane section fragment crossing with triangle surface, for the interpolation of section fragment is used to indicate the indication information of fragment summit whether in boundary edge of cutting into slices: read a slice plane z
jand calculate the intersection point of slice plane and triangle surface, obtain the section fragment that belongs to described triangle surface, for described section fragment adds indication information BorderFlag; According to the dough sheet index of described triangle surface, search in boundary edge set and whether there is boundary edge and belong to triangle surface; If exist, then calculate and whether have section fragment summit in boundary edge, in boundary edge, then indication information BorderFlag is set to True, if do not cut into slices fragment summit in boundary edge, is then set to False; If there is not boundary edge in boundary edge set to belong to triangle surface, then BorderFlag is directly set to False;
The triangle surface index information of cutting into slices described in steps A 34, recording step A33 belonging to fragment, traversal obtains all section fragments of K slice plane and described triangle surface: if K slice plane and described triangle surface to ask friendship all to calculate complete, then execution steps A 35; Otherwise go to step A32, read next crossing with described triangle surface plane successively;
Steps A 35, store all crossing section fragment of slice plane and triangle surface by layer;
Steps A 36, travel through the indication information of all section fragments, obtain the initial tie point of planar polygons:
All section fragments of each slicing layer, judge every layer by layer in whether have BorderFlag to be the section fragment of True; If exist, then taking out first, outline line direction BorderFlag is the section fragment of True, and is set to by triangle surface belonging to described section fragment and works as front piece; If no, represent that this layer is closed, take out any one fragment on outline line direction, and tri patch belonging to this fragment is set to works as front piece, for the treatment of the curved surface figure closed;
Steps A 37, judge whether adjacent surface exists section fragment;
Whether steps A 38, traversal all of its neighbor face exist section fragment;
The multiple paired appearance in summit of steps A 39, certain one deck section fragment in boundary edge time, be really the cut into slices triangle surface at fragment place with indication information be that initial dough sheet connects into planar polygons;
Steps A 310, travel through all slicing layers, every layer forms a planar polygons.
7. a kind of sliced sheet processing method for the non-close STL model with border according to right 6, obtains section fragment and comprises following content described in steps A 33:
1. by fabrication orientation Z and leg-of-mutton method, the direction D of described section fragment vows that the vector product of N is determined:
D＝Z×N
Wherein, Z is fabrication orientation, and N is that the method for triangle surface is vowed;
2. the calculating of slice plane and triangle surface intersection point:
P(t)＝p+t(q-p)，t∈[0,1]
Wherein, Z=h is layered plane height, p=(x
p, y
p, z
p), q=(x
q, y
q, z
q) be two summits on a triangle limit; z
qp=(x is put under representing cartesian space coordinate system
p, y
p, z
p) Z coordinate; z
pq=(x is put under representing cartesian space coordinate system
q, y
q, z
q) Z coordinate;
3. the data structure of gained fragment after triangle intersection:
Described fragment data structure comprises fragment starting point, face index, fragment whether has added polygon and border piece segment mark is shown.
8. a kind of sliced sheet processing method for the non-close STL model with border according to right 6, the data structure of the section fragment that the slice plane described in steps A 35 is crossing with triangle surface comprises the set of segments of every layer and fragment and corresponding face index.
9. a kind of sliced sheet processing method for the non-close STL model with border according to right 1, described in described steps A 4, the strategy of path optimization comprises:
In same layer, adjacent wheels profile direction of scanning is contrary;
The order of adjacent layer contour scanning is contrary;
Adjacent layer same profile scan direction is contrary.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410605438.2A CN104331555B (en) | 2014-10-31 | 2014-10-31 | A kind of sliced sheet processing method for being directed to the non-close STL models with border |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410605438.2A CN104331555B (en) | 2014-10-31 | 2014-10-31 | A kind of sliced sheet processing method for being directed to the non-close STL models with border |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104331555A true CN104331555A (en) | 2015-02-04 |
| CN104331555B CN104331555B (en) | 2017-07-14 |
Family
ID=52406280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410605438.2A Expired - Fee Related CN104331555B (en) | 2014-10-31 | 2014-10-31 | A kind of sliced sheet processing method for being directed to the non-close STL models with border |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104331555B (en) |
Cited By (40)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104690976A (en) * | 2015-03-25 | 2015-06-10 | 英华达（上海）科技有限公司 | Line printing method and system of three-dimensional line printer |
| CN104890236A (en) * | 2015-04-03 | 2015-09-09 | 杭州先临三维科技股份有限公司 | Stereo lithography rapid moulding scanning-path ordering method for 3D printing |
| CN105045205A (en) * | 2015-07-24 | 2015-11-11 | 广东工业大学 | Cutter position path generation method based on triangle mesh offset compensation and numerical control processing system thereof |
| CN105184868A (en) * | 2015-09-01 | 2015-12-23 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Triangular surface grid generation method based on three-dimensional entity model |
| CN105550468A (en) * | 2016-01-18 | 2016-05-04 | 沈阳工业大学 | Equal-layer-thickness slicing algorithm based on layer variable-edge array and adjacent edge sequence chain table |
| CN105653773A (en) * | 2015-12-28 | 2016-06-08 | 西安交通大学 | Repairing method of prism and lens compound eyeglass STL (Standard Template Library) model suitable for 3D (Three-dimensional) printing |
| CN106363621A (en) * | 2015-07-21 | 2017-02-01 | 南京中科川思特软件科技有限公司 | Method for generating whole route of robot laser cutting |
| CN106600710A (en) * | 2016-10-18 | 2017-04-26 | 浙江大学 | Layered machining multi-connected-domain construction method of adjacency topological correlation of geometric network model |
| CN106738864A (en) * | 2016-11-17 | 2017-05-31 | 西安电子科技大学 | A kind of sliced sheet processing method of surface model surface inkjet printing |
| CN107067471A (en) * | 2017-05-10 | 2017-08-18 | 河海大学常州校区 | A kind of adaptive scanning speed method for improving pendant body model forming quality |
| CN107403469A (en) * | 2017-08-10 | 2017-11-28 | 河海大学常州校区 | A kind of adaptive scanning speed method for improving knuckle Forming Quality |
| CN107584757A (en) * | 2017-10-30 | 2018-01-16 | 宁夏共享模具有限公司 | The Method of printing of product profile in a kind of FDM printings |
| CN108057888A (en) * | 2017-12-15 | 2018-05-22 | 佛山租我科技有限公司 | Connection rod of automobile engine laser 3D printing technique |
| CN108215174A (en) * | 2016-12-09 | 2018-06-29 | 珠海赛纳打印科技股份有限公司 | A kind of 3D objects inkjet printing methods and system |
| CN109155075A (en) * | 2016-05-12 | 2019-01-04 | 惠普发展公司，有限责任合伙企业 | It is adapted to 3D printing file |
| CN109228353A (en) * | 2018-08-06 | 2019-01-18 | 上海大学 | A kind of Dynamic Slicing algorithm without support 3D printing method |
| CN109325316A (en) * | 2018-11-15 | 2019-02-12 | 南京理工大学 | STL model efficient parallel based on concurrent welding sequence cuts layer method |
| CN109394410A (en) * | 2018-11-13 | 2019-03-01 | 武汉必盈生物科技有限公司 | Based on the personalized outer fixed 3D printing model design method of patient and slice systems |
| CN109523074A (en) * | 2018-11-14 | 2019-03-26 | 浙江工业大学 | A kind of tailoring method for optimizing route based on arest neighbors Genetic Hybrid Algorithm |
| CN109822478A (en) * | 2019-03-19 | 2019-05-31 | 苏州润智和智能科技有限公司 | A kind of comprehensive detection system and method for automobile axial workpiece |
| CN109887052A (en) * | 2019-01-29 | 2019-06-14 | 广联达科技股份有限公司 | A kind of planar polygons offset method |
| CN109934923A (en) * | 2017-12-15 | 2019-06-25 | 中国科学院沈阳自动化研究所 | Model layers and track fill method suitable for biomaterial 3D printing |
| CN110210122A (en) * | 2019-05-30 | 2019-09-06 | 华南理工大学 | A kind of boundary coloring width confining method of Cont of Color Slice layer |
| CN110232742A (en) * | 2019-06-12 | 2019-09-13 | 洁誉科技（上海）股份有限公司 | 3D printing hierarchical control algorithm |
| CN110442994A (en) * | 2019-08-13 | 2019-11-12 | 嘉兴学院 | A kind of 3D printing sliced sheet processing method based on graph theory |
| CN110544255A (en) * | 2019-07-26 | 2019-12-06 | 山东大学 | method and system for segmenting triangular mesh holes for 3D printing |
| CN110945568A (en) * | 2017-05-08 | 2020-03-31 | 菲兹纳股份有限公司 | System and method for evaluating 3D models |
| CN111710022A (en) * | 2020-06-08 | 2020-09-25 | 嘉兴学院 | Rapid forming slice processing method for avoiding contour intersection |
| CN112069725A (en) * | 2020-08-03 | 2020-12-11 | 彭涛 | High-precision slice obtaining method and device for 3D printer |
| CN112085832A (en) * | 2020-08-12 | 2020-12-15 | 浙江闪铸三维科技有限公司 | Advertisement word 3D model generation method |
| CN112182677A (en) * | 2020-09-17 | 2021-01-05 | 上海漫格科技有限公司 | Interactive variable-layer thickness slicing method in three-dimensional printing |
| CN112184911A (en) * | 2020-09-28 | 2021-01-05 | 嘉兴学院 | Non-popular grid model slice processing method |
| CN112659316A (en) * | 2020-12-17 | 2021-04-16 | 江苏集萃复合材料装备研究所有限公司 | Rapid layering method for 3D cement printing |
| CN113204213A (en) * | 2021-07-06 | 2021-08-03 | 广州中望龙腾软件股份有限公司 | Tool path generation method based on STL model, intelligent terminal and storage device |
| CN113715338A (en) * | 2021-08-30 | 2021-11-30 | 深圳市纵维立方科技有限公司 | Three-dimensional model slicing method, printing method and related equipment |
| CN114347482A (en) * | 2021-12-30 | 2022-04-15 | 浙江闪铸三维科技有限公司 | Method for positioning triangular patch in triangular mesh model hole |
| CN114842169A (en) * | 2022-05-05 | 2022-08-02 | 武汉理工大学 | Shell part contour path extraction method based on STL slicing algorithm |
| CN114986910A (en) * | 2022-04-24 | 2022-09-02 | 青岛理工大学 | Cylindrical surface layered 3D printing method for revolution structure |
| AT525686A1 (en) * | 2021-12-09 | 2023-06-15 | Mehmet Bugra Akin | Process for the additive manufacturing of a workpiece |
| CN116872500A (en) * | 2023-09-07 | 2023-10-13 | 苏州闪铸三维科技有限公司 | Method for realizing Z-axis compensation by generating and eliminating self-intersection |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0991332A (en) * | 1995-09-28 | 1997-04-04 | Toyota Motor Corp | Method and device for generating and correcting cross-section data |
| CN102298795A (en) * | 2011-08-10 | 2011-12-28 | 华侨大学 | Three-dimensional segmenting method for STL (Standard Template Library) triangular network model |
| CN103064343A (en) * | 2012-12-19 | 2013-04-24 | 华南理工大学 | Track generating method facing toward complex curved surface processing and track generating system thereof |
| CN103700144A (en) * | 2014-01-14 | 2014-04-02 | 河海大学常州校区 | Significance-based mesh-model 3D (three-dimensional) printing fragmenting method |
-
2014
- 2014-10-31 CN CN201410605438.2A patent/CN104331555B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0991332A (en) * | 1995-09-28 | 1997-04-04 | Toyota Motor Corp | Method and device for generating and correcting cross-section data |
| CN102298795A (en) * | 2011-08-10 | 2011-12-28 | 华侨大学 | Three-dimensional segmenting method for STL (Standard Template Library) triangular network model |
| CN103064343A (en) * | 2012-12-19 | 2013-04-24 | 华南理工大学 | Track generating method facing toward complex curved surface processing and track generating system thereof |
| CN103700144A (en) * | 2014-01-14 | 2014-04-02 | 河海大学常州校区 | Significance-based mesh-model 3D (three-dimensional) printing fragmenting method |
Non-Patent Citations (5)
| Title |
|---|
| 刘斌 等: "快速原型制造技术中实时切片算法的研究与实现", 《计算机辅助设计与图形学学报》 * |
| 杨光 等: "STL格式文件拓扑重建及快速切片算法研究", 《现代制造工程》 * |
| 陈有兰 等: "一种三角网格模型的边界提取快速算法", 《计算机工程》 * |
| 陈杰 等: "非封闭三角网格模型边界特征的自动识别", 《机械设计与制造》 * |
| 黄常标 等: "基于边界分割的STL模型三维分段", 《机械科学与技术》 * |
Cited By (67)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104690976B (en) * | 2015-03-25 | 2017-03-01 | 英华达（上海）科技有限公司 | The column printing method of three-dimensional printing machine and system |
| TWI637840B (en) * | 2015-03-25 | 2018-10-11 | 英華達股份有限公司 | Printing method of solid printer and system thereof |
| CN104690976A (en) * | 2015-03-25 | 2015-06-10 | 英华达（上海）科技有限公司 | Line printing method and system of three-dimensional line printer |
| CN104890236B (en) * | 2015-04-03 | 2017-06-13 | 杭州先临三维科技股份有限公司 | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing |
| CN104890236A (en) * | 2015-04-03 | 2015-09-09 | 杭州先临三维科技股份有限公司 | Stereo lithography rapid moulding scanning-path ordering method for 3D printing |
| CN106363621B (en) * | 2015-07-21 | 2019-01-04 | 南京中科川思特软件科技有限公司 | A kind of generation method of robotic laser cutting complete trails |
| CN106363621A (en) * | 2015-07-21 | 2017-02-01 | 南京中科川思特软件科技有限公司 | Method for generating whole route of robot laser cutting |
| CN105045205A (en) * | 2015-07-24 | 2015-11-11 | 广东工业大学 | Cutter position path generation method based on triangle mesh offset compensation and numerical control processing system thereof |
| CN105045205B (en) * | 2015-07-24 | 2017-12-26 | 广东工业大学 | A kind of cutter spacing path generating method and its digital-control processing system based on triangle gridding bias compensation |
| CN105184868A (en) * | 2015-09-01 | 2015-12-23 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Triangular surface grid generation method based on three-dimensional entity model |
| CN105653773B (en) * | 2015-12-28 | 2018-09-04 | 西安交通大学 | A kind of restorative procedure of rib lens compound eye eyeglass STL models suitable for 3D printing |
| CN105653773A (en) * | 2015-12-28 | 2016-06-08 | 西安交通大学 | Repairing method of prism and lens compound eyeglass STL (Standard Template Library) model suitable for 3D (Three-dimensional) printing |
| CN105550468B (en) * | 2016-01-18 | 2018-06-26 | 沈阳工业大学 | Based on layer become number of edges group and adjacent side sequence chained list etc. thickness dicing method |
| CN105550468A (en) * | 2016-01-18 | 2016-05-04 | 沈阳工业大学 | Equal-layer-thickness slicing algorithm based on layer variable-edge array and adjacent edge sequence chain table |
| CN109155075B (en) * | 2016-05-12 | 2023-07-11 | 惠普发展公司，有限责任合伙企业 | Adapting 3D print files |
| CN109155075A (en) * | 2016-05-12 | 2019-01-04 | 惠普发展公司，有限责任合伙企业 | It is adapted to 3D printing file |
| CN106600710A (en) * | 2016-10-18 | 2017-04-26 | 浙江大学 | Layered machining multi-connected-domain construction method of adjacency topological correlation of geometric network model |
| CN106600710B (en) * | 2016-10-18 | 2019-06-14 | 浙江大学 | A kind of layer of the adjacent topological correlation of geometric mesh model cuts multiply connected domain construction method |
| CN106738864B (en) * | 2016-11-17 | 2018-11-06 | 西安电子科技大学 | A kind of sliced sheet processing method of surface model surface inkjet printing |
| CN106738864A (en) * | 2016-11-17 | 2017-05-31 | 西安电子科技大学 | A kind of sliced sheet processing method of surface model surface inkjet printing |
| CN108215174A (en) * | 2016-12-09 | 2018-06-29 | 珠海赛纳打印科技股份有限公司 | A kind of 3D objects inkjet printing methods and system |
| CN110945568A (en) * | 2017-05-08 | 2020-03-31 | 菲兹纳股份有限公司 | System and method for evaluating 3D models |
| CN107067471A (en) * | 2017-05-10 | 2017-08-18 | 河海大学常州校区 | A kind of adaptive scanning speed method for improving pendant body model forming quality |
| CN107403469B (en) * | 2017-08-10 | 2020-09-22 | 河海大学常州校区 | Self-adaptive scanning speed method for improving bevel forming quality |
| CN107403469A (en) * | 2017-08-10 | 2017-11-28 | 河海大学常州校区 | A kind of adaptive scanning speed method for improving knuckle Forming Quality |
| CN107584757A (en) * | 2017-10-30 | 2018-01-16 | 宁夏共享模具有限公司 | The Method of printing of product profile in a kind of FDM printings |
| CN109934923B (en) * | 2017-12-15 | 2022-10-11 | 中国科学院沈阳自动化研究所 | Model layering and track filling method suitable for 3D printing of biological material |
| CN109934923A (en) * | 2017-12-15 | 2019-06-25 | 中国科学院沈阳自动化研究所 | Model layers and track fill method suitable for biomaterial 3D printing |
| CN108057888A (en) * | 2017-12-15 | 2018-05-22 | 佛山租我科技有限公司 | Connection rod of automobile engine laser 3D printing technique |
| CN109228353A (en) * | 2018-08-06 | 2019-01-18 | 上海大学 | A kind of Dynamic Slicing algorithm without support 3D printing method |
| CN109394410A (en) * | 2018-11-13 | 2019-03-01 | 武汉必盈生物科技有限公司 | Based on the personalized outer fixed 3D printing model design method of patient and slice systems |
| CN109394410B (en) * | 2018-11-13 | 2022-03-22 | 武汉必盈生物科技有限公司 | Patient-based personalized external fixation 3D printing model design method and slicing system |
| CN109523074A (en) * | 2018-11-14 | 2019-03-26 | 浙江工业大学 | A kind of tailoring method for optimizing route based on arest neighbors Genetic Hybrid Algorithm |
| CN109325316A (en) * | 2018-11-15 | 2019-02-12 | 南京理工大学 | STL model efficient parallel based on concurrent welding sequence cuts layer method |
| CN109325316B (en) * | 2018-11-15 | 2020-05-26 | 南京理工大学 | STL model efficient parallel layer cutting method based on concurrent welding sequencing |
| CN109887052A (en) * | 2019-01-29 | 2019-06-14 | 广联达科技股份有限公司 | A kind of planar polygons offset method |
| CN109887052B (en) * | 2019-01-29 | 2023-08-25 | 广联达科技股份有限公司 | Two-dimensional polygon offset method |
| CN109822478A (en) * | 2019-03-19 | 2019-05-31 | 苏州润智和智能科技有限公司 | A kind of comprehensive detection system and method for automobile axial workpiece |
| CN110210122B (en) * | 2019-05-30 | 2023-08-01 | 华南理工大学 | Boundary coloring width defining method of color slice layer |
| CN110210122A (en) * | 2019-05-30 | 2019-09-06 | 华南理工大学 | A kind of boundary coloring width confining method of Cont of Color Slice layer |
| CN110232742A (en) * | 2019-06-12 | 2019-09-13 | 洁誉科技（上海）股份有限公司 | 3D printing hierarchical control algorithm |
| CN110544255B (en) * | 2019-07-26 | 2020-05-19 | 山东大学 | Method and system for segmenting triangular mesh holes for 3D printing |
| CN110544255A (en) * | 2019-07-26 | 2019-12-06 | 山东大学 | method and system for segmenting triangular mesh holes for 3D printing |
| CN110442994A (en) * | 2019-08-13 | 2019-11-12 | 嘉兴学院 | A kind of 3D printing sliced sheet processing method based on graph theory |
| CN111710022A (en) * | 2020-06-08 | 2020-09-25 | 嘉兴学院 | Rapid forming slice processing method for avoiding contour intersection |
| CN112069725A (en) * | 2020-08-03 | 2020-12-11 | 彭涛 | High-precision slice obtaining method and device for 3D printer |
| CN112069725B (en) * | 2020-08-03 | 2024-03-08 | 彭涛 | High-precision slice acquisition method and device for 3D printer |
| CN112085832A (en) * | 2020-08-12 | 2020-12-15 | 浙江闪铸三维科技有限公司 | Advertisement word 3D model generation method |
| CN112182677A (en) * | 2020-09-17 | 2021-01-05 | 上海漫格科技有限公司 | Interactive variable-layer thickness slicing method in three-dimensional printing |
| CN112184911B (en) * | 2020-09-28 | 2023-11-14 | 嘉兴学院 | Non-popular grid model slicing processing method |
| CN112184911A (en) * | 2020-09-28 | 2021-01-05 | 嘉兴学院 | Non-popular grid model slice processing method |
| CN112659316A (en) * | 2020-12-17 | 2021-04-16 | 江苏集萃复合材料装备研究所有限公司 | Rapid layering method for 3D cement printing |
| CN112659316B (en) * | 2020-12-17 | 2022-05-31 | 江苏集萃复合材料装备研究所有限公司 | Rapid layering method for 3D cement printing |
| CN113204213B (en) * | 2021-07-06 | 2021-11-19 | 广州中望龙腾软件股份有限公司 | Tool path generation method based on STL model, intelligent terminal and storage device |
| CN113204213A (en) * | 2021-07-06 | 2021-08-03 | 广州中望龙腾软件股份有限公司 | Tool path generation method based on STL model, intelligent terminal and storage device |
| CN113715338A (en) * | 2021-08-30 | 2021-11-30 | 深圳市纵维立方科技有限公司 | Three-dimensional model slicing method, printing method and related equipment |
| WO2023029619A1 (en) * | 2021-08-30 | 2023-03-09 | 深圳市纵维立方科技有限公司 | Slicing method for three-dimensional model, printing method and related device |
| CN113715338B (en) * | 2021-08-30 | 2023-08-18 | 深圳市纵维立方科技有限公司 | Slicing method, printing method and related equipment of three-dimensional model |
| AT525686A1 (en) * | 2021-12-09 | 2023-06-15 | Mehmet Bugra Akin | Process for the additive manufacturing of a workpiece |
| CN114347482B (en) * | 2021-12-30 | 2023-07-25 | 浙江闪铸三维科技有限公司 | Positioning method for triangular patches in triangular mesh model holes |
| CN114347482A (en) * | 2021-12-30 | 2022-04-15 | 浙江闪铸三维科技有限公司 | Method for positioning triangular patch in triangular mesh model hole |
| CN114986910A (en) * | 2022-04-24 | 2022-09-02 | 青岛理工大学 | Cylindrical surface layered 3D printing method for revolution structure |
| CN114986910B (en) * | 2022-04-24 | 2023-12-22 | 深圳云疆智造科技有限公司 | Cylindrical surface layering 3D printing method for rotary structure |
| CN114842169A (en) * | 2022-05-05 | 2022-08-02 | 武汉理工大学 | Shell part contour path extraction method based on STL slicing algorithm |
| CN114842169B (en) * | 2022-05-05 | 2024-08-02 | 武汉理工大学 | Shell part contour path extraction method based on STL slicing algorithm |
| CN116872500A (en) * | 2023-09-07 | 2023-10-13 | 苏州闪铸三维科技有限公司 | Method for realizing Z-axis compensation by generating and eliminating self-intersection |
| CN116872500B (en) * | 2023-09-07 | 2023-12-29 | 苏州闪铸三维科技有限公司 | Method for realizing Z-axis compensation by generating and eliminating self-intersection |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104331555B (en) | 2017-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104331555A (en) | Slicing processing method aiming at non-closed STL model with boundaries | |
| US7747421B2 (en) | Head assignment modeling and simulation | |
| US7769481B2 (en) | Head assignment system and method | |
| CN106600710B (en) | A kind of layer of the adjacent topological correlation of geometric mesh model cuts multiply connected domain construction method | |
| CN103700144B (en) | A kind of grid model 3D based on significance prints dicing method | |
| CN102722614A (en) | Method for building dynamic three-dimensional process model | |
| CN107067471A (en) | A kind of adaptive scanning speed method for improving pendant body model forming quality | |
| CN110956699B (en) | GPU (graphics processing unit) parallel slicing method for triangular mesh model | |
| CN108338848B (en) | Stripping type laser tooth preparation method, apparatus, equipment and medium | |
| CN102023616B (en) | Triangle Bezier curved surface numerical-control finishing tool-path quick generation method | |
| CN106903889A (en) | A kind of rapid section algorithm of STL models | |
| CN100585638C (en) | Curved body three-dimensional boundary representation model reconstruction method and device based on line boundary | |
| CN104331933A (en) | Slicing direction self-adaptive rapid selection method | |
| CN102629391A (en) | Three-dimensional space structure graph cutting and slicing method based on digital graph medium | |
| CN109325316B (en) | STL model efficient parallel layer cutting method based on concurrent welding sequencing | |
| CN103838907A (en) | Curved surface cutting trajectory obtaining method based on STL model | |
| CN107562980A (en) | Geometric information extraction method based on BIM model | |
| CN106445981A (en) | Wavelet transform-based self-adaptive compression method for STL (Standard Template Library) grid model slicing data | |
| CN103970949A (en) | Edge-by-edge layering method of triangular patch model in rapid forming | |
| CN104392053A (en) | Skin roll-bending part sectional curvature analysis method | |
| CN111710022A (en) | Rapid forming slice processing method for avoiding contour intersection | |
| CN112926207A (en) | Method and system for automatically constructing editable model of equal-geometry topological optimization result | |
| CN102663152B (en) | Finite element modeling method of special-shaped honeycomb skin structure | |
| CN105785919B (en) | Point five axis of cloud is without global interference generating tool axis vector feasible zone computational methods | |
| CN106296824A (en) | A kind of T mesh local refinement implementation method based on half of data structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190813 Address after: 201600 Shanghai Songjiang District Xinzhuan Highway 668 Twin Towers B103-1 Patentee after: SHANGHAI JIZHEN 3D DESIGN CO.,LTD. Address before: 213022 Jiangsu, North District, Changzhou Jin Ling North Road, No. 200 Patentee before: CHANGZHOU CAMPUS OF HOHAI University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170714 Termination date: 20201031 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |