CN109325316A - STL model efficient parallel based on concurrent welding sequence cuts layer method - Google Patents
STL model efficient parallel based on concurrent welding sequence cuts layer method Download PDFInfo
- Publication number
- CN109325316A CN109325316A CN201811360298.1A CN201811360298A CN109325316A CN 109325316 A CN109325316 A CN 109325316A CN 201811360298 A CN201811360298 A CN 201811360298A CN 109325316 A CN109325316 A CN 109325316A
- Authority
- CN
- China
- Prior art keywords
- tri patch
- vertex
- layer
- tangent
- index
- 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
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
Abstract
The invention discloses a kind of STL model efficient parallels based on welding sequence to cut layer method, the index information on STL model construction tri patch vertex and side is read first, obtain apex coordinate, vertex index and the side index of all tri patch, the storage container of the information containing tri patch；Then it calculates all tangent sections, and respectively distributes a reference numerals for tangent section endpoint, always cut the number of plies according to cutting the minimum value and maximum value of thickness degree and model in axis direction and finding out；Using the tangent plane set intersected with tri patch, the tangent section that the tri patch intersects with tangent plane is calculated, respectively distributes a unique reference numerals for tangent section endpoint；It successively transfers again and cuts layer, transfer all tangent sections in the layer and carry out vertex welding, repeat point building relationship maps by merging, obtain the cross-sectional contour of a complete closure, delete redundant points, be stored in the profile set of current layer；Cutting layer calculating terminates, and exports cross-sectional contour；The present invention can reduce STL model cut layer time-consuming.
Description
Technical field
The invention belongs to material increasing fields, and in particular to a kind of STL model efficient parallel based on concurrent welding sequence
Cut layer method.
Background technique
In recent years, increases material manufacturing technology get the attention with it is fast-developing, led in Aeronautics and Astronautics, mold, medical treatment etc.
Domain shows wide application prospect and technical advantage.As the key link of increases material manufacturing technology, cut layer calculate for realizing
3 d part model plays to hold in increasing material manufacturing process data treatment process and open to the data conversion of two-dimentional cross-sectional contour
Under key player.And Standard File Format of the stl file as increasing material manufacturing, most of focusing for cutting layer method has been obtained,
Therefore efficient, the high-precision layer of cutting for realizing STL model calculates, for promoting increasing material manufacturing process data treatment effeciency, guaranteeing zero
Part forming quality has significant meaning.
Since stl file is to be expressed by tri patch approximate model surface threedimensional model (as shown in Figure 1), but three
Edged surface piece is unordered storage.In order to reduce the traversal number of tri patch, be promoted and cut a layer efficiency, layer is cut based on STL model
Method main thought is all first to pre-process to original STL model data, is then layered again.It is main at present to cut layer side
Method can be divided into two classes: cutting layer method, cutting layer based on tri patch location information packet sequencing based on geometric topology information
Method.Chinese Patent Application No. 201510979383.6 discloses a kind of rapid section algorithm of STL model, the patent first according to
It is grouped according to the location information of tri patch, local geometric topology letter is then carried out to every group of tri patch by more new algorithm
Breath, which reconstructs, simultaneously cut layer calculating, so that promote entire model cuts a layer efficiency.But above method is required to the consumption plenty of time
Data prediction is carried out, and is cut in layer subsequent, still needs to that tri patch is repeatedly called to calculate tangent section, repeatedly search and compare progress
Profile orderings, with the continuous development of the technologies such as topological optimization, lattice design and reverse-engineering, model to be treated is more next
It is more complicated, to cut layer required precision higher and higher, and this will lead to and cuts layer efficiency and constantly reduce.
Summary of the invention
The purpose of the present invention is to provide a kind of STL model efficient parallels based on concurrent welding sequence to cut layer method, with
Reduce the processing accuracy of magnanimity STL model cut layer time-consuming, guarantee cross-sectional contour.
The technical solution for realizing the aim of the invention is as follows:
It is a kind of based on concurrent welding sequence STL model efficient parallel cut layer method, comprising the following steps:
Step 1 reads STL model, constructs the index information on tri patch vertex and side, obtains the top of all tri patch
Point coordinate, vertex index and side index, and comprising tri patch sum n, unduplicated vertex sum nPoints and do not repeat
Side total nEdges；
Step 2 calculates all tangent sections, and respectively distributes a reference numerals for tangent section endpoint: according to cut layer thickness H and
Model finds out in the minimum value Zmin and maximum value Zmax of Z-direction and always cuts the number of plies；Utilize the tangent plane intersected with tri patch
Set, calculates the tangent section that all tri patch intersect with tangent plane, respectively distributes a unique reference numerals for tangent section endpoint
Word；
Step 3 is ranked up cross-sectional contour: successively transferring and cuts layer, transfers all tangent sections in this layer of Lines and pushed up
Spot welding, the common end by merging adjacent segments construct relationship maps；According to relationship maps, a complete closure is obtained
Cross-sectional contour deletes redundant points, by the profile set of obtained profile deposit current layer；
Step 4, cut layer calculating terminate, export cross-sectional contour.
Compared with prior art, the present invention its remarkable advantage:
(1) present invention only constructs the index information on tri patch side and vertex by simplifying topology information building process, subtracts
Topology information building time and topology information stored memory are lacked；
(2) present invention is to seek friendship object with tri patch, and primary traversal can acquire all tangent sections, is drastically reduced
The call number of tri patch；
(3) method proposed by the invention can obtain cross-sectional contour in linear session, significantly improve and cut a layer efficiency；
(4) present invention, which asks tri patch and tangent plane, hands over the process for calculating tangent section and cross-sectional contour sequencer procedure to carry out
Parallel computation further increases and cuts a layer efficiency.
Present invention is further described in detail with reference to the accompanying drawing.
Detailed description of the invention
Fig. 1 is flow chart of the method for the present invention.
Fig. 2 is STL model schematic；
Fig. 3 is tri patch information storage container schematic diagram；
Fig. 4 is to cut a layer storage container schematic diagram；
Fig. 5 (a-e) intersects situation schematic diagram with tri patch for tangent plane；
Fig. 6 is customized structural body Info schematic diagram；
Fig. 7 is unordered container NumberInfo storage element structure.
Specific embodiment
In order to illustrate technical solution of the present invention and technical purpose, with reference to the accompanying drawing and specific embodiment is the present invention
It is further to introduce.
In conjunction with Fig. 1, a kind of STL model efficient parallel based on concurrent welding sequence of the invention cuts layer method, including with
Lower step:
Step 1 reads STL model, constructs the index information on tri patch vertex and side
1.1, storage container is established:
Establish the associated container PointToIndex on storage vertex and vertex index, storage while and while the associated container that indexes
EdgeToIndex, two associated containers are initially empty, i.e., without storing any element.In addition, for tri patch three tops of storage
Coordinate (the P of point1、P2、P3), the index (PIndex on three vertex1、PIndex2、PIndex3) and three sides index
(EIndex1、EIndex2、EIndex3), establish the tri patch storage container T of storage above- mentioned informationi, i.e.,WhereinThree apex coordinates of respectively i-th tri patch,Respectively
The index on three vertex of i tri patch,Three of respectively i-th tri patch
The index on side, n indicate tri patch sum；As shown in Figure 2 and Figure 3.
1.2, the index information on tri patch vertex and side is constructed
It is successively read the tri patch in STL model included, one tri patch of every reading successively judges tri patch
Whether three vertex are present in associated container PointToIndex, and index associated with vertex is obtained if existing,
Then vertex is stored in associated container PointToIndex if it does not exist, and first prime number that the associated container after being stored into is stored
Measure the index as the vertex；Similarly, successively judge whether three sides of tri patch are present in associated container
In EdgeToIndex, index associated with side is obtained if existing, side is stored in associated container if it does not exist
Index of the number of elements that associated container in EdgeToIndex, and after being stored into is stored as the side.Obtain tri patch
Apex coordinate, after vertex index and side index information, these information are stored in Ti；After STL model read, owned
Apex coordinate, vertex index and the side index and tri patch sum n, unduplicated vertex sum nPoints of tri patch
With the total nEdges on unduplicated side；
1.3, model is obtained in the minimum value and maximum value of Z-direction
While reading tri patch, the Z coordinate size on more each vertex obtains model in the minimum of Z-direction
Value Zmin and maximum value Zmax.
Step 2 calculates all tangent sections, and respectively distributes a reference numerals for tangent section endpoint:
2.1, it establishes and cuts a layer storage container
To store height Z, all tangent section Lines and all profile Polys where each cutting layer, it is above-mentioned to establish storage
Information cuts a layer storage container Lj, i.e. Lj{Linesj,Polysj,Zj, j=1,2, N；Wherein, LjIt indicates to cut for j-th
Layer, LinesjIt indicates to cut the tangent section set stored in layer, Polys j-thjIt indicates to cut the cross-sectional contour collection stored in layer j-th
It closes, ZjIndicate j-th of level cut where layer, the number of plies is always cut in N expression；As shown in Figure 4.
Wherein N can be according to cutting the model found out in layer thickness H and step 1.3 in the minimum value Zmin and maximum of Z-direction
Value Zmax, byFind out (For downward rounding operation symbol)；And the height Z for each cutting layer can be by Z=
J*H is found out.
2.2, first tri patch is transferred, and for first tri patch, at this time i=1；
2.3, tri patch is obtained in the minimum value and maximum value of Z-direction；
The Z coordinate for comparing three vertex of tri patch obtains the tri patch in the minimum value Z of Z-directioniMin and
Maximum value Zimax。
2.4, the tangent plane set intersected with tri patch is obtained
ByCan find out that the tri patch crossed over cuts a layer range,
By cutting the available tangent plane set intersected with the tri patch of layer range.
2.5, the tangent section that the tri patch intersects with tangent plane is calculated
The tangent line of each tangent plane and tri patch intersection is successively found out by the tangent plane set intersected with the tri patch
Section.
Tangent plane and tri patch are there are two intersection point under normal circumstances, and two intersection points constitute two endpoints of tangent section, such as
Shown in Fig. 5 (a).But there is also two kinds of special intersection situations, one is tri patch to be located at tangent plane for tangent plane and tri patch
It is interior, as shown in Fig. 5 (b)；Another kind is that tangent plane only intersects with a vertex of tri patch, as shown in Fig. 5 (c).Both
Situation does not constitute tangent section, therefore to ignore both of these case when seeking meet line segment.In addition, working as tri patch and tangent plane
When intersecting at a line, also there are two types of situations, the first is that tri patch a line intersects with tangent plane, third vertex Z is sat
Mark is greater than tangent plane height (such as Fig. 5 (d) shown in), be for second tri patch a line intersect with tangent plane, third vertex Z
Coordinate is less than shown in tangent plane height (such as Fig. 5 e)).Side connection constraints are total to by STL model intermediate cam dough sheet it is found that if by this two
The tangent section acquired in the case of kind stores, and will cause to repeat to store.To avoid repeating storing tangent section, when tangent section is triangle
When a line of dough sheet, tangent section when third vertex Z coordinate is less than tangent plane height is only stored.
2.6, a reference numerals are respectively distributed for tangent section endpoint
After finding out the tangent section that tangent plane intersects with tri patch, if line segment endpoint is overlapped with tri patch vertex,
The index PIndex on the tri patch vertex is distributed into line segment endpoint as reference numerals；If line segment endpoint is on tri patch side
On, the total nPoints that the index EIndex on the tri patch side puts a spot is distributed into line segment endpoint as reference numerals.
Alternatively, the index PIndex on the tri patch vertex is added if line segment endpoint is overlapped with tri patch vertex
The total nEdges on side distributes to line segment endpoint as reference numerals；If line segment endpoint is on tri patch side, by tri patch
The index EIndex on the side distributes to line segment endpoint as reference numerals, need to only guarantee the label for cutting each endpoint in layer
Number is unique, same endpoints reference numerals are identical.
2.7, tangent section is stored
After finding out tangent section and distributing endpoint index, according to the tangent plane height where tangent section, it is deposited into corresponding
Cut the tangent section set Lines of layerjIn.
2.8, i=i+1 is enabled, judges whether i is greater than n, if more than then performing the next step, otherwise transfers next triangular facet
Piece goes to step 2.3.Complete the storage of the tangent section of all tri patch.
Preferably, transferring tri patch asks the process of meet line segment that can improve efficiency by parallel computation.(i.e. multiple triangles
Dough sheet carries out simultaneously)
Step 3 is ranked up cross-sectional contour
3.1, it transfers first layer and cuts layer, layer is cut for first layer, at this time j=1；
3.2, unordered container is established
New construction body Info is established, the information of storage includes the reference numerals of extreme coordinates P and two adjacent endpoints
(NeighborNumber1, NeighborNumber2), as shown in Figure 6.With endpoint reference numerals Number and structural body Info
It is key-value (key-value) to unordered container NumberInfo is established, as shown in Figure 7.At the beginning of unordered container NumberInfo
Begin as sky, i.e., no any element of storage；
3.3, vertex is welded, and the common end by merging adjacent segments constructs relationship maps
Transfer all tangent sections in this layer of Lines and carry out vertex welding, first determine whether be in unordered container NumberInfo
It is no to exist using the reference numerals of line segment endpoint as the element of keyword key, if it does not exist, established in a reservoir with the number as pass
The new element of key word key, extreme coordinates P is the extreme coordinates, first abutting end in value Value (i.e. structural body Info)
The reference numerals NeighborNumber1 of point is the reference numerals of its adjacent endpoint；If existing, its direct adjacent endpoint
Reference numerals are assigned to the reference numerals NeighborNumber2 of second adjacent endpoint in value Value (i.e. structural body Info)
(the reference numerals NeighborNumber1 of first adjacent endpoint assignment).After this layer of all tangent section vertex welding,
Common end by merging consecutive tangent section completes the building of adjacent endpoint reference numerals relationship maps.
3.4, profile orderings obtain the profile of a complete closure
According to relationship maps, appoints from unordered container and take an element, by the endpoint of its value Value (i.e. structural body Info)
Coordinate of the coordinate P as first vertex of cross-sectional contour, then appoints the reference numerals for taking an adjacent endpoint
(NeighborNumber1 or NeighborNumber2) is that search key is searched, after finding second element, with
Coordinate of the extreme coordinates P of the value Value (i.e. structural body Info) of second element as second vertex of profile, and its two
There is the keyword key for transferring element for upper one, to be correctly ordered cross-sectional contour, need in the reference numerals of a adjacent endpoint
Taking another reference numerals is that search key is searched, and transfers member until the reference numerals of taking-up are first repeatedly
The keyword key of element, that is, find first vertex, in the cross-sectional contour that this just obtains a complete closure, and in the row of lookup
Redundant points can be deleted in program process, it will be in the profile set Polys of obtained profile deposit current layer.
3.5, after obtaining a profile, the element searched in unordered container is deleted, judges whether unordered container is sky,
It is then performed the next step for sky, does not go to 3.4 then for sky.
3.6, enable j=j+1, judge whether j is greater than N, if more than then performing the next step, otherwise transfer it is next cut layer, turn
To 3.2.
Preferably, the process for carrying out profile orderings can be improved efficiency by parallel computation.
Step 4, cut layer calculating terminate, export cross-sectional contour.
The present invention, which passes through, simplifies the index information that topology information building process only constructs tri patch side and vertex, reduces
Topology information constructs time and topology information stored memory；It is to seek friendship object with tri patch, primary traversal can acquire all
Tangent section drastically reduces the call number of tri patch；Cross-sectional contour can be obtained in linear session, significantly improved
Cut a layer efficiency.
Claims (9)
1. a kind of STL model efficient parallel based on concurrent welding sequence cuts layer method, which comprises the following steps:
Step 1 reads STL model, constructs the index information on tri patch vertex and side, and the vertex for obtaining all tri patch is sat
Mark, vertex index and side index, and include tri patch sum n, unduplicated vertex sum nPoints and unduplicated side
Total nEdges；
Step 2 calculates all tangent sections, and respectively distributes a reference numerals for tangent section endpoint: according to cutting layer thickness H and model
In the minimum value Zmin and maximum value Zmax of Z-direction, finds out and always cut the number of plies；Utilize the tangent plane collection intersected with tri patch
It closes, calculates the tangent section that all tri patch intersect with tangent plane, respectively distribute a unique reference numerals for tangent section endpoint；
Step 3 is ranked up cross-sectional contour: successively transferring and cuts layer, transfers all tangent sections in this layer of Lines and carry out vertex weldering
It connects, the common end by merging adjacent segments constructs relationship maps；According to relationship maps, obtain a complete closure cuts layer
Profile deletes redundant points, by the profile set of obtained profile deposit current layer；
Step 4, cut layer calculating terminate, export cross-sectional contour.
2. the STL model efficient parallel according to claim 1 based on concurrent welding sequence cuts layer method, feature exists
In, step 1 constructs the index information on tri patch vertex and side, specifically includes the following steps:
1.1, storage container is established:
Establish the associated container PointToIndex on storage vertex and vertex index, storage while and while the associated container that indexes
EdgeToIndex establishes the storage container of storage tri patch informationWherein P1 i、P2 i、
P3 iThree apex coordinates of respectively i-th tri patch,Respectively i-th of triangle
The index on three vertex of dough sheet, n indicate tri patch sum；
1.2, the index information on tri patch vertex and side is constructed
It is successively read the tri patch in STL model included, judges whether three vertex of tri patch are present in association and hold
In device PointToIndex, whether three sides are present in associated container EdgeToIndex, are obtained if existing corresponding
Vertex or side are then stored in corresponding associated container if it does not exist by index, and the element that the associated container after being stored into is stored
Quantity is as index；After obtaining apex coordinate, vertex index and the side index information of tri patch, these information are stored in Ti；
It is total to obtain the apex coordinates of all tri patch, vertex index and side index and tri patch sum n, unduplicated vertex
The total nEdges of number nPoints and unduplicated side；
1.3, model is obtained in the minimum value and maximum value of Z-direction.
3. the STL model efficient parallel according to claim 2 based on concurrent welding sequence cuts layer method, feature exists
In, step 2 respectively distributes a reference numerals for tangent section endpoint, specifically includes the following steps:
2.1, it establishes and cuts a layer storage container
A layer storage container L is cut in foundationj{Linesj,Polysj,Zj, j=1,2, N；Wherein, LinesjIt indicates to cut for j-th
The tangent section set stored in layer, PolysjIt indicates to cut the cross-sectional contour set stored in layer, Z j-thjIt indicates to cut a layer institute j-th
Level, N expression always cut the number of plies；
2.2, first tri patch is transferred, and for first tri patch, at this time i=1；
2.3, tri patch is obtained in the minimum value and maximum value of Z-direction；
2.4, the tangent plane set intersected with tri patch is obtained；
2.5, the tangent section that the tri patch intersects with tangent plane is calculated；
2.6, a unique reference numerals are respectively distributed for tangent section endpoint；
2.7, it stores tangent section: according to the tangent plane height where tangent section, being deposited into the tangent section set for accordingly cutting layer
LinesjIn；
2.8, i=i+1 is enabled, the storage of the tangent section of all tri patch is completed.
4. the STL model efficient parallel according to claim 3 based on concurrent welding sequence cuts layer method, feature exists
In step 2.5 calculates the tangent section that tri patch intersects with tangent plane, comprising:
There are two intersection point, two intersection points constitute two endpoints of tangent section for tangent plane and tri patch；It is cut when tri patch is located at
In plane, when tangent plane only intersects with a vertex of tri patch, do not calculate；When tangent section is a line of tri patch,
Tangent section when only storage third vertex Z coordinate is less than tangent plane height.
5. the STL model efficient parallel according to claim 3 based on concurrent welding sequence cuts layer method, feature exists
In step 2.6 is that tangent section endpoint respectively distributes a reference numerals, if line segment endpoint is overlapped with tri patch vertex, by three
The index PIndex on the edged surface piece vertex distributes to line segment endpoint as reference numerals；If line segment endpoint on tri patch side,
The total nPoints that the index EIndex on the tri patch side puts a spot is distributed into line segment endpoint as reference numerals.
6. the STL model efficient parallel according to claim 3 based on concurrent welding sequence cuts layer method, feature exists
In step 2.6 is that tangent section endpoint respectively distributes a reference numerals, if line segment endpoint is overlapped with tri patch vertex, by three
The index PIndex on the edged surface piece vertex distributes to line segment endpoint as reference numerals plus the total nEdges on side；If the extremity of segment
The index EIndex on the tri patch side is distributed to line segment endpoint as reference numerals on tri patch side by point.
7. the STL model efficient parallel according to claim 3 based on concurrent welding sequence cuts layer method, feature exists
In step 2.2 transfers tri patch and the process of meet line segment is asked to pass through parallel computation.
8. the STL model efficient parallel according to claim 3 based on concurrent welding sequence cuts layer method, feature exists
In, step 3 is ranked up cross-sectional contour, specifically includes the following steps:
3.1, it transfers first layer and cuts layer, layer is cut for first layer, at this time j=1；
3.2, unordered container is established
New construction body Info is established, the information of storage includes the reference numerals of extreme coordinates P and two adjacent endpoints
(NeighborNumber1, NeighborNumber2), using endpoint reference numerals Number and structural body Info as key-value
(key-value) to establishing unordered container NumberInfo；
3.3, vertex is welded, and the common end by merging adjacent segments constructs relationship maps；
3.4, profile orderings obtain the profile of a complete closure
According to relationship maps, appoints from unordered container and take an element, using the extreme coordinates P of its value Value as cross-sectional contour
First vertex coordinate, then appoint the reference numerals for taking an adjacent endpoint be search key searched, find
After second element, using the extreme coordinates P of the value Value of second element as the coordinate on second vertex of profile, and its
There is the keyword key for transferring element for upper one in the reference numerals of two adjacent endpoints, takes another reference numerals to be
Search key is searched, until the reference numerals of taking-up are first keyword key for transferring element, obtain one it is complete
Closed cross-sectional contour is stored in the profile set Polys of current layer；
3.5, after obtaining a profile, the element searched in unordered container is deleted, judges whether unordered container is empty, is empty
It then performs the next step, does not go to 3.4 then for sky；
3.6, enable j=j+1, judge whether j is greater than N, if more than then performing the next step, otherwise transfer it is next cut layer, go to
3.2。
9. cutting layer method according to the STL model efficient parallel based on concurrent welding sequence that claim 8 is stated, which is characterized in that
The process for carrying out profile orderings passes through parallel computation.
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 true CN109325316A (en) | 2019-02-12 |
| CN109325316B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110356008A (en) * | 2019-07-03 | 2019-10-22 | 浙江大学 | A kind of quick joining method of line segment at random based on Hash table |
| CN112733318A (en) * | 2020-11-27 | 2021-04-30 | 厦门理工学院 | Self-adaptive mesh 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 |
Citations (4)
| 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 |
| WO2017043712A1 (en) * | 2015-09-08 | 2017-03-16 | 한국생산기술연구원 | Method for slicing three-dimensional shape data object for reducing number of calculations |
| CN106600710A (en) * | 2016-10-18 | 2017-04-26 | 浙江大学 | Layered machining multi-connected-domain construction method of adjacency topological correlation of geometric network model |
-
2018
- 2018-11-15 CN CN201811360298.1A patent/CN109325316B/en active Active
Patent Citations (4)
| 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 |
| WO2017043712A1 (en) * | 2015-09-08 | 2017-03-16 | 한국생산기술연구원 | Method for slicing three-dimensional shape data object for reducing number of calculations |
| CN106600710A (en) * | 2016-10-18 | 2017-04-26 | 浙江大学 | Layered machining multi-connected-domain construction method of adjacency topological correlation of geometric network model |
Non-Patent Citations (2)
| Title |
|---|
| DONG-XING WANG 等: "Slicing of CAD models in color STL format", 《COMPUTERS IN INDUSTRY》 * |
| 马旭龙 等: "基于OpenMP的快速并行分层算法", 《计算机辅助设计与图形学学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110356008A (en) * | 2019-07-03 | 2019-10-22 | 浙江大学 | A kind of quick joining method of line segment at random based on Hash table |
| CN112733318A (en) * | 2020-11-27 | 2021-04-30 | 厦门理工学院 | Self-adaptive mesh subdivision method, device, equipment and storage medium |
| 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 |
| WO2023102583A1 (en) * | 2021-12-09 | 2023-06-15 | Akin Mehmet Bugra | Method for additively manufacturing a workpiece |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109325316B (en) | 2020-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109325316A (en) | STL model efficient parallel based on concurrent welding sequence cuts layer method | |
| CN104331555B (en) | A kind of sliced sheet processing method for being directed to the non-close STL models with border | |
| CN101510225B (en) | STL model boolean operation method of products | |
| WO2021068933A1 (en) | Method for automatically planning surgical path of pedicle screw on basis of deep learning network | |
| Abraham et al. | Hierarchical hub labelings for shortest paths | |
| CN104252489B (en) | A method of position character description information is quickly obtained according to longitude and latitude data | |
| CN107067471B (en) | Self-adaptive scanning speed method for improving forming quality of pendant model | |
| CN102289991B (en) | Visual-variable-based automatic classification and configuration method of map lettering | |
| CN106780458B (en) | Point cloud framework extraction method and device | |
| CN108241712A (en) | A kind of map data processing method and device | |
| CN112140552B (en) | In-situ 3D printing curved surface layering and path planning method | |
| CN107330901B (en) | Skeleton-based object component decomposition method | |
| CN106095907A (en) | Based on the laser point cloud data management method that Octree is integrated with three-dimensional R star tree | |
| CN108338848A (en) | Stripping type laser tooth preparation method, apparatus, equipment and medium | |
| CN109872396A (en) | A kind of quick cross section profile generation method suitable for triangle grid model | |
| CN108389243A (en) | A kind of multiple dimensioned Bézier curve piecewise fitting method of vector line feature | |
| 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 | |
| CN107680168A (en) | Lattice simplified method based on plane fitting in three-dimensional reconstruction | |
| CN106505575B (en) | A kind of Line Flow economic load dispatching method based on Granule Computing | |
| CN110176073A (en) | 3 D defects model automatic modeling and adaptive layered method | |
| CN102881039A (en) | Method for building three-dimensional vector models of trees based on three-dimensional laser scanning data | |
| CN102023616A (en) | Triangle Bezier curved surface numerical-control finishing tool-path quick generation method | |
| CN106125671A (en) | A kind of multiclass pel hybrid process method for optimizing route | |
| CN113312778A (en) | Unstructured grid generation method adaptive to model geometric characteristics |
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 |