earticle

영어

According to mass point clouds without explicit topology relation, a parallel fast sort algorithm is proposed in this paper. Morton order is introduced and used to merge one-dimensional data. The mass point clouds of irregular model are generated corresponding address code named Morton code and these points are stored in the octree structure chain. And then a parallel fast sort algorithm based on Euclidean distance is used to sort by CPU and GPU. The k-Nearest Neighbors of point can be located in the chain. The experiment results show that much time is saved and k-Nearest Neighbors of point can be searched directly. This algorithm is simpler than those complex sort methods used on the whole point clouds.