期刊名称：International Journal of Multimedia and Ubiquitous Engineering
印刷版ISSN：1975-0080
出版年度：2015
卷号：10
期号：6
页码：17-24
DOI：10.14257/ijmue.2015.10.6.03
出版社：SERSC
摘要：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.
关键词：mass point clouds; irregular model; fast sort; k-Nearest Neighbors
