2014
DOI: 10.1007/978-3-642-54774-4_1
View full text
|
|
Share

Abstract: Abstract. We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes X and Y by means of a convex relaxation. Rather than mapping points to points we match infinitesimal surface patches while preserving the geometric structures. In this spirit, we consider matchings between objects' surfaces as diffeomorphisms which are by definition geometrically consistent. Since such diffeomorphisms can be represented as closed surfaces in the product space X × Y ,…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
0
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals