Now showing items 1-5 of 5

    • Combinatorial Construction of Seamless Parameter Domains 

      Zhou, Jiaran; Tu, Changhe; Zorin, Denis; Campen, Marcel (The Eurographics Association and John Wiley & Sons Ltd., 2020)
      The problem of seamless parametrization of surfaces is of interest in the context of structured quadrilateral mesh generation and spline-based surface approximation. It has been tackled by a variety of approaches, commonly ...
    • Displacement-Correlated XFEM for Simulating Brittle Fracture 

      Chitalu, Floyd M.; Miao, Qinghai; Subr, Kartic; Komura, Taku (The Eurographics Association and John Wiley & Sons Ltd., 2020)
      We present a remeshing-free brittle fracture simulation method under the assumption of quasi-static linear elastic fracture mechanics (LEFM). To achieve this, we devise two algorithms. First, we develop an approximate ...
    • Fast and Robust QEF Minimization using Probabilistic Quadrics 

      Trettner, Philip; Kobbelt, Leif (The Eurographics Association and John Wiley & Sons Ltd., 2020)
      Error quadrics are a fundamental and powerful building block in many geometry processing algorithms. However, finding the minimizer of a given quadric is in many cases not robust and requires a singular value decomposition ...
    • Optimizing Object Decomposition to Reduce Visual Artifacts in 3D Printing 

      Filoscia, Irene; Alderighi, Thomas; Giorgi, Daniela; Malomo, Luigi; Callieri, Marco; Cignoni, Paolo (The Eurographics Association and John Wiley & Sons Ltd., 2020)
      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 ...
    • Polygon Laplacian Made Simple 

      Bunge, Astrid; Herholz, Philipp; Kazhdan, Misha; Botsch, Mario (The Eurographics Association and John Wiley & Sons Ltd., 2020)
      The discrete Laplace-Beltrami operator for surface meshes is a fundamental building block for many (if not most) geometry processing algorithms. While Laplacians on triangle meshes have been researched intensively, yielding ...