lkawka / 3d-nearest-neighbor-search-in-kd-tree-cudaLinks
Finding the nearest neighbor for 3d points in KD tree. Two implementations: nn.cpp (CPU) and nn.cu (CUDA GPU).
☆14Updated 3 years ago
Alternatives and similar repositories for 3d-nearest-neighbor-search-in-kd-tree-cuda
Users that are interested in 3d-nearest-neighbor-search-in-kd-tree-cuda are comparing it to the libraries listed below
Sorting:
- CUDA based Iterative Closest Point Algorithm Implementation☆69Updated 6 years ago
- GPU-accelerated KD-tree implementation☆45Updated 4 years ago
- ☆154Updated 6 years ago
- 分别用多核和GPU实现并行ICP算法(implementation of icp by openMP and cuda)☆46Updated 6 years ago
- Register and merge point clouds via a constrained ICP model☆22Updated 6 years ago
- Robust ICP Algorithm (A modified Fast Global Registration version)☆16Updated 7 years ago
- Cuda implementation of 3D SuperVoxel clustering☆22Updated 5 years ago
- PCL add-on to compute normal estimation to 2D pointCloud☆22Updated 4 years ago
- A high performance CUDA implementation of Scan Matching via the Iterative Closest Point Algorithm☆162Updated 3 years ago
- PLADE: A Plane-based Descriptor for Point Cloud Registration with Small Overlap☆113Updated last year
- A benchmark for point clouds registration algorithms☆97Updated 2 years ago
- B-SHOT : A Binary Feature Descriptor for Fast and Efficient Keypoint Matching on 3D Point Clouds☆63Updated 9 years ago
- Implementation of ICCV 2017: Colored Point Cloud Registration Revisited☆68Updated 3 years ago
- K-Closest Points and Maximum Clique Pruning for Efficient and Effective 3-D Laser Scan Matching (RA-L 2022)☆159Updated last year
- Implementation of my article "Connectivity-based Cylinder Detection in Unorganized Point Clouds"☆39Updated last year
- The code of Parallel Structure, which is used to reconstruct mesh from 3D Point Cloud.☆72Updated 4 years ago