Efficient Volumetric PolyCube-Map Construction

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 comput...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 35; no. 7; pp. 97 - 106
Main Authors Fu, Xiao-Ming, Bai, Chong-Yang, Liu, Yang
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.10.2016
Subjects
Online AccessGet full text
ISSN0167-7055
1467-8659
DOI10.1111/cgf.13007

Cover

More Information
Summary: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.
Bibliography:ark:/67375/WNG-5H6F918K-V
istex:2AF8FFD8C6BDB9EF412CC7842C88E207758C5B2E
ArticleID:CGF13007
Supporting Information
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.13007