Reassembling fractured objects by geometric matching

Reassembling fractured objects by geometric matching
复制标题

DOI:
10.1145/1179352.1141925
复制
发表时间:
2006-07
期刊:
ACM SIGGRAPH 2006 Papers
影响因子:
--
通讯作者:
Qi-Xing Huang;Simon Flöry;Natasha Gelfand;M. Hofer;H. Pottmann
Qi-Xing Huang;Simon Flöry;Natasha Gelfand;M. Hofer;H. Pottmann
中科院分区:
其他
文献类型:
--
作者:
Qi-Xing Huang;Simon Flöry;Natasha Gelfand;M. Hofer;H. Pottmann

文献摘要

被引文献

相似文献

我们提出了一个系统的自动重组破碎的三维固体。给定破碎碎片的三维数字模型作为输入,我们分析断裂表面的几何形状,以找到原始物体的全局一致重建。我们的重建管道包括基于图切割的分割算法,用于识别潜在的断裂表面,基于特征的鲁棒全局配准,用于碎片的成对匹配,以及同时约束多个碎片的局部配准。我们在几何处理领域开发了几种新技术,包括用于计算多尺度表面特征的新型积分不变量,基于前向搜索技术和表面一致性的配准,以及非穿透迭代最近点算法。我们在一些现实世界的例子上说明了我们的算法的性能。
We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital models of the broken fragments, we analyze the geometry of the fracture surfaces to find a globally consistent reconstruction of the original object. Our reconstruction pipeline consists of a graph-cuts based segmentation algorithm for identifying potential fracture surfaces, feature-based robust global registration for pairwise matching of fragments, and simultaneous constrained local registration of multiple fragments. We develop several new techniques in the area of geometry processing, including the novel integral invariants for computing multi-scale surface characteristics, registration based on forward search techniques and surface consistency, and a non-penetrating iterated closest point algorithm. We illustrate the performance of our algorithms on a number of real-world examples.