Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1705.06148
Cited By
DS++: A flexible, scalable and provably tight relaxation for matching problems
17 May 2017
Nadav Dym
Haggai Maron
Y. Lipman
Re-assign community
ArXiv
PDF
HTML
Papers citing
"DS++: A flexible, scalable and provably tight relaxation for matching problems"
2 / 2 papers shown
Title
A Robust Loss for Point Cloud Registration
Z. Deng
Yuxin Yao
Bailin Deng
Juyong Zhang
3DPC
27
19
0
26 Aug 2021
A Dual Iterative Refinement Method for Non-rigid Shape Matching
Rui Xiang
Rongjie Lai
Hongkai Zhao
3DV
27
10
0
26 Jul 2020
1