Polycube construction and deformation are essential problems in computer graphics. In this paper, we present a robust, simple, efficient,and automatic algorithm to deform the meshes of arbitrary shapes into polycube f...Polycube construction and deformation are essential problems in computer graphics. In this paper, we present a robust, simple, efficient,and automatic algorithm to deform the meshes of arbitrary shapes into polycube form. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserving, and works on surface meshes with or without boundaries.Our algorithm outperforms previous ones with respect to speed, robustness, and efficiency. Our method is simple to implement. To demonstrate the robustness and effectivity of our method, we have applied 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.展开更多
基金Supported by the National Natural Scielice Foundation of China under Grant Nos.6057315360533080(国家自然科学基金)+5 种基金the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z314(国家高技术研究发展计划(863))the Program for New Century Excellent Talents in University of China under Grant No.NCET-05-0519(新世纪优秀人才支持计划)the Natural science Foundation of Zhejiang Provilice of China under Grant No.R105431(浙江省自然科学基金)the Open Project Program of the State Key Laboratory of CAD&CGZhejiang UniversityChina under Grant No.A0805(浙江大学CAD&CG国家重点实验宣开放课题)
基金partially supported by NSFC 61772105,61720106005,and 11271156NSF DMS-1418255AFOSR FA9550-14-1-0193
文摘Polycube construction and deformation are essential problems in computer graphics. In this paper, we present a robust, simple, efficient,and automatic algorithm to deform the meshes of arbitrary shapes into polycube form. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserving, and works on surface meshes with or without boundaries.Our algorithm outperforms previous ones with respect to speed, robustness, and efficiency. Our method is simple to implement. To demonstrate the robustness and effectivity of our method, we have applied 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.