断裂面匹配的破碎刚体复原  

Reassembly of broken 3D solids based on fractured surfaces matching

作　　者：李群辉[1,2] 周明全[3] 耿国华[1] 

机构地区：[1]西北大学信息科学与技术学院,西安710069 [2]长安大学理学院,西安710064 [3]北京师范大学信息科学与技术学院,北京100875

出　　处：《中国图象图形学报》2012年第10期1298-1304,共7页Journal of Image and Graphics

基　　金：国家自然科学基金项目(61172170);国家重点基础研究发展计划(973)计划前期研究专项(2011CB311802);中央高校基本科研业务费专项资金项目(CHD2010JC121)

摘　　要：提出一种根据断裂面匹配进行破碎刚体复原的算法。首先根据积分不变量采用简单区域生长算法,将碎块表面以棱边为界限分割成多张曲面,根据法矢扰动区分出断裂面和原始面;然后根据断裂面顶点的平均积分不变量是否相近和邻域曲面是否相似,获得少量特征显著的相似点对,其中采用基于相容性约束的方法判断邻域曲面的相似性;之后采用引入三角形相似约束的穷举搜索的方法和投票机制进行断裂面的匹配;最后使用基于回溯的子图融合的方法进行碎块的整体拼合。实验结果表明,该算法能够对较复杂的碎块进行准确的拼接复原。In this paper, we present a system for automatic reassembly of broken 3D solids based on fractured surfaces matc hing. First, the fragments are segmented into a set of surfaces bounded by edge using a region growing strategy according to volume integral invariants, and then these surfaces are classified into the original surfaces and fractured surfaces by compu ting their perturbation of the normal vectors. Second, a small number of salient matching point pairs are obtained through first comparing feature point＇s volume integral invariants and then comparing the feature point＇s neighbor regions based on compati bility constraint. After that, we use exhaustive search method constrained by triangle similarity and voting scheme to match the fractured surfaces. Finally, we employ a subgraph merging algorithm based on backtracking to merge all matched frag ments until the object is reassembled. Experimental results show the algorithm is capable of reassembly of broken 3D solids.

关 键 词：破碎刚体复原 积分不变量 断裂面分割 断裂面匹配 碎块拼合 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]