Optimizing Object Decomposition to Reduce Visual Artifacts in 3D Printing

We propose a method for the automatic segmentation of 3D objects into parts which can be individually 3D printed and then reassembled by preserving the visual quality of the final object. Our technique focuses on minimizing the surface affected by supports, decomposing the object into multiple parts whose printing orientation is automatically chosen. The segmentation reduces the visual impact on the fabricated model producing non-planar cuts that adapt to the object shape. This is performed by solving an optimization problem that balances the effects of supports and cuts, while trying to place both in occluded regions of the object surface. To assess the practical impact of the solution, we show a number of segmented, 3D printed and reassembled objects.     

Saliency‐Preserving Slicing Optimization for Effective 3D Printing

We present an adaptive slicing scheme for reducing the manufacturing time for 3D printing systems. Based on a new saliency‐based metric, our method optimizes the thicknesses of slicing layers to save printing time and preserve the visual quality of the printing results. We formulate the problem as a constrained ?₀ optimization and compute the slicing result via a two‐step optimization scheme. To further reduce printing time, we develop a saliency‐based segmentation scheme to partition an object into subparts and then optimize the slicing of each subpart separately. We validate our method with a large set of 3D shapes ranging from CAD models to scanned objects. Results show that our method saves printing time by 30–40% and generates 3D objects that are visually similar to the ones printed with the finest resolution possible.     

Interactive Modeling of Cellular Structures on Surfaces with Application to Additive Manufacturing

The rich and evocative patterns of natural tessellations endow them with an unmistakable artistic appeal and structural properties which are echoed across design, production, and manufacturing. Unfortunately, interactive control of such patterns-as modeled by Voronoi diagrams, is limited to the simple two dimensional case and does not extend well tofreeform surfaces. We present an approach for direct modeling and editing of such cellular structures on surface meshes. The overall modeling experience is driven by a set of editing primitives which are efficiently implemented on graphics hardware. We feature a novel application for 3D printing on modern support-free additive manufacturing platforms. Our method decomposes the input surface into a cellular skeletal structure which hosts a set of overlay shells. In this way, material saving can be channeled to the shells while structural stability is channeled to the skeleton. To accommodate the available printer build volume, the cellular structure can be further split into moderately sized parts. Together with shells, they can be conveniently packed to save on production time. The assembly of the printed parts is streamlined by a part numbering scheme which respects the geometric layout of the input model.     

Feature preserving Delaunay mesh generation from 3D multi-material images

Generating realistic geometric models from 3D segmented images is an important task in many biomedical applications. Segmented 3D images impose particular challenges for meshing algorithms because they contain multi-material junctions forming features such as surface patches, edges and corners. The resulting meshes should preserve these features to ensure the visual quality and the mechanical soundness of the models. We present a feature preserving Delaunay refinement algorithm which can be used to generate high-quality tetrahedral meshes from segmented images. The idea is to explicitly sample corners and edges from the input image and to constrain the Delaunay refinement algorithm to preserve these features in addition to the surface patches. Our experimental results on segmented medical images have shown that, within a few seconds, the algorithm outputs a tetrahedral mesh in which each material is represented as a consistent submesh without gaps and overlaps. The optimization property of the Delaunay triangulation makes these meshes suitable for the purpose of realistic visualization or finite element simulations.     

Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram

We propose a new isotropic remeshing method, based on Centroidal Voronoi Tessellation (CVT) . Constructing CVT requires to repeatedly compute Restricted Voronoi Diagram (RVD) , defined as the intersection between a 3D Voronoi diagram and an input mesh surface. Existing methods use some approximations of RVD. In this paper, we introduce an efficient algorithm that computes RVD exactly and robustly. As a consequence, we achieve better remeshing quality than approximation-based approaches, without sacrificing efficiency. Our method for RVD computation uses a simple procedure and a kd -tree to quickly identify and compute the intersection of each triangle face with its incident Voronoi cells. Its time complexity is O ( m log n ), where n is the number of seed points and m is the number of triangles of the input mesh. Fast convergence of CVT is achieved using a quasi-Newton method, which proved much faster than Lloyd's iteration. Examples are presented to demonstrate the better quality of remeshing results with our method than with the state-of-art approaches.     

Feature Preserving Octree‐Based Hexahedral Meshing

We propose an octree‐based algorithm to tessellate the interior of a closed surface with hexahedral cells. The generated hexahedral mesh (1) explicitly preserves sharp features of the original input, (2) has a maximal, user‐controlled distance deviation from the input surface, (3) is composed of elements with only positive scaled jacobians (measured by the eight corners of a hex [SEK*07]), and (4) does not have self‐intersections. We attempt to achieve these goals by proposing a novel pipeline to create an initial pure hexahedral mesh from an octree structure, taking advantage of recent developments in the generation of locally injective 3D parametrizations to warp the octree boundary to conform to the input surface. Sharp features in the input are bijectively mapped to poly‐lines in the output and preserved by the deformation, which takes advantage of a scaffold mesh to prevent local and global intersections. The robustness of our technique is experimentally validated by batch processing a large collection of organic and CAD models, without any manual cleanup or parameter tuning. All results including mesh data and statistics in the paper are provided in the additional material. The open‐source implementation will be made available online to foster further research in this direction.     

Slice coherence in a query-based architecture for 3D heterogeneous printing

We report on 3D printing of artifacts with a structured, inhomogeneous interior. The interior is decomposed into cells defined by a 3D Voronoi diagram and their sites. When printing such objects, most slices the printer deposits are topologically the same and change only locally in the interior. The slicing algorithm capitalizes on this coherence and minimizes print head moves that do not deposit material. This approach has been implemented on a client/server architecture that computes the slices on the geometry side. The slices are printed by fused deposition, and are communicated upon demand.     

Procedural models for cartoon cracks and fractures animations

We present an approach for animating cracks and fractures in cartoon style. In our method we take a 2D hand-drawn object as input and then construct a 2.5D model of the object in order to approximate the object volume. Next, we generate the Voronoi textures on the 2.5D object model for visual abstraction of cartoon cracks. Further, cracking gaps on the Voronoi textures are widened progressively until Voronoi cells split apart and finally fall onto ground according to simplified physical rules. With minimum user intervention, our model is able to generate cartoon cracks and fractures animations procedurally, as demonstrated by examples given in the paper.     

基于UML的3D打印系统平台架构设计

针对小批量定制产品,3D打印可满足不同材料、工艺参数、加工精度等多种需求,但需要采用不同的3D打印方法加工零件,单一的打印设备很难满足不同客户的需求,建立一个3D加工中心服务平台,可为不同用户提供快速便捷的加工服务。UML作为面向对象建模语言,以多种视图的形式表示软件系统的静态结构和动态行为。用UML设计了3D打印系统平台的总体架构,为远程打印服务平台开发提供了具体的设计方案。     

Consistent Volumetric Discretizations Inside Self‐Intersecting Surfaces

Decades of research have culminated in a robust geometry processing pipeline for surfaces. Most steps in this pipeline, like deformation, smoothing, subdivision and decimation, may create self‐intersections. Volumetric processing of solid shapes then becomes difficult, because obtaining a correct volumetric discretization is impossible: existing tet‐meshing methods require watertight input. We propose an algorithm that produces a tetrahedral mesh that overlaps itself consistently with the self‐intersections in the input surface. This enables volumetric processing on self‐intersecting models. We leverage conformalized mean‐curvature flow, which removes self‐intersections, and define an intrinsically similar reverse flow, which prevents them. We tetrahedralize the resulting surface and map the mesh inside the original surface. We demonstrate the effectiveness of our method with applications to automatic skinning weight computation, physically based simulation and geodesic distance computation.     

Microstructure Control in 3D Printing with Digital Light Processing

Digital light processing stereolithography is a promising technique for 3D printing. However, it offers little control over the surface appearance of the printed object. The printing process is typically layered, which leads to aliasing artefacts that affect surface appearance. An antialiasing option is to use greyscale pixel values in the layer images that we supply to the printer. This enables a kind of subvoxel growth control. We explore this concept and use it for editing surface microstructure. In other words, we modify the surface appearance of a printed object by applying a greyscale pattern to the surface voxels before sending the cross-sectional layer images to the printer. We find that a smooth noise function is an excellent tool for varying surface roughness and for breaking the regularities that lead to aliasing. Conversely, we also present examples that introduce regularities to produce controlled anisotropic surface appearance. Our hope is that subvoxel growth control in stereolithography can lead 3D printing towards customizable surface appearance. The printing process adds what we call ground noise to the printed result. We suggest a way of modelling this ground noise to provide users with a tool for estimating a printer's ability to control surface reflectance.     

Feature Preserving Mesh Generation from 3D Point Clouds

We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the covariance matrices of Voronoi cells, we first extract from the point cloud a set of sharp features. Our algorithm also runs on the input point cloud a reconstruction process, such as Poisson reconstruction, providing an implicit surface. A feature preserving variant of a Delaunay refinement process is then used to generate a mesh approximating the implicit surface and containing a faithful representation of the extracted sharp edges. Such a mesh provides an enhanced trade‐off between accuracy and mesh complexity. The whole process is robust to noise and made versatile through a small set of parameters which govern the mesh sizing, approximation error and shape of the elements. We demonstrate the effectiveness of our method on a variety of models including laser scanned datasets ranging from indoor to outdoor scenes.     

The rise of 3D Printing entangled with smart computer aided design during COVID-19 era

During the current Pandemic, seven and a half million flights worldwide were canceled which disrupted the supply chain of all types of goods such as, personal protective gears, medical health devices, raw materials, food, and other essential equipments. The demand for health and medical related goods increased during this period globally, while the production using classical manufacturing techniques were effected because of the lockdowns and disruption in the transporation system. This created the need of geo scattered, small, and rapid manufacturing units along with a smart computer aided design (CAD) facility. The availability of 3D printing technologies and open source CAD design made it possible to overcome this need. In this article, we present an extensive review on the utilization of 3D printing technology in the days of pandamic. We observe that 3D printing together with smart CAD design show promise to overcome the disruption caused by the lockdown of classical manufacturing units specially for medical and testing equipment, and protective gears. We observe that there are several short communications, commentaries, correspondences, editorials and mini reviews compiled and published; however, a systematic state-of-the-art review is required to identify the significance of 3D printing, design for additive manufacturing (AM), and digital supply chain for handling emergency situations and in the post-COVID era. We present a review of various benefits of 3DP particularly in emergency situations such as a pandemic. Furthermore, some relevant iterative design and 3DP case studies are discussed systematically. Finally, this article highlights the areas that can help to control the emergency situation such as a pandemic, and critically discusses the research gaps that need further research in order to exploit the full potential of 3DP in pandemic and post-pandemic future era.     

Visual Analysis of Biomolecular Cavities: State of the Art

In this report we review and structure the branch of molecular visualization that is concerned with the visual analysis of cavities in macromolecular protein structures. First the necessary background, the domain terminology, and the goals of analytical reasoning are introduced. Based on a comprehensive collection of relevant research works, we present a novel classification for cavity detection approaches and structure them into four distinct classes: grid‐based, Voronoi‐based, surface‐based, and probe‐based methods. The subclasses are then formed by their combinations. We match these approaches with corresponding visualization technologies starting with direct 3D visualization, followed with non‐spatial visualization techniques that for example abstract the interactions between structures into a relational graph, straighten the cavity of interest to see its profile in one view, or aggregate the time sequence into a single contour plot. We also discuss the current state of methods for the visual analysis of cavities in dynamic data such as molecular dynamics simulations. Finally, we give an overview of the most common tools that are actively developed and used in the structural biology and biochemistry research. Our report is concluded by an outlook on future challenges in the field.     

Deep learning-based optimal segmentation of 3D printed product for surface quality improvement and support structure reduction

Large-sized product cannot be printed as one piece by a 3D printer because of the volume limitation of most 3D printers. Some products with the complex structure and high surface quality should also not be printed into one piece to meet requirement of the printing quality. For increasing the surface quality and reducing support structure of 3D printed models, this paper proposes a 3D model segmentation method based on deep learning. Sub-graphs are generated by pre-segmenting 3D triangular mesh models to extract printing features. A data structure is proposed to design training data sets based on the sub-graphs with printing features of the original 3D model including surface quality, support structure and normal curvature. After training a Stacked Auto-encoder using the training set, a 3D model is pre-segmented to build an application set by the sub-graph data structure. The application set is applied by the trained deep-learning system to generate hidden features. An Affinity Propagation clustering method is introduced in combining hidden features and geometric information of the application set to segment a product model into several parts. In the case study, samples of 3D models are segmented by the proposed method, and then printed using a 3D printer for validating the performance.     

ClipFlip : Multi‐view Clipart Design

We present an assistive system for clipart design by providing visual scaffolds from the unseen viewpoints. Inspired by the artists' creation process, our system constructs the visual scaffold by first synthesizing the reference 3D shape of the input clipart and rendering it from the desired viewpoint. The critical challenge of constructing this visual scaffold is to generate a reference 3D shape that matches the user's expectations in terms of object sizing and positioning while preserving the geometric style of the input clipart. To address this challenge, we propose a user‐assisted curve extrusion method to obtain the reference 3D shape. We render the synthesized reference 3D shape with a consistent style into the visual scaffold. By following the generated visual scaffold, the users can efficiently design clipart with their desired viewpoints. The user study conducted by an intuitive user interface and our generated visual scaffold suggests that our system is especially useful for estimating the ratio and scale between object parts and can save on average 57% of drawing time.     

Efficient 2D Simulation on Moving 3D Surfaces

We present a method to simulate fluid flow on evolving surfaces, e.g., an oil film on a water surface. Given an animated surface (e.g., extracted from a particle-based fluid simulation) in three-dimensional space, we add a second simulation on this base animation. In general, we solve a partial differential equation (PDE) on a level set surface obtained from the animated input surface. The properties of the input surface are transferred to a sparse volume data structure that is then used for the simulation. We introduce one-way coupling strategies from input properties to our simulation and we add conservation of mass and momentum to existing methods that solve a PDE in a narrow-band using the Closest Point Method. In this way, we efficiently compute high-resolution 2D simulations on coarse input surfaces. Our approach helps visual effects creators easily integrate a workflow to simulate material flow on evolving surfaces into their existing production pipeline.     

Enclosing Surfaces for Point Clusters Using 3D Discrete Voronoi Diagrams

Point clusters occur in both spatial and non-spatial data. In the former context they may represent segmented particle data, in the latter context they may represent clusters in scatterplots. In order to visualize such point clusters, enclosing surfaces lead to much better comprehension than pure point renderings.
We propose a flexible system for the generation of enclosing surfaces for 3D point clusters. We developed a GPU-based 3D discrete Voronoi diagram computation that supports all surface extractions. Our system provides three different types of enclosing surfaces. By generating a discrete distance field to the point cluster and extracting an isosurface from the field, an enclosing surface with any distance to the point cluster can be generated. As a second type of enclosing surfaces, a hull of the point cluster is extracted. The generation of the hull uses a projection of the discrete Voronoi diagram of the point cluster to an isosurface to generate a polygonal surface. Generated hulls of non-convex clusters are also non-convex. The third type of enclosing surfaces can be created by computing a distance field to the hull and extracting an isosurface from the distance field. This method exhibits reduced bumpiness and can extract surfaces arbitrarily close to the point cluster without losing connectedness.
We apply our methods to the visualization of multidimensional spatial and non-spatial data. Multidimensional clusters are extracted and projected into a 3D visual space, where the point clusters are visualized. The respective clusters can also be visualized in object space when dealing with multidimensional particle data.     

Interactive Cover Design Considering Physical Constraints

We developed an interactive system to design a customized cover for a given three‐dimensional (3D) object such as a camera, teapot, or car. The system first computes the convex hull of the input geometry. The user segments it into several cloth patches by drawing on the 3D surface. This paper provides two technical contributions. First, it introduces a specialized flattening algorithm for cover patches. It makes each two‐dimensional edge in the flattened pattern equal to or longer than the original 3D edge; a smaller patch would fail to cover the object, and a larger patch would result in extra wrinkles. Second, it introduces a mechanism to verify that the user‐specified opening would be large enough for the object to be removed. Starting with the initial configuration, the system virtually “pulls” the object out of the cover while avoiding excessive stretching of cloth patches. We used the system to design real covers and confirmed that it functions as intended.     

PackMerger: A 3D Print Volume Optimizer

We propose an optimization framework for 3D printing that seeks to save printing time and the support material required to print 3D shapes. Three‐dimensional printing technology is rapidly maturing and may revolutionize how we manufacture objects. The total cost of printing, however, is governed by numerous factors which include not only the price of the printer but also the amount of material and time to fabricate the shape. Our PackMerger framework converts the input 3D watertight mesh into a shell by hollowing its inner parts. The shell is then divided into segments. The location of splits is controlled based on several parameters, including the size of the connection areas or volume of each segment. The pieces are then tightly packed using optimization. The optimization attempts to minimize the amount of support material and the bounding box volume of the packed segments while keeping the number of segments minimal. The final packed configuration can be printed with substantial time and material savings, while also allowing printing of objects that would not fit into the printer volume. We have tested our system on three different printers and it shows a reduction of 5–30% of the printing time while simultaneously saving 15–65% of the support material. The optimization time was approximately 1 min. Once the segments are printed, they need to be assembled.