A new K nearest neighbours algorithm using cell grids for 3D scattered point cloud
Cited 0 times inCited 0 times in
- A new K nearest neighbours algorithm using cell grids for 3D scattered point cloud
- Zhao, Jianhui; Long, Chengjiang; Xiong, Shuping; Liu, Cheng; Yuan, Zhiyong
- Issue Date
- KAUNAS UNIV TECHNOLOGY
- ELEKTRONIKA IR ELEKTROTECHNIKA, v.20, no.1, pp.81 - 87
- In this paper, we propose one novel and efficient K nearest neighbours search algorithm based on 3D uniform cell grids. First, a simple min-max box is used to store all the points and a twice division strategy is adopted to determine the edge length of basic grids. Then we limit the search space for each grid with certain query points to control the amount of distance calculations under a suitable level. And the computational cost of sorting operations is reduced effectively through avoiding the unnecessary calculations, with the help of properly determined subspaces and sphere spaces for points. Compared with existing related algorithms, our method can search for the K nearest neighbours accurately and quickly, and it has many possible applications in the fields using 3D scattered point clouds.
- Appears in Collections:
- DHE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.