2L-LSH achieves faster kNN and range neighbor searches in large point clouds than Kd-tree and Octree via a two-level hashing strategy, with reported time reductions of 51-94% for kNN and 42-55% for range searches.
(2015) A review of point cloud registration algorithms for mobile robotics.Foundations and Trends®in Robotics,4, 1–104
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
2L-LSH: A Locality-Sensitive Hash Function-Based Method For Rapid Point Cloud Indexing
2L-LSH achieves faster kNN and range neighbor searches in large point clouds than Kd-tree and Octree via a two-level hashing strategy, with reported time reductions of 51-94% for kNN and 42-55% for range searches.