To select an appropriate algorithm for DEM matching

this paper reviews the development of the two popular 3D surface matching algorithms

least z-difference(LZD) and iterative closest point(ICP)

and describes their common logical framework.Then the two algorithms are evaluated qualitatively through theoretic analysis.Finally

the quantitative comparison is performed by a set of tests.The experimental results show that the computational efficiency of LZD is about 9 times higher than ICP.But its pull-in range is slight smaller

and its iterative convergence rate is about 1 time slower than ICP.However

the closer the two DEM are

the faster LZD converges.Therefore

LZD is more appropriate for DEM matching with small pose different.