Browsing by Author "Deng, Bailin"

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item
    Anderson Acceleration for Nonconvex ADMM Based on Douglas-Rachford Splitting
    (The Eurographics Association and John Wiley & Sons Ltd., 2020) Ouyang, Wenqing; Peng, Yue; Yao, Yuxin; Zhang, Juyong; Deng, Bailin; Jacobson, Alec and Huang, Qixing
    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.
  • Thumbnail Image
    Item
    Computational Design of Steady 3D Dissection Puzzles
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Tang, Keke; Song, Peng; Wang, Xiaofei; Deng, Bailin; Fu, Chi-Wing; Liu, Ligang; Alliez, Pierre and Pellacini, Fabio
    Dissection puzzles require assembling a common set of pieces into multiple distinct forms. Existing works focus on creating 2D dissection puzzles that form primitive or naturalistic shapes. Unlike 2D dissection puzzles that could be supported on a tabletop surface, 3D dissection puzzles are preferable to be steady by themselves for each assembly form. In this work, we aim at computationally designing steady 3D dissection puzzles. We address this challenging problem with three key contributions. First, we take two voxelized shapes as inputs and dissect them into a common set of puzzle pieces, during which we allow slightly modifying the input shapes, preferably on their internal volume, to preserve the external appearance. Second, we formulate a formal model of generalized interlocking for connecting pieces into a steady assembly using both their geometric arrangements and friction. Third, we modify the geometry of each dissected puzzle piece based on the formal model such that each assembly form is steady accordingly. We demonstrate the effectiveness of our approach on a wide variety of shapes, compare it with the state-of-the-art on 2D and 3D examples, and fabricate some of our designed puzzles to validate their steadiness.
  • No Thumbnail Available
    Item
    Ellipsoid Packing Structures on Freeform Surfaces
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Xu, Qun-Ce; Deng, Bailin; Yang, Yong-Liang; Fu, Hongbo and Ghosh, Abhijeet and Kopf, Johannes
    Designers always get good inspirations from fascinating geometric structures gifted by the nature. In the recent years, various computational design tools have been proposed to help generate cell packing structures on freeform surfaces, which consist of a packing of simple primitives, such as polygons, spheres, etc. In this work, we aim at computationally generating novel ellipsoid packing structures on freeform surfaces. We formulate the problem as a generalization of sphere packing structures in the sense that anisotropic ellipsoids are used instead of isotropic spheres to pack a given surface. This is done by defining an anisotropic metric based on local surface anisotropy encoded by principal curvatures and the corresponding directions. We propose an optimization framework that can optimize the shapes of individual ellipsoids and the spatial relation between neighboring ellipsoids to form a quality packing structure. A tailored anisotropic remeshing method is also employed to better initialize the optimization and ensure the quality of the result. Our framework is extensively evaluated by optimizing ellipsoid packing and generating appealing geometric structures on a variety of freeform surfaces.
  • Thumbnail Image
    Item
    Pacific Graphics 2022 - Short Papers, Posters, and Work-in-Progress Papers: Frontmatter
    (The Eurographics Association, 2022) Yang, Yin; Parakkat, Amal D.; Deng, Bailin; Noh, Seung-Tak; Yang, Yin; Parakkat, Amal D.; Deng, Bailin; Noh, Seung-Tak
  • Thumbnail Image
    Item
    A Survey of Non-Rigid 3D Registration
    (The Eurographics Association and John Wiley & Sons Ltd., 2022) Deng, Bailin; Yao, Yuxin; Dyke, Roberto M.; Zhang, Juyong; Meneveaux, Daniel; Patanè, Giuseppe
    Non-rigid registration computes an alignment between a source surface with a target surface in a non-rigid manner. In the past decade, with the advances in 3D sensing technologies that can measure time-varying surfaces, non-rigid registration has been applied for the acquisition of deformable shapes and has a wide range of applications. This survey presents a comprehensive review of non-rigid registration methods for 3D shapes, focusing on techniques related to dynamic shape acquisition and reconstruction. In particular, we review different approaches for representing the deformation field, and the methods for computing the desired deformation. Both optimization-based and learning-based methods are covered. We also review benchmarks and datasets for evaluating non-rigid registration methods, and discuss potential future research directions.