In this paper

we present a system for automatic reassembly of broken 3D solids based on fractured surfaces matching. 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 computing 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 compatibility constraint. After that

we use exhaustive search method constrained by triangle similarity and voting scheme to match the fractured surfaces. Finally

we employ a sub-graph merging algorithm based on backtracking to merge all matched fragments until the object is reassembled. Experimental results show the algorithm is capable of reassembly of broken 3D solids.