Abstract
At present, the traditional ICP algorithm has the problems of low efficiency and low precision. To solve these two problems, an ICP algorithm based on block path closest point search is proposed in this paper. The idea of the algorithm is as follows: firstly, the point cloud data is divided into blocks, and the nearest point block corresponding to the target point cloud is searched by the path method. Secondly, according to the global method, the nearest point can be determined only by finding the nearest point block, and complete all the closest match. The experimental results show that the improved ICP algorithm has faster speed and higher precision than the traditional ICP algorithm, for a large number of point cloud data advantage is more obvious.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.