CN110570509B - Grid-based model partition slicing method - Google Patents

Grid-based model partition slicing method Download PDF

Info

Publication number
CN110570509B
CN110570509B CN201910797602.7A CN201910797602A CN110570509B CN 110570509 B CN110570509 B CN 110570509B CN 201910797602 A CN201910797602 A CN 201910797602A CN 110570509 B CN110570509 B CN 110570509B
Authority
CN
China
Prior art keywords
contour
model
end point
printed
open
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
CN201910797602.7A
Other languages
Chinese (zh)
Other versions
CN110570509A (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.)
Huazhong University of Science and Technology
Original Assignee
Huazhong 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 Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201910797602.7A priority Critical patent/CN110570509B/en
Publication of CN110570509A publication Critical patent/CN110570509A/en
Application granted granted Critical
Publication of CN110570509B publication Critical patent/CN110570509B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G06T15/10—Geometric effects
    • G06T15/30—Clipping
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2210/00—Indexing scheme for image generation or computer graphics
    • G06T2210/12—Bounding box

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Geometry (AREA)
  • Computer Graphics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)

Abstract

The invention belongs to the field of additive manufacturing, and particularly discloses a grid-based model partition slicing method. The method comprises the following steps: calculating a bounding box of the model to be printed and setting a space grid for segmentation; calculating a bounding box of a current triangular patch in the model to be printed, judging whether the bounding box of the current triangular patch is intersected with the bounding box of the model to be printed, if so, storing the current triangular patch into a corresponding grid unit, otherwise, not performing any processing, and repeating the operation until all the triangular patches are traversed; slicing the triangular surface patch in the grid unit to obtain a contour line segment of the model to be printed; and performing cutting and closing processing on the obtained contour line segment to obtain a closed contour, thereby determining the 3D printing filling contour. The invention adopts the divide and conquer idea to respectively store the triangular patches of the model to be printed into the corresponding grid units, thereby greatly improving the execution efficiency of the algorithm and reducing the memory consumption of the computer.

Description

Grid-based model partition slicing method
Technical Field
The invention belongs to the field of additive manufacturing, and particularly relates to a grid-based model partition slicing method.
Background
Additive manufacturing techniques, also known as 3D printing, are used to directly additively manufacture parts, primarily by building up material layer by layer, without regard to the complexity of the part geometry. In the printing manufacturing application facing the large-size model, the forming size of the additive manufacturing equipment which is currently mainstream is small due to the limitation of the additive manufacturing process. Since the forming range of one print head is limited, in practical applications, the forming size of an additive manufacturing apparatus may be enlarged by expanding a plurality of "print heads" to enlarge a single-layer scanning area of the additive manufacturing apparatus, which is defined as multi-print-head additive manufacturing (MPH-AM).
Additive manufacturing of large-size models based on MPH-AM often requires that the outline filling area of a corresponding printing head is generated respectively aiming at the scanning area of the printing head. In order to obtain the partitioned filling areas with different printing models, the methods currently used can be roughly divided into two types: (1) the first type: 3D segmentation followed by 2D slicing strategy, i.e.: firstly, according to the responsible area of each printing head, 3D level division is carried out on a printing model, so that the model is disassembled into different small block submodels, then conventional 'model discrete slice' and 'level filling area generation' processing are carried out on the small block submodels, and finally 'level filling area' data belonging to different printing heads can be obtained; (2) the second type: 2D slicing and then contour 2D clipping strategies, namely: firstly, carrying out 'model discrete slicing' processing on a printing model to obtain 'hierarchical filling areas', wherein the currently obtained filling areas are complete filling area results after model discrete slicing, then contour cutting needs to be carried out on the complete filling areas, and Boolean operation needs to be carried out on the 2D contours according to the scanning area range responsible for each printing head to obtain sub-filling area results to which each printing head belongs.
The conventional method for generating the partitioned contour is applied to MPH-AM for printing and manufacturing large-size models, and the following problems exist: (1) the generation of intermediate data is inevitably required and the conventional method is not efficiently performed. Such as: with the strategy of first 3D segmentation and then 2D slicing, the printing model needs to be segmented by 3D segmentation software, sub-models with 2D-mainfold attributes are generated, and then model slicing is performed by using the sub-models. In practical practice, the sub-model capable of stably and reliably generating the 2 d-manual attribute by using the model segmentation technology needs further research, and the generated sub-model often needs to be repaired again manually. For the method adopting the strategy of cutting the original model in 2D first and then in 2D contour, as the original model needs to be cut to obtain the complete contour of the cut slice, and then Boolean operation is carried out on the complete contour, the 2D cutting result data of the original model is generated, the memory consumption is increased, and then the BOOLEAN operation is carried out on a large number of 2D contours, the execution efficiency of the algorithm is not high. (2) For printing and manufacturing large-size models, the file size of the model is often large, which causes the data size of the model file to be a problem to be considered, and the execution time of the conventional algorithm and the precious computing memory consumption are further aggravated when the conventional method is adopted. Based on the above problems, the additive manufacturing method is not suitable for further popularization and application of the MPH-AM-based large-size model additive manufacturing.
Disclosure of Invention
In view of the above-mentioned drawbacks and/or needs of the prior art, the present invention provides a method for partitioning and slicing a model based on a mesh, in which a triangular patch of a model to be printed is classified according to a partition concept, so that the execution efficiency of an algorithm can be effectively improved, and the memory consumption of a computer can be reduced, thereby being particularly suitable for applications such as additive manufacturing.
In order to achieve the above object, the present invention provides a grid-based model partition slicing method, which comprises the following steps:
s1, calculating a bounding box of the model to be printed and carrying out a space grid divided according to the setting of the bounding box;
s2, calculating a bounding box of a current triangular patch in the model to be printed, judging whether the bounding box of the current triangular patch is intersected with the bounding box of the model to be printed, if so, storing the current triangular patch into a corresponding grid unit, otherwise, not performing any processing on the current triangular patch, and repeating the operations until all triangular patches in the model to be printed are traversed;
s3, slicing the triangular patches in each grid unit obtained in the step S2 to obtain contour line segments of the model to be printed;
s4 performs clipping and closing processing on the contour line segment obtained in the step S3 to obtain a closed contour, thereby determining a 3D printing fill contour for each mesh cell.
As a further preference, the step S4 includes the following sub-steps:
s41, for the contour line segment obtained in the step S3, cutting the contour line segment by using a rectangle corresponding to the height of the contour line segment in the grid cell, and reserving the contour in the rectangle;
s42, if the cut outline is a closed outline, directly storing the closed outline, and if the cut outline is an open outline, turning to S43;
s43, carrying out closing processing on the open contour by utilizing a mode of counterclockwise connecting closing processing, thereby obtaining a closed contour;
s44 takes the closed contour obtained in the steps S42 and S43 as the 3D printing fill contour of the mesh cell.
As a further preference, the step S43 includes the following sub-steps:
s431, judging the symbols of the rectangular corners, recording the corners positioned inside the model to be printed as internal corners, and recording the corners positioned outside the model to be printed as external corners;
s432 defines four sides of the rectangle as Edge0, Edge1, Edge2, and Edge3, respectively, in a counterclockwise order, and defines four corners as Corner0, Corner1, Corner2, and Corner3, respectively, in a counterclockwise order, if an end point of the open contour is on a certain side of the rectangle, it is defined that the end point belongs to the corresponding side, if the end point of the open contour is on a certain Corner of the rectangle, it is defined that Corner0 belongs to Edge0, Corner1 belongs to Edge1, Corner2 belongs to Edge2, and Corner3 belongs to Edge 3;
s433, storing the end points of the open contour into corresponding end point sets according to the rule of the step S432, and deleting overlapped end points;
s434, three counterclockwise connecting and closing processes are performed on the end points in each of the end point sets and the inner corners in the rectangle, so as to obtain a closed contour.
As a further preferred method, in step S434, the end points located at the corners of the rectangle are first subjected to counterclockwise connection and sealing processing, then the internal corners are subjected to counterclockwise connection and sealing processing, and finally the remaining end points in the end point set are subjected to counterclockwise connection and sealing processing.
Further preferably, the counterclockwise connection closing process in step S434 includes the steps of:
(a) using the end point or the inner corner of any one open contour C as the new contour ClinkIf the end point of another open contour C 'is met, the step (b) is carried out, and if the end point of the other open contour C' is met, the step (C) is carried out;
(b) judging whether the end point of the open contour C' is the other end point of the open contour C, if so, establishing the newly-built contour ClinkOutputting the closed contour, and proceeding to the step (d), if not, adding the end point of the open contour C' to the new contour ClinkAnd continuing the counterclockwise connection closing process from the other end point of the open contour C' until a closed contour is obtained, and proceeding to step (d);
(c) judging whether the internal corner is the other end point of the open profile C or not, if so, establishing the newly-built profile ClinkOutputting the contour as a closed contour, and turning to the step (d), if not, adding the internal corner to the newly-built contour ClinkContinuing to perform counterclockwise connecting and sealing treatment from the inner corner until a closed contour is obtained, and turning to the step (d);
(d) creating the new contour ClinkThe end points of the middle connection are removed from the set of end points and the interior corners are marked as exterior corners.
As a further preference, the mesh-based model zone slicing method is preferably used for a powder bed process or a stereolithography process.
As a further preference, the 3D printed fill profile obtained in step S4 is used in a path planning process in additive manufacturing.
Generally, compared with the prior art, the above technical solution conceived by the present invention mainly has the following technical advantages:
1. according to the invention, the characteristics of large volume and large size of the model to be printed are fully considered, the space grid to be segmented is arranged according to the bounding box of the model to be printed, the dividing and treating concept is adopted, the triangular surface patches of the model to be printed are respectively stored in the corresponding grid units, and the triangular surface patches in each grid unit are subjected to slicing treatment and anticlockwise connection sealing treatment, so that the complexity of the problem is greatly reduced, the flow of obtaining the slicing profile in the conventional method is simplified, the efficiency of partitioning and slicing is further improved, and meanwhile, the large consumption of the memory resource of a computer can be avoided;
2. particularly, the invention can fully consider various situations in practical application by optimizing the process of the counterclockwise connection closing processing, and further improve the execution efficiency of the algorithm.
Drawings
FIG. 1 is a schematic flow chart of a method for partitioning and slicing a grid-based model according to the present invention;
fig. 2 is a schematic diagram of the division of the model to be printed in step S1;
fig. 3 is a schematic diagram of a triangular patch in each mesh unit obtained in step S2;
FIG. 4 is a schematic diagram of contour line segments in a certain grid cell in step S3;
fig. 5 is a schematic diagram illustrating the determination of rectangular corner symbols in a certain grid cell in step S431;
fig. 6 is a schematic diagram of four sides and four corners of a rectangle in a certain grid cell in step S432;
fig. 7 is a schematic diagram of the correspondence relationship between a certain endpoint set in step S433;
fig. 8 is a schematic diagram of the classification of the end points of the open contour and the corners of the rectangle in step S43, wherein (a) is an overlapped end point type, i.e. two open contours are overlapped at a certain end point, (b) is a corner end point type, i.e. the end points of the open contour are at the corners of the rectangle, (c) is an internal corner type, i.e. the corners of the rectangle are internal corners, and (d) is a normal end point type, i.e. not conforming to the above three types;
fig. 9 is a schematic diagram of the 3D printing of the filling outline by a certain mesh unit in step S4.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
As shown in fig. 1, the present invention provides a grid-based model partition slicing method, which includes the following steps:
s1 as shown in FIG. 2, calculating bounding boxes of the model to be printed and carrying out the space grid segmentation according to the setting;
s2, as shown in fig. 3, calculating a bounding box of a current triangular patch in the model to be printed, and determining whether the bounding box of the current triangular patch intersects with the bounding box of the model to be printed, if so, saving the current triangular patch in a corresponding mesh unit, otherwise, not performing any processing on the current triangular patch, and repeating the above operations until all triangular patches in the model to be printed are traversed;
s3 as shown in FIG. 4, the triangular patches in each grid unit obtained in step S2 are sliced to obtain contour line segments of the model to be printed;
s4 as shown in fig. 9, the contour line segments obtained in step S3 are cut and closed to obtain a closed contour, so as to determine the 3D printing filling contour of each grid cell, and the filling contour is directly used in the path planning process in the additive manufacturing.
Further, step S4 includes the following sub-steps:
s41, cutting the contour line segment obtained in the step S3 by using a rectangle corresponding to the height of the contour line segment in the grid cell, and reserving the contour in the rectangle;
s42, if the cut outline is a closed outline, directly storing the closed outline, and if the cut outline is an open outline, turning to S43;
s43, carrying out closing processing on the open contour by utilizing a mode of counterclockwise connecting closing processing, thereby obtaining a closed contour;
s44 takes the closed contour obtained in steps S42 and S43 as the 3D printing fill contour of the mesh cell.
Further, step S43 includes the following sub-steps:
s431, as shown in fig. 5, determining the sign of the corner of the rectangle, and recording the corner inside the model to be printed as an inside corner, and recording the corner outside the model to be printed as an outside corner;
s432, as shown in fig. 6, defines four sides of a rectangle as Edge0, Edge1, Edge2 and Edge3 in a counterclockwise order, and defines four corners as Corner0, Corner1, Corner2 and Corner3 in a counterclockwise order, if an end point of the open contour is on a certain side of the rectangle, it is defined that the end point belongs to the corresponding side, if an end point of the open contour is on a certain Corner of the rectangle, it is defined that Corner0 belongs to Edge0, Corner1 belongs to Edge1, Corner2 belongs to Edge2, and Corner3 belongs to Edge 3;
s433, as shown in fig. 7, saving the end points of the open contour to the corresponding end point set according to the rule of step S432, and deleting the overlapped end points, that is, the type of (a) in fig. 8;
more specifically, the process of deleting overlapping endpoints is: overlap contour C to be newly addednewIs removed from the respective set of endpoints while simultaneously overlapping the original contour CorigionIs removed from the respective set of endpoints, overlapping contour CnewIs deleted and added to the overlapping contour CorigionTo obtain an overlapping contour Corigion', will eventually overlap the contour Corigion' the two endpoints are remapped to the corresponding endpoint sets, if a re-occurrence occurs againIf the end point is overlapped, the process is recursively called until the end point overlapping condition does not occur;
s434 performs three counterclockwise connecting and closing processes on the end points in each end point set and the inner corners in the rectangle, thereby obtaining a closed contour.
Further, in step S434, the counterclockwise connection and sealing process is performed on the end points located at the corners of the rectangle, i.e. the type in (b) in fig. 8, then the counterclockwise connection and sealing process is performed on the inner corners, i.e. the type in (c) in fig. 8, and finally the counterclockwise connection and sealing process is performed on the remaining end points in the end point set, i.e. the type in (d) in fig. 8.
Further, the counterclockwise connection closing process in step S434 includes the steps of:
(a) using the end point or the inner corner of any one open contour C as the new contour ClinkIf the end point of another open contour C 'is met, the step (b) is carried out, and if the end point of the other open contour C' is met, the step (C) is carried out;
(b) judging whether the end point of the open contour C' is the other end point of the open contour C, if so, newly building the contour ClinkOutputting the closed contour, and proceeding to step (d), if not, adding the end point of the open contour C' to the new contour ClinkAnd continuing the counterclockwise connection closing process from the other end point of the open contour C' until a closed contour is obtained, and proceeding to step (d);
(c) judging whether the inner corner is the other end point of the open profile C, if so, newly building the profile ClinkOutputting as a closed contour, and turning to the step (d), if not, adding the internal corner to the newly-built contour ClinkContinuing to perform counterclockwise connecting and sealing treatment from the inner corner until a closed contour is obtained, and turning to the step (d);
(d) new outline ClinkThe end points of the middle connection are removed from the set of end points and the interior corners are marked as exterior corners.
Further, the mesh-based model zone slicing method is preferably used for the powder bed process or the stereolithography process.
It will be understood by those skilled in the art that the foregoing is merely a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included within the scope of the present invention.

Claims (5)

1. A grid-based model partition slicing method is characterized by comprising the following steps:
s1, calculating a bounding box of the model to be printed and carrying out a space grid divided according to the setting of the bounding box;
s2, calculating a bounding box of a current triangular patch in the model to be printed, judging whether the bounding box of the current triangular patch is intersected with the bounding box of the model to be printed, if so, storing the current triangular patch into a corresponding grid unit, otherwise, not performing any processing on the current triangular patch, and repeating the operations until all triangular patches in the model to be printed are traversed;
s3, slicing the triangular patches in each grid unit obtained in the step S2 to obtain contour line segments of the model to be printed;
s4, cutting and closing the contour line segment obtained in the step S3 to obtain a closed contour, and determining the 3D printing filling contour of each grid cell;
the step S4 includes the following sub-steps:
s41, for the contour line segment obtained in step S3, cutting the contour line segment by using the rectangle in the grid cell corresponding to the height of the contour line segment, and retaining the contour in the rectangle;
s42, if the cut outline is a closed outline, directly storing the closed outline, and if the cut outline is an open outline, turning to S43;
s43, carrying out closing processing on the open contour by utilizing a mode of counterclockwise connecting closing processing, thereby obtaining a closed contour;
the step S43 includes the following sub-steps:
s431, recording corners inside the model to be printed as internal corners, and recording corners outside the model to be printed as external corners;
s432 defines four sides of the rectangle as Edge0, Edge1, Edge2, and Edge3, respectively, in a counterclockwise order, and defines four corners as Corner0, Corner1, Corner2, and Corner3, respectively, in a counterclockwise order, if an end point of the open contour is on a certain side of the rectangle, it is defined that the end point belongs to the corresponding side, if the end point of the open contour is on a certain Corner of the rectangle, it is defined that Corner0 belongs to Edge0, Corner1 belongs to Edge1, Corner2 belongs to Edge2, and Corner3 belongs to Edge 3;
s433, storing the end points of the open contour into corresponding end point sets according to the rule of the step S432, and deleting overlapped end points;
s434, performing three counterclockwise connecting and sealing processes on the end points in each end point set and the inner corners in the rectangle, so as to obtain a closed contour;
s44 takes the closed contour obtained in the steps S42 and S43 as the 3D printing fill contour of the mesh cell.
2. The grid-based model partition slicing method of claim 1, wherein in step S434, the end points located at the corners of the rectangle are first processed by counterclockwise connection closure, then the internal corners are processed by counterclockwise connection closure, and finally the remaining end points in the end point set are processed by counterclockwise connection closure.
3. The method for slicing partition based on grid model of claim 1 or 2, wherein the counterclockwise connection closing process in step S434 comprises the steps of:
(a) using the end point or the inner corner of any one open contour C as the new contour ClinkIs connected by moving counterclockwise along the boundary of the rectangleIf the end point of the other open contour C 'is met, the step (b) is carried out, and if the end point of the other open contour C' is met, the step (C) is carried out;
(b) judging whether the end point of the open contour C' is the other end point of the open contour C, if so, establishing the newly-built contour ClinkOutputting the closed contour, and proceeding to the step (d), if not, adding the end point of the open contour C' to the new contour ClinkAnd continuing the counterclockwise connection closing process from the other end point of the open contour C' until a closed contour is obtained, and proceeding to step (d);
(c) judging whether the internal corner is the other end point of the open profile C or not, if so, establishing the newly-built profile ClinkOutputting the contour as a closed contour, and turning to the step (d), if not, adding the internal corner to the newly-built contour ClinkContinuing to perform counterclockwise connecting and sealing treatment from the inner corner until a closed contour is obtained, and turning to the step (d);
(d) creating the new contour ClinkThe end points of the middle connection are removed from the set of end points and the interior corners are marked as exterior corners.
4. The mesh-based model zone slicing method of claim 1, wherein said mesh-based model zone slicing method is used for a powder bed process or a stereolithography process.
5. The mesh-based model zone slicing method of claim 1, wherein the 3D printed fill contour obtained in step S4 is used in a path planning process in additive manufacturing.
CN201910797602.7A 2019-08-27 2019-08-27 Grid-based model partition slicing method Active CN110570509B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910797602.7A CN110570509B (en) 2019-08-27 2019-08-27 Grid-based model partition slicing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910797602.7A CN110570509B (en) 2019-08-27 2019-08-27 Grid-based model partition slicing method

Publications (2)

Publication Number Publication Date
CN110570509A CN110570509A (en) 2019-12-13
CN110570509B true CN110570509B (en) 2021-07-02

Family

ID=68776308

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910797602.7A Active CN110570509B (en) 2019-08-27 2019-08-27 Grid-based model partition slicing method

Country Status (1)

Country Link
CN (1) CN110570509B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112528209B (en) * 2020-12-08 2024-04-12 四川蓉信开工程设计有限公司 Irregular box volume rate rapid calculation method based on divide-and-conquer idea
CN112677489B (en) * 2021-01-25 2022-03-08 中国科学院空间应用工程与技术中心 Printing path planning method and system and 3D printer
CN113591309B (en) * 2021-07-30 2024-03-15 深圳市创想三维科技股份有限公司 Model slicing method and device for 3D printing, computing terminal and storage medium
CN114103126B (en) * 2021-11-26 2022-11-18 南京衍构科技有限公司 3D printing scanning filling path planning method for revolving body with unequal wall thickness

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106200559A (en) * 2016-07-11 2016-12-07 湖南大学 A kind of rapid generation printing section for 3d
CN109191571A (en) * 2018-09-30 2019-01-11 华南理工大学 A method of gather materials using 3D printing technique preparation mechanical test standard

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6875940B2 (en) * 2003-07-25 2005-04-05 Leviton Manufacturing Co., Inc. Robust rocker switch mechanism
CN1773554A (en) * 2004-11-09 2006-05-17 中国石油天然气集团公司 A two-dimensional closed geological structure model building method
CN100585638C (en) * 2008-07-16 2010-01-27 永凯软件技术（上海）有限公司 Curved body three-dimensional boundary representation model reconstruction method and device based on line boundary
US10395372B2 (en) * 2016-06-28 2019-08-27 University Of Cincinnati Systems, media, and methods for pre-processing and post-processing in additive manufacturing
KR20230154476A (en) * 2016-07-27 2023-11-08 얼라인 테크널러지, 인크. Intraoral scanner with dental diagnostics capabilities

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106200559A (en) * 2016-07-11 2016-12-07 湖南大学 A kind of rapid generation printing section for 3d
CN109191571A (en) * 2018-09-30 2019-01-11 华南理工大学 A method of gather materials using 3D printing technique preparation mechanical test standard

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Wire and arc additive manufacture of high-building multi-directional pipe joint;Dai Yili 等;《The International Journal of Advanced Manufacturing Technology》;20180222;第2389-2396页 *
基于STL模型的复杂曲面加工刀具轨迹规划方法研究;钱乘;《中国优秀硕士学位论文全文数据库》;20190815(第08期);第B022-612页 *

Also Published As

Publication number Publication date
CN110570509A (en) 2019-12-13

Similar Documents

Publication Publication Date Title
CN110570509B (en) Grid-based model partition slicing method
US10940646B2 (en) Method and system for rapid and efficient three-dimensional printing
US10346708B2 (en) Image processing method
US10303822B2 (en) Systems and methods of designing geometry of tool set in a numerical simulation of sheet metal forming operations including springback compensation
US7310097B2 (en) Method, apparatus and computer program product enabling a dynamic global parameterization of triangle meshes over polygonal domain meshes
CN102436217B (en) Method for reconstructing web processing drive geometry of slot characteristic of aircraft structure
CN110675508B (en) BIM model geometric figure simplifying method
CN103136790A (en) Creating a surface from a plurality of 3d curves
JP2005038219A (en) Method for generating volume data from boundary expression data and program therefor
CN115994410B (en) Aircraft simulation driving design method based on octree refinement tetrahedral mesh
Zhang et al. Dual contouring for domains with topology ambiguity
JP4664218B2 (en) Mesh model generation system
Liu et al. Toolpath generation for partition machining of T-spline surface based on local refinement
CN108304686A (en) A kind of adaptive dynamic evolution computational methods of roughing process
Geng et al. Feature recognition and volume generation of uncut regions for electrical discharge machining
CN114660991A (en) Curved surface regional circular cutting processing track generation method
CN114429535A (en) Smooth cutting method and device for triangular mesh curved surface
US11640485B1 (en) Generating CAD models from topology optimization data
CN112381950A (en) Grid hole repairing method, electronic equipment and computer readable storage medium
CN116843861A (en) Three-dimensional model simplification method
CN116205100A (en) Method for optimizing CAE grid of battery pack
Navangul et al. A vertex translation algorithm for adaptive modification of STL file in layered manufacturing
CN114119628A (en) Point cloud accurate segmentation method based on feature template
Kawamura et al. A strategy of automatic hexahedral mesh generation by using an improved whisker-weaving method with a surface mesh modification procedure
CN118097067B (en) Triangular mesh model curved surface expansion method based on filtering processing

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