Zhao, HuiLei, NaLi, XuanZeng, PengXu, KeGu, XianfengJernej Barbic and Wen-Chieh Lin and Olga Sorkine-Hornung2017-10-162017-10-162017978-3-03868-051-2https://doi.org/10.2312/pg.20171319https://diglib.eg.org:443/handle/10.2312/pg20171319The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube ones. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserved, and works on surface meshes with or without boundaries. Our algorithm outperforms previous ones in speed, robustness, efficiency. Our method is simple to implement. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexity and topology. We demonstrate that our method compares favorably to other state-of-the-art polycube deformation methods.Computing methodologiesMesh modelsMesh geometry models10.2312/pg.2017131917-22