Alternatives and similar repositories for KdTreeGPU

Users that are interested in KdTreeGPU are comparing it to the libraries listed below

• ingowald / cudaKDTree
  ☆273Updated 3 months ago
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆45Updated 4 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆107Updated last year
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆65Updated last year
• ToruNiina / lbvh
  an implementation of parallel linear BVH (LBVH) on GPU
  ☆236Updated 5 years ago
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆275Updated 2 weeks ago
• Lancelot899 / discrete_differential_geometry
  离散几何处理中文版翻译
  ☆60Updated 3 years ago
• mortacious / cupy-knn
  A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.
  ☆30Updated 8 months ago
• poncateam / ponca
  Ponca is a header only C++/CUDA library for point cloud analysis
  ☆38Updated last week
• ForeverDavid / marching-cubes-cuda
  ☆37Updated 7 years ago
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆123Updated 2 years ago
• xkjyeah / vhashing
  Implementation of Hash table for Nießner's Voxel Hashing method
  ☆15Updated 10 years ago
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆94Updated 6 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆156Updated 2 years ago
• orzzzjq / Parallel-Banding-Algorithm-plus
  Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.
  ☆78Updated 5 years ago
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆179Updated 7 years ago
• m-schuetz / CudaLOD
  CUDA-accelerated LOD construction for point clouds
  ☆153Updated 2 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆173Updated 7 years ago
• rbregier / plycpp
  a simple C++ library to import/export Stanford PLY data.
  ☆22Updated last year
• anapupa / cuMesh
  ☆14Updated 3 years ago
• gishi523 / cusparse-cholesky-solver
  A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
  ☆20Updated 5 years ago
• navining / cuda-raytracing
  GPU acceleration of smallpt with CUDA. Obtain an acceleration of >35x comparing to the original CPU-parallelized code with OpenMP
  ☆45Updated 5 years ago
• bitbloop / Maximizing-parallelism-in-the-construction-of-Binary-Radix-Trees
  Parallel construction of binary radix trees, implemented from an nVidia paper.
  ☆20Updated 5 years ago
• sebastianlipponer / surface_splatting
  OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.
  ☆242Updated last year
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆35Updated last month
• InteractiveComputerGraphics / CompactNSearch
  A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…
  ☆171Updated last month
• chhavisharma / Project4-CUDA-ICP
  CUDA based Iterative Closest Point Algorithm Implementation
  ☆69Updated 5 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆56Updated last year
• vladap2013 / octree_cuda
  ☆23Updated 4 years ago
• nmwsharp / happly
  A C++ header-only parser for the PLY file format. Parse .ply happily!
  ☆369Updated last month