Beyond Complete Shapes: A Quantitative Evaluation of 3D Shape Matching Algorithms

Viktoria Ehm* , Nafie El Amrani* , Yizheng Xie , Lennart Bastian , Maolin Gao , Weikang Wang , Lu Sang , Dongliang Cao , Tobias Weißberg , Zorah Lähner , Florian Bernard , Daniel Cremers

SGP, 2025

A new benchmark for 3D shape matching algorithms, focusing on the evaluation of partial shape matching methods.

Project Page | Paper | Code | Citation

---

EchoMatch: Partial-to-Partial Shape Matching via Correspondence Reflection

Yizheng Xie* , Viktoria Ehm* , Paul Roetzer , Nafie El Amrani , Maolin Gao , Florian Bernard , Daniel Cremers

CVPR, 2025

Learning-based partial-to-partial shape matching method that uses correspondence reflection.

Project Page | Paper | Code | Citation

---

Partial-to-Partial Shape Matching with Geometric Consistency

Viktoria Ehm , Maolin Gao , Paul Roetzer , Marvin Eisenberger , Daniel Cremers , Florian Bernard

CVPR, 2024

Utilizing geometric consistency for partial-to-partial shape matching.

Project Page | Paper | Code | Video | Citation

---

Geometrically Consistent Partial Shape Matching

Viktoria Ehm , Paul Roetzer , Marvin Eisenberger , Maolin Gao , Florian Bernard , Daniel Cremers

3DV, 2024

A geometrically consistent algorithm for partial-to-full shape matching.

Paper | Code | Citation

---

Non-Separable Multi-Dimensional Network Flows for Visual Computing

Viktoria Ehm , Daniel Cremers , Florian Bernard

Eurographics (Poster), 2023

A novel non-separable flow algorithm for more robust visual computing

Paper | Citation

---

Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Applications in 3D Multi-Shape Analysis

Viktoria Ehm , Daniel Cremers , Florian Bernard

3DV, 2021

An algorithm to compute shortest paths in graphs with matrix-valued edges.

Paper | Citation