Pairwise Matching of 3D Fragments Using Cluster Trees

Abstract

We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented points. The method rapidly scans through the space of all possible contact poses of the fragments to be (re)assembled using a tree search strategy, which neither relies on any surface features nor requires an initial solution. The new method first decomposes each point set into a binary tree structure using a hierarchical clustering algorithm. Subsequently the fragments are matched pairwise by descending the cluster trees simultaneously in a depth-first fashion. In contrast to the reassemblage of pottery and thin walled artifacts, this paper addresses the problem of matching broken 3D solids on the basis of their 2.5D fracture surfaces, which are assumed to be reasonable large. Our proposed contact area maximization is a powerful common basis for most surface matching tasks, which can be adapted to numerous special applications. The suggested approach is very robust and offers an outstanding efficiency.

A computer-assisted constraint-based system for assembling fragmented objects

“…McBride et al [10] proposed a method based on two stages: they first compare every pair of fragments and use partial curve matching to find similar portions of their respective boundaries; in the second stage they search for a globally optimal arrangement which is based on a best-first strategy to attach fragments with the highest pairwise affinity. Winkelbach et al [11] proposed an automatic method based on matching of clusters of points organized as a hierarchical structure. Belenguer et al [12] proposed an automatic matching approach using a shape-descriptor based on a discrete sampling of the fracture surface.…”

Research on Splicing Method of Digital Relic Fragment Model

“…Ran, 2006, clustering algorithm (Xiaoa, 2005), genetic algorithm (Wang, 2007), and random sampling consistency algorithm (Winkelbach, 2008).…”

Aligning surfaces without aligning surfaces

“…When reassembling thick/volumetric objects like a stone-carved statue, for example, fractures will expose a common break-surface between matching fragments. Numerous approaches [2,7,17] use the dense correspondences embedded in this common surface both to find matching fragments, and to align them. When the matching fragments are too thin to share a common surface, these methods may not be applied.…”

“…The standard approach is then to iterate between finding common points in both views, and estimating the transformation that aligns them. This assumption holds for certain applications, such as constructing 3D models from several range-scans, or in digital archaeology where broken fragments have a thick break-surface in common as a result of the fracture [1,2,6,7,17].…”