基于边面遮挡关联性多面体凸剖分方法.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.7, July 2008, pp.1766− 1782 DOI: 10.3724/SP.J.1001.2008.01766 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 基于边/面遮挡关联性的多面体凸剖分方法 1+ 1 1,2 李 静 , 王文成 , 吴恩华 1( 中国科学院软件研究所 计算机科学国家重点实验室,北京 100190) 2 (澳门大学 科技学院 计算机与信息科学系,澳门) Convex Decomposition of Polyhedrons Using Occlusion Relations Among Edges/Facets 1+ 1 1,2 LI Jing , WANG Wen-Cheng , WU En-Hua 1(State Key Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100190, China) 2 (Department of Computer and Information Science, University of Macau, Macao, China) + Corresponding author: E-mail: lij@ Li J, Wang WC, Wu EH. Convex decomposition of polyhedrons using occlusion relations among edges/facets. Journal of Software, 2008,19(7):1766−1782. /1000-9825/19/1766.htm Abstract : This paper presents a new method for convex decomposition of polyhedrons. In comparison with existing methods, the new method can improve the efficiency greatly with complexities reduced in many aspects of execution time, storage and added new vertices, and it is more advantageous in treating the polyhedrons with reflex edges in higher numbers. Its strategy is to gradually decompose a polyhedron in local operations by the occlusion relationships between facets and edges along certain orthogonal directions. In treating general polyhedrons in practice, the new method has its time and storage complexities both in O(n) approximately, a