Volume 37 (2018)

Permanent URI for this community

https://diglib.eg.org/handle/10.2312/2632118

Browse

Browsing Volume 37 (2018) by Subject "and systems"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Möbius Registration
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Baden, Alex; Crane, Keenan; Kazhdan, Misha; Ju, Tao and Vaxman, Amir
    Conformal parameterizations over the sphere provide high-quality maps between genus zero surfaces, and are essential for applications such as data transfer and comparative shape analysis. However, such maps are not unique: to define correspondence between two surfaces, one must find the Möbius transformation that best aligns two parameterizations-akin to picking a translation and rotation in rigid registration problems. We describe a simple procedure that canonically centers and rotationally aligns two spherical maps. Centering is implemented via elementary operations on triangle meshes in R3, and minimizes area distortion. Alignment is achieved using the FFT over the group of rotations. We examine this procedure in the context of spherical conformal parameterization, orbifold maps, non-rigid symmetry detection, and dense point-to-point surface correspondence.
  • No Thumbnail Available
    Item
    Packing Irregular Objects in 3D Space via Hybrid Optimization
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ma, Yuexin; Chen, Zhonggui; Hu, Wenchao; Wang, Wenping; Ju, Tao and Vaxman, Amir
    Packing problems arise in a wide variety of practical applications. The basic problem is that of placing as many objects as possible in a non-overlapping configuration within a given container. Problems involving irregular shapes are the most challenging cases. In this paper, we consider the most general forms of irregular shape packing problems in 3D space, where both the containers and the objects can be of any shapes, and free rotations of the objects are allowed. We propose a heuristic method for efficiently packing irregular objects by combining continuous optimization and combinatorial optimization. Starting from an initial placement of an appropriate number of objects, we optimize the positions and orientations of the objects using continuous optimization. In combinatorial optimization, we further reduce the gaps between objects by swapping and replacing the deployed objects and inserting new objects. We demonstrate the efficacy of our method with experiments and comparisons.
  • No Thumbnail Available
    Item
    A Unified Discrete Framework for Intrinsic and Extrinsic Dirac Operators for Geometry Processing
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ye, Zi; Diamanti, Olga; Tang, Chengcheng; Guibas, Leonidas J.; Hoffmann, Tim; Ju, Tao and Vaxman, Amir
    Spectral mesh analysis and processing methods, namely ones that utilize eigenvalues and eigenfunctions of linear operators on meshes, have been applied to numerous geometric processing applications. The operator used predominantly in these methods is the Laplace-Beltrami operator, which has the often-cited property that it is intrinsic, namely invariant to isometric deformation of the underlying geometry, including rigid transformations. Depending on the application, this can be either an advantage or a drawback. Recent work has proposed the alternative of using the Dirac operator on surfaces for spectral processing. The available versions of the Dirac operator either only focus on the extrinsic version, or introduce a range of mixed operators on a spectrum between fully extrinsic Dirac operator and intrinsic Laplace operator. In this work, we introduce a unified discretization scheme that describes both an extrinsic and intrinsic Dirac operator on meshes, based on their continuous counterparts on smooth manifolds. In this discretization, both operators are very closely related, and preserve their key properties from the smooth case. We showcase various applications of our operators, with improved numerics over prior work.