Automatic multi-direction slicing algorithms for wire based additive manufacturing

Ding, Donghong; Pan, Zengxi; Cuiuri, Dominic; Li, Huijun; Larkin, Nathan; Duin, Stephen van

doi:10.1016/j.rcim.2015.09.002

Cited by 146 publications

(60 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Feng et al [10] developed a repair volume extraction method that integrates surface reconstruction and repair volume extraction in additive repair. Ding et al [11] proposed an automatic multi-direction slicing algorithm to deal with components with a large number of holes by additive manufacturing. Li et al [12] proposed a systematic framework to aid the reverse engineering-based additive repair process of worn parts, in which they utilized a Boolean operation to yield a parameterized geometric representation of the repair volume of two mesh models.…”

Section: Additive Manufacturing Repairmentioning

confidence: 99%

A Fast Hole-Filling Method for Triangular Mesh in Additive Repair

et al. 2020

View full text Add to dashboard Cite

In the triangular meshes obtained in additive repair, it is a challenge to find one single hole-filling method to close all holes and make the filling patches assort with surrounding meshes well with low time complexity, which is mainly caused by the shape complexity and size difference of the various holes, especially in the fields of intelligent manufacturing, 3D measurement, and reverse engineering. Therefore, it is reasonable to adopt different algorithms to fill different types of holes. In this research, a fast hole-filling method for triangular mesh is proposed based on the hole size. First, a group of basic concepts is defined to make them uniform throughout the whole text, followed by the descriptions of hole detection and boundary cleaning. Second, three different algorithms are developed to fill the small-sized, middle-sized, and large-sized holes classified by hole size respectively, which can fill all the detected holes in a fast and proper manner. Finally, two experiments are carried out to verify the efficiency, robustness, and ability to recover the shape of our method. Compared to two state-of-the-art hole-filling methods in the first experiment, the quantitative evaluation results demonstrate that our proposed method is much faster than them with the ability to guarantee the regularity of most filling triangles. The second experiment proves that our method can produce satisfactory filling results by making the filling patches be compatible with surrounding meshes well.

show abstract

Section: Additive Manufacturing Repairmentioning

confidence: 99%

A Fast Hole-Filling Method for Triangular Mesh in Additive Repair

et al. 2020

View full text Add to dashboard Cite

show abstract

“…References [25,26] apply an error minimization algorithm, which segments the mesh model and produces a diferent slicing direction for each computed sub-mesh. Reference [27] maps surface normals to the unit sphere and solves an optimization problem inside this sphere. The optimization procedure results in a slicing function that produces non-parallel slicing planes.…”

Section: Non-parallel-planes Mesh Slicingmentioning

confidence: 99%

“…The computation of critical 0-manifold points is performed in lines[16][17][18][19][20][21][22][23][24][25][26][27][28][29][30], where each vertex is tested as a local minimum (or maximum). (4) Finally, lines 31-40 perform the computation of closed and oriented contours, including degenerate and non-degenerate saddle points.…”

mentioning

confidence: 99%

Level Sets of Weak-Morse Functions for Triangular Mesh Slicing

et al. 2020

View full text Add to dashboard Cite

In the context of CAD CAM CAE (Computer-Aided Design, Manufacturing and Engineering) and Additive Manufacturing, the computation of level sets of closed 2-manifold triangular meshes (mesh slicing) is relevant for the generation of 3D printing patterns. Current slicing methods rely on the assumption that the function used to compute the level sets satisfies strong Morse conditions, rendering incorrect results when such a function is not a Morse one. To overcome this limitation, this manuscript presents an algorithm for the computation of mesh level sets under the presence of non-Morse degeneracies. To accomplish this, our method defines weak-Morse conditions, and presents a characterization of the possible types of degeneracies. This classification relies on the position of vertices, edges and faces in the neighborhood outside of the slicing plane. Finally, our algorithm produces oriented 1-manifold contours. Each contour orientation defines whether it belongs to a hole or to an external border. This definition is central for Additive Manufacturing purposes. We set up tests encompassing all known non-Morse degeneracies. Our algorithm successfully processes every generated case. Ongoing work addresses (a) a theoretical proof of completeness for our algorithm, (b) implementation of interval trees to improve the algorithm efficiency and, (c) integration into an Additive Manufacturing framework for industry applications.

show abstract

“…Slicing algorithm of 3D STL model has been widely reported [28]. In this paper, a tolerant slicing algorithm was used and detailed information could be found elsewhere [29].…”

Section: Automated Arc-welding-based Additive Manufacturing Systemmentioning

confidence: 99%