作者: Oliver van Kaick , Hao Zhang , Ghassan Hamarneh , Daniel Cohen-Or
DOI: 10.1111/J.1467-8659.2011.01884.X
关键词: Polygon mesh 、 Shape analysis (digital geometry) 、 Geometry processing 、 Computer science 、 Correspondence problem 、 Theoretical computer science 、 Geometric shape
摘要: We review methods designed to compute correspondences between geometric shapes represented by triangle meshes, contours or point sets. This survey is motivated in part recent developments space–time registration, where one seeks a correspondence non-rigid and time-varying surfaces, semantic shape analysis, which underlines trend incorporate understanding into the analysis pipeline. Establishing meaningful often difficult because it generally requires an of structure at both local global levels, sometimes functionality parts as well. Despite its inherent complexity, recurrent problem essential component numerous geometry processing applications. In this survey, we discuss different forms main solution methods, aided several classification criteria arising from definition. The categories are defined terms input output representation, objective function approach. conclude discussing open problems future perspectives.