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.

목차

Abstract
 1. Introduction
 2. Storage Structure Based on Morton Order
  2.1. Two-Dimensional Coordinate is Merged to Morton Value
  2.2. Morton Order Generation Algorithm
  2.3. Storage Structure
 3. Parallel Fast Sort Algorithm for Irregular Model
 4. Results
 5. Conclusions
 Acknowledgments
 References

키워드

저자

• Liu Yan-ju [ Computer Center, Qiqihar University, Qiqihar, China ]
• Zhang Hong-lie [ College of Computer and Control Engineering, Qiqihar University, Qiqihar, China ]
• Tao Bai-rui [ Computer Center, Qiqihar University, Qiqihar, China ]
• Li Cheng [ College of Computer and Control Engineering, Qiqihar University, Qiqihar, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605