EkNN is an new Extracting k-Nearest Neighbors Searching Algorithm for Point Cloud. It extracts neighbors from the preview query point first, and then searchs if the number of extracted points less than k.
It can integrates with any other fast searching algorithms. We integrate it with spatial partition alforithm and orthogonal search tree algorithm
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
EkNN is an new Extracting k-Nearest Neighbors Searching Algorithm for Point Cloud. It extracts neighbors from the preview query point first, and then searchs if the number of extracted points less than k.
It can integrates with any other fast searching algorithms. We integrate it with spatial partition alforithm and orthogonal search tree algorithm