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

维普资讯 ISSN 1000-9825，CODEN RUXUEW E-mail：jos@iscas．ac．cn JournalofSoftware，Vo1．19，No．7，July2008，PP．1766-1782 hUp：／／www．jos．org．cn DOI：10．3724／SP．J．1001．2008．01766 Te1／Fax：+86-10 @2008byJournalofSoftware．Allrightsreserved． 基于边 ／面遮挡关联性的多面体凸剖分方法 李 静H，王文成，吴恩华1,2 。(中国科学院软件研究所 计算机科学国家重点实验室，北京 100190) (澳门大学 科技学院 计算机与信息科学系，澳门) ConvexDecompositionofPolyhedronsUsingOcclusionRelationsAmongEdges／Facets LIJingH WANGWen—Cheng， WU En—Hua， ， (StateKeyLaboratoryofComputerScience，InstituteofSoftware，TheChineseAcademyofSciences，Bering100190，China) (DepartmentofComputerandInformationScience，UniversityofMacau，Macao，China) +Correspondingauthor：E-mail：lij@ios．ac．cn LiJ，W angW C，W uEH．Convexdecompositionofpolyhedronsusingocclusionrelationsamongedges／facets． JournalofSoftware，2008，19(7)：1766—1782．http：／／www．jos．org．cn／lO00—9825／19／1766．htm Abstract： Thispaperpresentsanew method forconvex decomposition ofpolyhedrons．In comparison with existingmethods，thenew methodcanimprovetheefficiencygreatlywithcomplexitiesreducedinmanyaspectsof executiontime，storageandaddednew vertices，anditismoreadvantageousintreatingthepolyhedronswithreflex edgesinhighernumbers．Itsstrategyistograduallydecomposeapolyhedroninlocaloperationsbytheocclusion relationshipsbetween facetsand edgesalong certain orthogonaldirections．In treating generalpolyhedronsin practice，thenewmethodhasitstimeandstoragecomplexitiesbothinD()approximately，anditsproducednew verticesareinanumbernotmorethanO(r+n ’)，herenisthevertexnumberandristhereflexedgenumber．By testing a large numberofcomplex polyherdons，itshowsthat，compared with thepopularly used “cutting splitting”method，thisnew methodcannan14~120ti