A New K Nearest Neighbours Algorithm Using Cell Grids for 3D Scattered Point Cloud

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 283
  • Download : 0
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.
Publisher
KAUNAS UNIV TECHNOLOGY
Issue Date
2014
Language
English
Article Type
Article
Keywords

SURFACE RECONSTRUCTION

Citation

ELEKTRONIKA IR ELEKTROTECHNIKA, v.20, no.1, pp.81 - 87

ISSN
1392-1215
DOI
10.5755/j01.eee.20.1.3926
URI
http://hdl.handle.net/10203/208521
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0