# Geometrically Consistent Partial Shape Matching

arXiv: https://arxiv.org/abs/2309.05013 · HTML: https://mlsanity.com/paper/2309.05013/

## Key facts

- Cited by 13 papers in the map (data through 14 Oct 2026).
- Builds on 11 of its 32 references that are in the map.
- First posted on arXiv 10 Sep 2023.

## Builds on (most cited first, 11 of 11)

- [Continuous and Orientation-preserving Correspondences via Functional Maps](https://mlsanity.com/paper/1806.04455/) (2018)
- [Smooth Shells: Multi-Scale Shape Registration with Functional Maps](https://mlsanity.com/paper/1905.12512/) (2019)
- [Partial Functional Correspondence](https://mlsanity.com/paper/1506.05274/) (2015)
- [DPFM: Deep Partial Functional Maps](https://mlsanity.com/paper/2110.09994/) (2021)
- [Unsupervised Learning of Robust Spectral Shape Matching](https://mlsanity.com/paper/2304.14419/) (2023)
- [Isometric Multi-Shape Matching](https://mlsanity.com/paper/2012.02689/) (2020)
- [Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Space](https://mlsanity.com/paper/1701.00669/) (2017)
- [MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment](https://mlsanity.com/paper/2002.12623/) (2020)
- [A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching](https://mlsanity.com/paper/2204.12805/) (2022)
- [Non-Rigid Puzzles](https://mlsanity.com/paper/2011.13076/) (2020)
- [Conjugate Product Graphs for Globally Optimal 2D-3D Shape Matching](https://mlsanity.com/paper/2211.11589/) (2022)

## Built on by (most cited first, 13 of 13)

- [Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolation](https://mlsanity.com/paper/2402.18920/) (2024)
- [Partial-to-Partial Shape Matching with Geometric Consistency](https://mlsanity.com/paper/2404.12209/) (2024)
- [Beyond Complete Shapes: A Benchmark for Quantitative Evaluation of 3D Shape Surface Matching Algorithms](https://mlsanity.com/paper/2411.03511/) (2024)
- [DiffuMatch: Category-Agnostic Spectral Diffusion Priors for Robust Non-rigid Shape Matching](https://mlsanity.com/paper/2507.23715/) (2025)
- [Stable-SCore: A Stable Registration-based Framework for 3D Shape Correspondence](https://mlsanity.com/paper/2503.21766/) (2025)
- [Fast Globally Optimal and Geometrically Consistent 3D Shape Matching](https://mlsanity.com/paper/2504.06385/) (2025)
- [SGMatch: Semantic-Guided Non-Rigid Shape Matching with Flow Regularization](https://mlsanity.com/paper/2603.12937/) (2026)
- [RINO: Rotation-Invariant Non-Rigid Correspondences](https://mlsanity.com/paper/2603.27773/) (2026)
- [An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching](https://mlsanity.com/paper/2602.06590/) (2026)
- [DeepShapeMatchingKit: Accelerated Functional Map Solver and Shape Matching Pipelines Revisited](https://mlsanity.com/paper/2604.10377/) (2026)
- [The Joint Gromov Wasserstein Objective for Multiple Object Matching](https://mlsanity.com/paper/2511.16868/) (2025)
- [TokenMatch: 3D Mesh Correspondence Transformer with Curvature-Guided Tokenisation](https://mlsanity.com/paper/2609.04202/) (2026)
- [NHO: A Neural Hamiltonian Operator for Anchor-based Region Localization and Dense Correspondence](https://mlsanity.com/paper/2609.37048/) (2026)

## Abstract (arXiv)

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property of matchings is geometric consistency, which means that neighboring triangles in one shape are consistently matched to neighboring triangles in the other shape. Moreover, while in practice one often has only access to partial observations of a 3D shape (e.g. due to occlusion, or scanning artifacts), there do not exist any methods that directly address geometrically consistent partial shape matching. In this work we fill this gap by proposing to integrate state-of-the-art deep shape features into a novel integer linear programming partial shape matching formulation. Our optimization yields a globally optimal solution on low resolution shapes, which we then refine using a coarse-to-fine scheme. We show that our method can find more reliable results on partial shapes in comparison to existing geometrically consistent algorithms (for which one first has to fill missing parts with a dummy geometry). Moreover, our matchings are substantially smoother than learning-based state-of-the-art shape matching methods.