CN109325316B - STL model efficient parallel layer cutting method based on concurrent welding sequencing - Google Patents

STL model efficient parallel layer cutting method based on concurrent welding sequencing Download PDF

Info

Publication number
CN109325316B
CN109325316B CN201811360298.1A CN201811360298A CN109325316B CN 109325316 B CN109325316 B CN 109325316B CN 201811360298 A CN201811360298 A CN 201811360298A CN 109325316 B CN109325316 B CN 109325316B
Authority
CN
China
Prior art keywords
layer
tangent
triangular
triangular patch
vertex
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
Application number
CN201811360298.1A
Other languages
Chinese (zh)
Other versions
CN109325316A (en
Inventor
张长东
管志方
王聪
施昕
刘婷婷
廖文和
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Science and Technology
Original Assignee
Nanjing University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University of Science and Technology filed Critical Nanjing University of Science and Technology
Priority to CN201811360298.1A priority Critical patent/CN109325316B/en
Publication of CN109325316A publication Critical patent/CN109325316A/en
Application granted granted Critical
Publication of CN109325316B publication Critical patent/CN109325316B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/08—Volume rendering

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Graphics (AREA)
  • Image Analysis (AREA)
  • Numerical Control (AREA)

Abstract

The invention discloses an STL model efficient parallel layer cutting method based on welding sequencing, which comprises the steps of firstly reading index information of vertexes and edges of triangular patches constructed by an STL model to obtain vertex coordinates, vertex indexes and edge indexes of all the triangular patches and a storage container containing information of the triangular patches; then calculating all the tangent segments, distributing a mark number for each endpoint of the tangent segment, and calculating the total number of tangent layers according to the thickness of the tangent layers and the minimum value and the maximum value of the model in the axial direction; calculating tangent line segments of the triangular patch, which are intersected with the tangent plane, by utilizing a tangent plane set intersected with the triangular patch, and allocating a unique mark number to each tangent line segment endpoint; then, calling the cutting layers layer by layer, calling all the cutting line segments in the layer to perform vertex welding, constructing association mapping by combining repeated points to obtain a complete and closed cutting layer contour, deleting redundant points, and storing the contour set of the current layer; outputting a layer cutting outline after the layer cutting calculation is finished; the invention can reduce the time consumption of cutting the STL model.

Description

STL model efficient parallel layer cutting method based on concurrent welding sequencing
Technical Field
The invention belongs to the field of additive manufacturing, and particularly relates to an STL model efficient parallel layer cutting method based on common-point welding sequencing.
Background
In recent years, the additive manufacturing technology is widely concerned and rapidly developed, and has wide application prospects and technical advantages in the fields of aviation, aerospace, molds, medical treatment and the like. As a key link of the additive manufacturing technology, the layer cutting calculation is used for realizing the data conversion from a three-dimensional part model to a two-dimensional layer cutting outline, and plays an important role in the process of additive manufacturing process data processing. The STL file is used as a standard file format for additive manufacturing, and most of layer cutting methods are focused, so that the layer cutting calculation of the STL model is realized efficiently and accurately, and the method has significant significance for improving the data processing efficiency of the additive manufacturing process and ensuring the forming quality of parts.
Since the STL file expresses the three-dimensional model by approximating the model surface with triangular patches (as shown in fig. 1), the triangular patches are stored out of order. In order to reduce the traversal times of the triangular patch and improve the layer cutting efficiency, the layer cutting method based on the STL model has the main idea that the original STL model data is preprocessed and then layered. Currently, the main layer cutting methods can be divided into two categories: the method comprises a layer cutting method based on geometric topological information and a layer cutting method based on triangular patch position information grouping and sequencing. Chinese patent application No. 201510979383.6 discloses a fast slicing algorithm for STL model, which firstly groups according to the position information of triangular patches, and then reconstructs the local geometric topological information of each group of triangular patches through an updating algorithm and carries out slicing calculation, thereby improving the slicing efficiency of the whole model. However, the above methods all need to consume a large amount of time to perform data preprocessing, and in subsequent layer cutting, a triangular patch still needs to be called for many times to calculate a segment of a cut, and the contour sorting needs to be performed through many times of searching and comparing, and with the continuous development of technologies such as topology optimization, lattice design, reverse engineering and the like, models needing to be processed are more and more complex, the requirement for layer cutting precision is higher and higher, and the layer cutting efficiency is continuously reduced.
Disclosure of Invention
The invention aims to provide an STL model efficient parallel layer cutting method based on concurrent welding sequencing, so that the layer cutting time consumption of a large number of STL models is reduced, and the processing precision of layer cutting outlines is ensured.
The technical solution for realizing the purpose of the invention is as follows:
an STL model efficient parallel layer cutting method based on common-point welding sequencing comprises the following steps:
step 1, reading an STL model, constructing index information of vertexes and edges of triangular patches, and obtaining vertex coordinates, vertex indexes and edge indexes of all triangular patches, and a total number n of triangular patches, a total number npoings of non-repeated vertexes and a total number nEdges of non-repeated edges;
step 2, calculating all the tangent line segments, and distributing a marking number to each endpoint of the tangent line segment: calculating the total number of layers according to the thickness H of the layers and the minimum value Zmin and the maximum value Zmax of the model in the Z-axis direction; calculating tangent line segments of all the triangular surface patches intersected with the tangent planes by utilizing a tangent plane set intersected with the triangular surface patches, and distributing a unique mark number to each tangent line segment endpoint;
step 3, sequencing the slicing outlines: calling a tangent layer by layer, calling all tangent line segments in the line layer to perform vertex welding, and constructing association mapping by combining common endpoints of adjacent line segments; obtaining a complete closed layer cutting outline according to the association mapping, deleting redundant points, and storing the obtained outline into an outline set of the current layer;
and 4, finishing the layer cutting calculation and outputting the layer cutting outline.
Compared with the prior art, the invention has the following remarkable advantages:
(1) according to the invention, only index information of the edges and the vertexes of the triangular patch is constructed by simplifying the construction process of the topology information, so that the construction time of the topology information and the storage memory of the topology information are reduced;
(2) according to the invention, all tangent segments can be obtained by one-time traversal by taking the triangular patch as an intersection object, so that the calling times of the triangular patch are greatly reduced;
(3) the method provided by the invention can obtain the layer cutting outline in linear time, and greatly improves the layer cutting efficiency;
(4) the invention carries out parallel calculation on the process of calculating the tangent line segment by intersecting the triangular patch and the tangent plane and the process of sequencing the tangent layer contours, thereby further improving the layer cutting efficiency.
The present invention is described in further detail below with reference to the attached drawing figures.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
FIG. 2 is a schematic diagram of an STL model;
FIG. 3 is a schematic diagram of a triangular patch information storage container;
FIG. 4 is a schematic view of a sliced storage container;
FIG. 5(a-e) is a schematic diagram of the intersection of a tangent plane with a triangular patch;
FIG. 6 is a diagram of a custom structure Info;
fig. 7 is an unordered container NumberInfo storage element structure.
Detailed Description
For the purpose of illustrating the technical solutions and technical objects of the present invention, the present invention will be further described with reference to the accompanying drawings and specific embodiments.
With reference to fig. 1, the invention provides an STL model efficient parallel layer cutting method based on a concurrent welding sequencing, which comprises the following steps:
step 1, reading the STL model, and constructing index information of the vertex and the edge of the triangular patch
1.1, establishing a storage container:
and establishing a PointToIndex which stores the vertex and the vertex index and an EdgeToIndex which stores the edge and the edge index, wherein the two associated containers are initially empty, namely no element is stored. In addition, the coordinates (P) of three vertexes of the triangular patch are stored1、P2、P3) Index of three vertices (PIndex)1、PIndex2、PIndex3) And three-edge index (EIndex)1、EIndex2、EIndex3) Establishing a triangular patch storage container T for storing the informationiI.e. by
Figure BDA0001867152570000031
Wherein
Figure BDA0001867152570000034
Three vertex coordinates of the ith triangular patch respectively,
Figure BDA0001867152570000032
respectively indices of the three vertices of the ith triangular patch,
Figure BDA0001867152570000033
indexes of three edges of the ith triangular patch are respectively, and n represents the total number of the triangular patches; as shown in fig. 2 and 3.
1.2, constructing index information of vertexes and edges of triangular patch
Sequentially reading triangular patches contained in the STL model, sequentially judging whether three vertexes of the triangular patches exist in the PointToIndex of the associated container every time one triangular patch is read, if so, obtaining an index associated with the vertexes, if not, storing the vertexes into the PointToIndex of the associated container, and taking the number of elements stored in the stored associated container as the index of the vertexes; similarly, whether three edges of the triangular patch exist in the associated container edgetondex is sequentially judged, if yes, an index associated with the edges is obtained, if not, the edges are stored in the associated container edgetondex, and the number of elements stored in the stored associated container is used as the index of the edge. After vertex coordinates, vertex indexes and edge index information of the triangular patch are obtained, the information is stored into Ti(ii) a After reading of the STL model is finished, obtaining vertex coordinates, vertex indexes and edge indexes of all triangular patches, the total number n of the triangular patches, the total number npoings of non-repeated vertices and the total number nEdges of non-repeated edges;
1.3, obtaining the minimum value and the maximum value of the model in the Z-axis direction
And when reading the triangular patch, comparing the Z coordinate size of each vertex to obtain the minimum value Zmin and the maximum value Zmax of the model in the Z-axis direction.
Step 2, calculating all the tangent line segments, and distributing a marking number to each endpoint of the tangent line segment:
2.1 building a sliced storage Container
Establishing a layer-cutting storage container L for storing the height Z of each layer-cutting, all line sections and all outlines PolyjI.e. Lj{Linesj,Polysj,ZjJ 1,2, N; wherein L isjRepresents the j-th slice, LinesjRepresents a set of segments, Poly, stored in the jth slicejRepresenting the set of slice profiles stored in the jth slice, ZjThe height of a plane where the jth cutting layer is located is represented, and N represents the total cutting layer number; as shown in fig. 4.
Wherein N may be based on the slice thicknessThe degree H and the minimum value Zmin and the maximum value Zmax in the Z-axis direction of the model obtained in step 1.3 are calculated from
Figure BDA0001867152570000041
Obtaining (
Figure BDA0001867152570000042
Is the rounding down operator); and the height Z of each slice can be determined from Z ═ j × H.
2.2, calling a first triangular patch, wherein i is 1 for the first triangular patch;
2.3, obtaining the minimum value and the maximum value of the triangular patch in the Z-axis direction;
comparing the Z coordinates of three vertexes of the triangular patch to obtain the minimum Z of the triangular patch in the Z-axis directionimin and maximum value Zimax。
2.4 obtaining a set of tangent planes intersecting the triangular patch
By
Figure BDA0001867152570000043
The range of the slice that the triangular patch spans can be obtained, and the set of the tangent planes that intersect the triangular patch can be obtained from the range of the slice.
2.5, calculating a tangent line segment of the triangular patch intersected with the tangent plane
And sequentially obtaining tangent line segments of the intersection of each tangent plane and the triangular patch according to the tangent plane set intersected with the triangular patch.
Normally, the tangent plane and the triangular patch have two intersections, and the two intersections form two end points of the tangent line segment, as shown in fig. 5 (a). However, there are two special intersection situations between the tangent plane and the triangular patch, one is that the triangular patch is located in the tangent plane, as shown in fig. 5 (b); another is that the tangent plane intersects only one vertex of the triangular patch, as shown in fig. 5 (c). Both cases do not constitute a tangent line segment, and therefore both cases are ignored when determining the intersection line segment. In addition, when the triangular patch intersects the tangent plane at one edge, there are two cases, the first is that one edge of the triangular patch intersects the tangent plane and the third vertex Z coordinate is greater than the height of the tangent plane (as shown in fig. 5(d), the second is that one edge of the triangular patch intersects the tangent plane and the third vertex Z coordinate is less than the height of the tangent plane (as shown in fig. 5 e)). From the co-edge connection constraint of the triangular patches in the STL model, if the tangent lines obtained in both cases are stored, repeated storage will be caused. In order to avoid repeated storage of the tangent line segment, when the tangent line segment is one edge of the triangular patch, only the tangent line segment when the Z coordinate of the third vertex is smaller than the height of the tangent plane is stored.
2.6 assigning a respective marking number to the end points of the segment
After a tangent line segment of the tangent plane and the triangular patch, if the end point of the line segment is superposed with the vertex of the triangular patch, the index Pindex of the vertex of the triangular patch is used as a mark number to be distributed to the end point of the line segment; if the line segment end point is on the edge of the triangular patch, the index EIndex of the edge of the triangular patch plus the total number of the points nPoints are used as a mark number to be distributed to the line segment end point.
Or if the line segment end point is superposed with the vertex of the triangular patch, the index Pindex of the vertex of the triangular patch and the total number nEdges of the top edge are taken as mark numbers to be distributed to the line segment end point; if the end point of the line segment is on the edge of the triangular patch, the index EIndex of the edge of the triangular patch is used as a marking number to be distributed to the end point of the line segment, and the marking number of each end point in one cut layer is only required to be unique and the same end point marking number is ensured to be the same.
2.7 storing the tangent line segment
After the tangent line segments are solved and the end point indexes are distributed, the tangent line segments are stored into the tangent line segment set Lines of the corresponding tangent layer according to the height of the tangent plane where the tangent line segments are locatedjIn (1).
And 2.8, making i equal to i +1, judging whether i is larger than n, if so, executing the next step, otherwise, calling the next triangular patch, and turning to the step 2.3. And finishing the storage of the tangent line segments of all the triangular patches.
Preferably, the process of obtaining the intersection line segment by calling the triangular patch can improve the efficiency through parallel computation. (i.e., multiple triangular patches going on simultaneously)
Step 3, sequencing the slicing profiles
3.1, taking a first layer cutting layer, wherein j is 1 for the first layer cutting layer;
3.2, set up unordered container
A new structure Info is created which stores information including the endpoint coordinates P and the marker numbers (NeighborNumber1, NeighborNumber2) of two adjacent endpoints, as shown in fig. 6. The unordered container Number Info is established with the end point Number and the structure Info as a key-value pair, as shown in fig. 7. The unordered container NumberInfo is initially empty, i.e., no elements are stored;
3.3 vertex welding, building associative mapping by merging common endpoints of adjacent line segments
Calling all tangent Lines in the line layer for vertex welding, firstly judging whether elements taking the mark numbers of line segment end points as key exist in unordered container NumberInfo, if not, establishing a new element taking the number as the key in the container, wherein the end point coordinate P in the Value (namely structure Info) is the end point coordinate, and the mark number NeighborNumber1 of the first adjacent end point is the mark number of the adjacent end point; if it exists, the number of the mark immediately adjacent to the end point is assigned to the number NeighborNumber2 of the second adjacent end point in the Value (i.e., the struct Info) (the number NeighborNumber1 of the first adjacent end point is assigned). And after the welding of the vertexes of all the tangent line segments of the layer is finished, the construction of the mark number association mapping of the adjacent end points is finished by combining the common end points of the adjacent tangent line segments.
3.4, sorting the profiles to obtain a complete closed profile
According to the association mapping, arbitrarily taking one element from the unordered container, taking the endpoint coordinate P of the Value (i.e. structure Info) as the coordinate of the first vertex of the cut-layer profile, then arbitrarily taking the mark number (Neighbore number1 or Neighbore number2) of one adjacent endpoint as the search key, after the second element is searched, taking the endpoint coordinate P of the Value (i.e. structure Info) of the second element as the coordinate of the second vertex of the profile, and taking one of the mark numbers of two adjacent endpoints as the key of the last called element, in order to correctly sort the cut-layer profile, taking the other mark number as the search key, and repeating the steps until the taken mark number is the key of the first called element, namely, the first vertex is searched, so as to obtain a completely closed cut-layer profile, and the redundant point is deleted in the searching and sorting process, the obtained contours are stored in the contour set polyl of the current layer.
And 3.5, after obtaining a contour, deleting the searched elements in the unordered container, judging whether the unordered container is empty, executing the next step if the unordered container is empty, and turning to 3.4 if the unordered container is not empty.
And 3.6, enabling j to be j +1, judging whether j is larger than N, if so, executing the next step, otherwise, calling the next cutting layer, and turning to 3.2.
Preferably, the process of performing contour ordering can improve efficiency through parallel computing.
And 4, finishing the layer cutting calculation and outputting the layer cutting outline.
According to the invention, only index information of the edges and the vertexes of the triangular patch is constructed by simplifying the construction process of the topology information, so that the construction time of the topology information and the storage memory of the topology information are reduced; all tangent segments can be obtained by one-time traversal by taking the triangular patch as an intersection object, so that the calling times of the triangular patch are greatly reduced; the layer cutting outline can be obtained in linear time, and the layer cutting efficiency is greatly improved.

Claims (6)

1. An STL model efficient parallel layer cutting method based on common-point welding sequencing is characterized by comprising the following steps:
step 1, reading an STL model, constructing index information of vertexes and edges of triangular patches, and obtaining vertex coordinates, vertex indexes and edge indexes of all triangular patches, and a total number n of triangular patches, a total number npoings of non-repeated vertexes and a total number nEdges of non-repeated edges;
step 2, calculating all the tangent line segments, and distributing a marking number to each endpoint of the tangent line segment: calculating the total number of layers according to the thickness H of the layers and the minimum value Zmin and the maximum value Zmax of the model in the Z-axis direction; calculating tangent line segments of all the triangular surface patches intersected with the tangent planes by utilizing a tangent plane set intersected with the triangular surface patches, and distributing a unique mark number to each tangent line segment endpoint;
step 3, sequencing the slicing outlines: calling the cutting layers layer by layer, calling all cutting line segments in the currently-called cutting layer Lines for vertex welding, and constructing association mapping by combining common endpoints of adjacent line segments; obtaining a complete closed layer cutting outline according to the association mapping, deleting redundant points, and storing the obtained outline into an outline set of the current layer; the Lines refers to a tangent line segment set stored in a corresponding tangent layer;
step 4, outputting a layer cutting outline after the layer cutting calculation is finished;
step 1, constructing index information of vertexes and edges of triangular patch, specifically comprising the following steps:
1.1, establishing a storage container;
establishing a PointToIndex which stores a vertex and a vertex index and an edgeToIndex which stores an edge and an edge index, and establishing a storage container which stores triangular patch information
Figure FDA0002412252530000011
Wherein
Figure FDA0002412252530000012
Three vertex coordinates of the ith triangular patch respectively,
Figure FDA0002412252530000013
Figure FDA0002412252530000014
respectively indices of the three vertices of the ith triangular patch,
Figure FDA0002412252530000015
indexes of three edges of the ith triangular patch are respectively, and n represents the total number of the triangular patches;
1.2, constructing index information of vertexes and edges of the triangular patch;
sequentially reading triangular patches contained in the STL model, judging whether three vertexes of the triangular patches exist in a related container PointToIndex or not, judging whether three edges exist in a related container EdgeToIndex or not, if so, obtaining a corresponding index, if not, storing the vertexes or the edges into the corresponding related container, and taking the number of elements stored in the stored related container as the index; after vertex coordinates, vertex indexes and edge index information of the triangular patch are obtained, the information is stored into Ti; obtaining vertex coordinates, vertex indexes and edge indexes of all the triangular patches, and the total number n of the triangular patches, the total number nPoints of non-repeated vertices and the total number nEdges of non-repeated edges;
1.3, obtaining the minimum value and the maximum value of the model in the Z-axis direction;
in step 2, the step of calculating all the tangent segments and assigning a mark number to each tangent segment endpoint specifically comprises the following steps:
2.1 building a sliced storage container Lj{Linesj,Polysj,Zj1,2, …, N; wherein, LinesjRepresents a set of segments, Poly, stored in the jth slicejRepresenting the set of slice profiles stored in the jth slice, ZjThe height of a plane where the jth cutting layer is located is represented, and N represents the total cutting layer number;
2.2, calling a first triangular patch, wherein i is 1 for the first triangular patch;
2.3, obtaining the minimum value and the maximum value of the currently-called triangular patch in the Z-axis direction;
2.4, solving a layer cutting range spanned by the currently called triangular patch, and obtaining a tangent plane set intersected with the currently called triangular patch from the layer cutting range;
2.5, calculating a tangent line segment of the currently called triangular patch, which is intersected with the tangent plane;
2.6, distributing a unique mark number for each end point of the tangent line segment;
2.7, storing the tangent plane height of the tangent line into the tangent line set Lines of the corresponding tangent layer according to the tangent plane height of the tangent linejPerforming the following steps;
2.8, making i equal to i +1, judging whether i is larger than n, if so, executing the next step, otherwise, calling the next triangular patch, and jumping to the step 2.3 to finish the storage of the tangent line segments of all the triangular patches;
step 3, sequencing the slicing profiles, which specifically comprises the following steps:
3.1, taking a first layer cutting layer, wherein j is 1 for the first layer cutting layer;
3.2, establishing a disordered container;
establishing a new structure body Info, wherein the stored information comprises an endpoint coordinate P and mark numbers (Neighbore Number1 and Neighbore Number2) of two adjacent endpoints, and establishing an unordered container NumberInfo by taking the endpoint mark Number and the structure body Info as a key-value pair;
3.3, welding vertexes, and constructing association mapping by combining common endpoints of adjacent line segments;
3.4, sequencing the outlines to obtain a complete closed outline, according to the association mapping, randomly selecting an element from an unordered container, taking the endpoint coordinate P of the Value of the element as the coordinate of a first vertex of the cut-layer outline, then randomly selecting the mark number of an adjacent endpoint as a search keyword for searching, after searching a second element, taking the endpoint coordinate P 'of the Value' of the second element as the coordinate of a second vertex of the outline, taking one of the mark numbers of the two adjacent endpoints as a keyword key of a previous calling element, and taking the other mark number as the search keyword for searching until the taken mark number is the keyword key of the first calling element to obtain a complete closed cut-layer outline which is stored in the outline set Polys of the current layer;
3.5, after obtaining a contour, deleting the searched elements in the unordered container, judging whether the unordered container is empty, if so, executing the next step, and if not, turning to the step 3.4;
and 3.6, making j equal to j +1, judging whether j is larger than N, if so, executing the next step, otherwise, calling the next layer and turning to the step 3.2.
2. The STL model efficient parallel layer-cutting method based on the co-point welding sequencing is characterized in that the step 2.5 of calculating the tangent line segment of the triangular patch intersected with the tangent plane comprises the following steps:
the tangent plane and the triangular patch have two intersection points, and the two intersection points form two end points of the tangent line segment; when the triangular patch is positioned in the tangent plane, and the tangent plane is only intersected with one vertex of the triangular patch, no calculation is performed; and when the tangent line segment is one edge of the triangular patch, only storing the tangent line segment when the Z coordinate of the third vertex is smaller than the height of the tangent plane.
3. The STL model efficient parallel layer cutting method based on the concurrent welding sequencing as claimed in claim 1, wherein step 2.6 assigns a mark number to each of the segment ends, and if the segment end coincides with the triangle patch vertex, assigns the index Pindex of the triangle patch vertex as the mark number to the segment end; if the line segment end point is on the edge of the triangular patch, the index EIndex of the edge of the triangular patch plus the total number of the points nPoints are used as a mark number to be distributed to the line segment end point.
4. The STL model efficient parallel layer cutting method based on the concurrent welding sequencing of claim 1, wherein step 2.6 assigns a marking number to each segment end point, if the segment end point coincides with the vertex of the triangular patch, the index Pindex of the vertex of the triangular patch plus the total number nEdges of the top edge are assigned to the segment end point as the marking number; if the line segment end point is on the edge of the triangular patch, the index EIndex of the edge of the triangular patch is used as a mark number to be distributed to the line segment end point.
5. The STL model efficient parallel layer-cutting method based on the co-point welding sequencing is characterized in that the step 2.2 of calling a triangular patch to obtain an intersection line segment is calculated in parallel.
6. The STL model efficient parallel layer slicing method based on the order of common point welding as claimed in claim 5, wherein the process of performing the order of the contours is through parallel computation.
CN201811360298.1A 2018-11-15 2018-11-15 STL model efficient parallel layer cutting method based on concurrent welding sequencing Active CN109325316B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811360298.1A CN109325316B (en) 2018-11-15 2018-11-15 STL model efficient parallel layer cutting method based on concurrent welding sequencing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811360298.1A CN109325316B (en) 2018-11-15 2018-11-15 STL model efficient parallel layer cutting method based on concurrent welding sequencing

Publications (2)

Publication Number Publication Date
CN109325316A CN109325316A (en) 2019-02-12
CN109325316B true CN109325316B (en) 2020-05-26

Family

ID=65257728

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811360298.1A Active CN109325316B (en) 2018-11-15 2018-11-15 STL model efficient parallel layer cutting method based on concurrent welding sequencing

Country Status (1)

Country Link
CN (1) CN109325316B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110356008B (en) * 2019-07-03 2020-07-10 浙江大学 Hash table-based method for quickly splicing scattered line segments
CN112733318B (en) * 2020-11-27 2023-05-23 厦门理工学院 Adaptive grid subdivision method, device, equipment and storage medium
AT525686A1 (en) * 2021-12-09 2023-06-15 Mehmet Bugra Akin Process for the additive manufacturing of a workpiece
CN114491763A (en) * 2022-02-14 2022-05-13 上海龙宫科技有限公司 Automatic model weld joint grooving method suitable for building CAD software

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103838907A (en) * 2013-09-13 2014-06-04 上海大学 Curved surface cutting trajectory obtaining method based on STL model
CN104331555A (en) * 2014-10-31 2015-02-04 河海大学常州校区 Slicing processing method aiming at non-closed STL model with boundaries

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101635431B1 (en) * 2015-09-08 2016-07-04 한국생산기술연구원 A STL slicing method for diminishing the number of calculations
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

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103838907A (en) * 2013-09-13 2014-06-04 上海大学 Curved surface cutting trajectory obtaining method based on STL model
CN104331555A (en) * 2014-10-31 2015-02-04 河海大学常州校区 Slicing processing method aiming at non-closed STL model with boundaries

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Slicing of CAD models in color STL format;Dong-Xing Wang 等;《Computers in Industry》;20060131;第57卷(第1期);第3-9页 *
基于OpenMP的快速并行分层算法;马旭龙 等;《计算机辅助设计与图形学学报》;20150430;第27卷(第4期);第747-753页 *

Also Published As

Publication number Publication date
CN109325316A (en) 2019-02-12

Similar Documents

Publication Publication Date Title
CN109325316B (en) STL model efficient parallel layer cutting method based on concurrent welding sequencing
CN108595858B (en) BIM-based lightweight advanced treatment working method
CN107464223B (en) Point cloud hole repairing method based on slices
CN111710022B (en) Rapid forming slice processing method for avoiding contour intersection
EP0606627A1 (en) Method and apparatus employing sequential two-dimensional geometry for producing shells for fabrication by a rapid prototyping system
CN110956699B (en) GPU (graphics processing unit) parallel slicing method for triangular mesh model
CN109522585A (en) A kind of adaptive layered method preventing 3D printing model characteristic offset
Huang et al. An effective error-tolerance slicing algorithm for STL files
CN106903889A (en) A kind of rapid section algorithm of STL models
CN102298795A (en) Three-dimensional segmenting method for STL (Standard Template Library) triangular network model
CN103970949B (en) A kind of rapid shaping intermediate cam patch model by side layered approach
CN109934923B (en) Model layering and track filling method suitable for 3D printing of biological material
CN109551768A (en) A kind of data processing method of the 3D printing file based on STL
CN115661374B (en) Rapid retrieval method based on space division and model voxelization
CN112926207B (en) Method and system for automatically constructing editable model of equal-geometry topological optimization result
CN103838907A (en) Curved surface cutting trajectory obtaining method based on STL model
CN101403909B (en) Triangular gridding subdivision curved surface NC tool track fast generation method
CN108338848A (en) Stripping type laser tooth preparation method, apparatus, equipment and medium
CN115047825A (en) Method for displaying numerical control machining milling in real time
CN112734934B (en) STL model 3D printing slicing method based on intersecting edge mapping
Tang et al. Optimal connection of loops in laminated object manufacturing
Yau et al. Numerical control machining of triangulated sculptured surfaces in a stereo lithography format with a generalized cutter
Guan et al. Development of 3D printing entity slicing software
CN116798028A (en) Automatic dimension marking method for three-dimensional part
CN115587451A (en) Dynamic updating method of webpage-side triangular patch model based on voxel division

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