Efficient Volumetric PolyCube-Map Construction

Simple item page
dc.contributor.authorFu, Xiao-Mingen_US
dc.contributor.authorBai, Chong-Yangen_US
dc.contributor.authorLiu, Yangen_US
dc.contributor.editorEitan Grinspun and Bernd Bickel and Yoshinori Dobashien_US
dc.date.accessioned2016-10-11T05:18:50Z
dc.date.available2016-10-11T05:18:50Z
dc.date.issued2016
dc.description.abstractPolyCubes 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.en_US
dc.description.number7
dc.description.sectionheadersTextures/Mapping
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume35
dc.identifier.doi10.1111/cgf.13007
dc.identifier.issn1467-8659
dc.identifier.pages97-106
dc.identifier.urihttps://doi.org/10.1111/cgf.13007
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13007
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]
dc.subjectComputational Geometry and Object Modeling
dc.subjectGeometric algorithms
dc.subjectlanguages
dc.subjectand systems
dc.titleEfficient Volumetric PolyCube-Map Constructionen_US
Files
Collections
35-Issue 7