Finding a correspondence between two shapes is a fundamental task in computer graphics and geometry processing with applications ranging from texture mapping to animation. A particularly challenging and widely studied setting is when shapes are allowed to undergo quasi-isometric deformations, as it happens when we consider articulated bodies in different poses. An even more interesting scenario is partial correspondence, where one is shown only a subset of the shape, and has to match it with a deformable version thereof. Partial correspondence problems arise in numerous applications that involve real data acquisition by 3D sensors, which inevitably leads to missing parts due to occlusions and partial views.
We propose a benchmark to evaluate the performance of algorithms for establishing correspondences between a full shape and its deformed versions, under the presence of different amounts and kinds of partiality.
Paper | Code | Results | Date | Stars |
---|