ISSN 1000-1239 CN 11-1777/TP

• 图形图像 •

几何展开与折叠算法及应用综述

1. 1(辽宁师范大学计算机与信息技术学院计算机系统研究所 辽宁大连 116029);2(智能通信软件与多媒体北京市重点实验室(北京邮电大学) 北京 100876) (cadcg2008@hotmail.com)
• 出版日期: 2020-11-01
• 基金资助:
国家自然科学基金项目(61472170);北京邮电大学智能通信软件与多媒体北京市重点实验室开放课题(ITSM201301)

Survey on Geometric Unfolding, Folding Algorithms and Applications

Sun Xiaopeng1,2, Liu Shihan1, Wang Zhenyan1, Li Jiaojiao1

1. 1(Institute of Computer System, Department of Computer and Information Technology, Liaoning Normal University, Dalian, Liaoning 116029);2(Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia (Beijing University of Posts and Telecommunications), Beijing 100876)
• Online: 2020-11-01
• Supported by:
This work was supported by the National Natural Science Foundation of China (61472170) and the Open Project of Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia (Beijing University of Posts and Telecommunications) (ITSM201301).

Abstract: Unfolding and folding problem is a popular research topic in computer graphics, and has a wide range of applications, such as industrial manufacturing, architectural design, medical treatment, and aviation technology. In this survey, we review the basic concepts of unfolding and folding problem, introduce the research and application in four fields: robot design, computer animation, deep learning and others. We discuss the research work of unfolding and folding problem in detail. First, according to the different degrees of unfolding, we summarize research progress and typical algorithm ideas from two aspects: full unfolding and approximate unfolding. Full unfolding is to unfold 3D objects into 2D space without overlapping and deformation. However, most objects cannot be directly unfolded, and only an approximately unfolded structure can be solved. Approximate unfolding is a non-overlapping and deformed process, which is unfolded into the plane domain by mapping. How to find the smallest deformation is the key to approximate unfolding. Second, according to the different folding forms, the folding problem is divided into two types: Origami and Kirigami. We divide Origami into rigid folding and curved folding according to the different forms of crease, such as straight crease and curved crease. Kirigami is a special folding method that combines cutting and folding technology, which drives folding by the elastic force or other external forces generated by cutting. Here, we mainly consider the technology or algorithm of using Kirigami technology to construct auxetic structures. In addition, in order to compare the advantages and disadvantages of the algorithm, we summarize the commonly used algorithm indicators of unfolding and folding algorithm. Then, we evaluate the typical algorithm in recent years, and analyze advantages and disadvantages. Finally, we summarize and propose the development trend of unfolding and folding, including algorithm accuracy and robustness, fold volumetric objects, self-driven process and intelligent application of Kirigami technology.