Abstract: Based on global point signature and Green's function representation,a coarse-to-fine sparse correspondence algorithm for nearly-isometric meshes is proposed in this paper.To address the problem of undetermined signs of the corresponding basis vectors,the anchor points are extracted from the source mesh and the nearly-isometric destination mesh respectively based on the Morse theory and a modified hierarchically clustering approach.Their correspondences are then established by minimizing their GPS distances,which can be solved via a combinational searching strategy.Second,to solve the inconsistent problem of high dimensional GPS coordinates caused by different resolutions of meshes,a new Green's function presentation of point is proposed based on the anchor point pairs obtained.As a result,the sparse correspondence of nearly-isometric meshes is established incrementally.Experimental results demonstrate the proposed algorithm exhibits better computational efficiency and correspondence accuracy than other shape correspondence algorithms.It can be potentially applied to rigid or non-rigid mesh alignment,3D morphing,shape matching,etc.