Efficient Globally Optimal 2D-to-3D Deformable Shape Matching. (arXiv:1601.06070v3 [cs.CV] UPDATED)

Web: http://arxiv.org/abs/1601.06070

We propose the first algorithm for non-rigid 2D-to-3D shape matching, where
the input is a 2D shape represented as a planar curve and a 3D shape
represented as a surface; the output is a continuous curve on the surface. We
cast the problem as finding the shortest circular path on the product
3-manifold of the surface and the curve. We prove that the optimal matching can
be computed in polynomial time with a (worst-case) complexity of
$O(mn^2\log(n))$, where $m$ and …

3d arxiv cv