In 3D printing, it is critical to use as few as possible supporting materials for efficiency and material saving. Multiple model decomposition methods and multi-DOF (degrees of freedom) 3D printers have been developed to address this issue. However, most systems utilize model decomposition and multi-DOF independently. Only a few existing approaches combine the two, i.e. partitioning the models for multi-DOF printing. In this paper, we present a novel model decomposition method for multidirectional 3D printing, allowing consistent printing with the least cost of supporting materials. Our method is based on a global optimization that minimizes the surface area to be supported for a 3D model. The printing sequence is determined inherently by minimizing a single global objective function. Experiments on various complex 3D models using a five-DOF 3D printer have demonstrated the effectiveness of our approach.

This paper presents a method for generative design of decorative architectural parts such as corbel,moulding and panel, which usually have clear structure and aesthetic details. The method is composed of two components: offline learning and online generation. The offline learning trains a 2D CurveInfoGAN and a 3D VoxelVAE that learn the feature representations of the parts in a dataset. The online generation proceeds with an evolution procedure that evolves to product new generation of part components by selecting, crossing over and mutating features, followed by a feature-driven deformation that synthesizes the 3D mesh representation of new models. Built upon these technical components, a generative design tool is developed, which allows the user to input a decorative architectural model as a reference and then generates a set of new models that are “more of the same” as the reference and meanwhile exhibit some “surprising” elements. The experiments demonstrate the effectiveness of the method and also showcase the use of classic geometric modelling and advanced machine learning techniques in modelling of architectural parts.

The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to converge to a solution of high‐accuracy. Previously, Anderson acceleration has been applied to ADMM, by treating it as a fixed‐point iteration for the concatenation of the dual variables and a subset of the primal variables. In this paper, we note that the equivalence between ADMM and Douglas‐Rachford splitting reveals that ADMM is in fact a fixed‐point iteration in a lower‐dimensional space. By applying Anderson acceleration to such lower‐dimensional fixed‐point iteration, we obtain a more effective approach for accelerating ADMM. We analyze the convergence of the proposed acceleration method on nonconvex problems, and verify its effectiveness on a variety of computer graphics including geometry processing and physical simulation.