Lattice structure lightweight triangulation for additive manufacturing

Abstract Additive manufacturing offers new available categories of geometries to be built. Among those categories, one can find the well developing field of lattice structures. Attention has been paid on lattice structures for their lightweight and mechanical efficiency ratio, thus leading to more optimized mechanical parts for systems. However this lightness only holds true from a mass related point of view. The files sent to additive manufacturing machines are quite large and can go up to such sizes that machines can freeze and get into malfunction. This is directly related to the lattice structures tendency to be of a high geometric complexity. A large number of vertices and triangles are necessary to describe them geometrically, thus leading to larger file sizes. With the increasing use of lattice structures, the need for their files to be lighter is also rising. This paper aims at proposing a method for tessellating a certain category of such structures, using topologic and geometric criteria to generate as few as possible triangles, thus leading to lightweight files. The triangulation technique is driven by a chordal error that controls the deviation between the exact and tessellated structures. It uses interpolation, boolean as well as triangulation operators. The method is illustrated and discussed through examples from our prototype software.

[1]  J. Pernot,et al.  Repairing triangle meshes built from scanned point cloud , 2007 .

[2]  Sundaresan Raman,et al.  Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table , 2008, Comput. Graph. Forum.

[3]  John C. Tipper,et al.  Simple and Robust Boolean Operations for Triangulated Surfaces , 2013, Mathematics.

[4]  Timothy J. Baker,et al.  Analysis of triangle quality measures , 2003, Math. Comput..

[5]  Sâm Landier.  Boolean operations on arbitrary polygonal and polyhedral meshes , 2017, Comput. Aided Des..

[6]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[7]  Charlie C. L. Wang,et al.  The status, challenges, and future of additive manufacturing in engineering , 2015, Comput. Aided Des..

[8]  Wei Zhao,et al.  A Robust Hole-Filling Algorithm for Triangular Mesh , 2007, CAD/Graphics.

[9]  Yen-Chu Hung,et al.  Hole filling of triangular mesh segments using systematic grey prediction , 2012, Comput. Aided Des..

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  B Notarberardino,et al.  An efficient approach to converting three-dimensional image data into highly accurate computational models , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[12]  M. Buehler,et al.  The mechanics and design of a lightweight three-dimensional graphene assembly , 2017, Science Advances.

[13]  Alfred Gray,et al.  Modern differential geometry of curves and surfaces with Mathematica (2. ed.) , 1998 .

[14]  Bing-Yu Chen,et al.  Extended cubical marching squares for surface extraction from various kinds of volumetric structure , 2006, SIGGRAPH '06.

[15]  Alexei Mikchevitch,et al.  Merging enriched Finite Element triangle meshes for fast prototyping of alternate solutions in the context of industrial maintenance , 2010, Comput. Aided Des..

[16]  Arkady Tsinober,et al.  On the Status , 2014 .

[17]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[18]  Vadim Shapiro,et al.  The new frontiers in computational modeling of material structures , 2016, Comput. Aided Des..

[19]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.