Premium
Efficient Volumetric PolyCube‐Map Construction
Author(s) -
Fu XiaoMing,
Bai ChongYang,
Liu Yang
Publication year - 2016
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.13007
Subject(s) - computer science , distortion (music) , hexahedron , computation , computer graphics , computer graphics (images) , mesh generation , segmentation , tetrahedron , algorithm , computer vision , artificial intelligence , mathematics , geometry , finite element method , computer network , amplifier , physics , bandwidth (computing) , thermodynamics
PolyCubes provide compact representations for closed complex shapes and are essential to many computer graphics applications. Existing automatic PolyCube construction methods usually suffer from poor quality or time‐consuming computation. In this paper, we provide a highly efficient method to compute volumetric PolyCube‐maps. Given an input tetrahedral mesh, we utilize two novel normal‐driven volumetric deformation schemes and a polycube‐allowable mesh segmentation to drive the input to a volumetric PolyCube structure. Our method can robustly generate foldover‐free and low‐distortion PolyCube‐maps in practice, and provide a flexible control on the number of corners of Polycubes. Compared with state‐of‐the‐art methods, our method is at least one order of magnitude faster and has better mapping qualities. We demonstrate the efficiency and efficacy of our method in PolyCube construction and all‐hexahedral meshing on various complex models.