Graph Pattern Matching based reassembly - 3DGPM

Reassembling fragmented 3D objects is challenging, particularly for archaeological artifacts affected by surface degradation and material heterogeneity. We propose a graph-based method integrating geometric and topological features to match fragments by analyzing surface patch arrangements instead of individual shapes, improving robustness to erosion and noise. Fragments are first segmented using Reeb graph-based partitioning. From this, an adjacency graph encoding the spatial organization of surface regions is constructed. Local geometry is described using the shape index to detect complementary areas across fragments. Pairwise matches are obtained by comparing structural patterns within adjacency graphs and filtered using geometric consistency constraints. Global reassembly is achieved through confidence-guided clustering with collision checks. Experiments on two public datasets achieve 80% and 95% pairwise matching recall and enable correct reconstruction of objects with up to 62 fragments, outperforming classical and recent AI-based methods.