三维重构中的杂乱点云排序问题研究

Research on Sorting Method of 3-D Reconstruction of Unorganized Point-clouds

针对三维重构中的杂乱点云数据预处理问题,给出了一种快速、有效的排序算法。算法通过先对点云进行平行切割,再对切割后的截线云进行插入排序。由于滤除了大量冗余的信息,从而大大提高了排序的速度。实践结果证明,这种算法高效、稳定、易于实现。

The paper focuses on a high efficient sorting algorithm to cope with the pretreatment problem of unorganized discrete pointclouds in its 3D reconstruction.The algorithm obtains cloud section by parallel cutting the measured unorganized pointclouds and then sorts the points in the cloud section by interposition,which improves greatly the sorting efficiency for cutting the redundant points before reordering.Experimental results show that this algorithm is effective,robust and can be easily implemented.