Partial correspondence of 3D shapes using properties of the nearest-neighbor field

Nadav Yehonatan Arbel, Ayellet Tal, Lihi Zelnik-Manor

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


This paper proposes an algorithm for finding correspondences between shapes in 3D. The method is designed to address three challenging cases: large deformations, partiality of the shapes, and topological noise. At the core of the method lies a novel, yet simple, similarity measure that analyzes statistical properties of the nearest-neighbor field from the source surface to the target. This information is shown to be powerful, compared to minimizing some function of distances. In particular, the proposed similarity function analyzes the diversity of the nearest-neighbor field and its preservation of distances. Empirical evaluation on partial matching benchmarks shows that our method outperforms state-of-the-art techniques, both quantitatively and qualitatively.

Original languageEnglish
Pages (from-to)183-192
Number of pages10
JournalComputers and Graphics
StatePublished - Aug 2019
Externally publishedYes

Bibliographical note

Funding Information:
This research was supported by the Israel Science Foundation under Grants 1089/16 and 1083/18 and by the Ollendorf foundation. We are grateful to Dr. Uri Wollner for his insightful comments that helped us to improve the paper.

Publisher Copyright:
© 2019 Elsevier Ltd


  • Partial matching
  • Shape correspondence

Cite this