Alternatives and similar repositories for KdTreeGPU

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

• ingowald / cudaKDTree
  ☆272Updated 2 months ago
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆44Updated 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.
  ☆106Updated last year
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆64Updated last year
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆268Updated last week
• nmwsharp / happly
  A C++ header-only parser for the PLY file format. Parse .ply happily!
  ☆363Updated last year
• ToruNiina / lbvh
  an implementation of parallel linear BVH (LBVH) on GPU
  ☆220Updated 5 years ago
• Lancelot899 / discrete_differential_geometry
  离散几何处理中文版翻译
  ☆60Updated 3 years ago
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆179Updated 7 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.
  ☆77Updated 5 years ago
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆93Updated 6 years ago
• mortacious / cupy-knn
  A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.
  ☆30Updated 7 months ago
• poncateam / ponca
  Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis
  ☆38Updated last week
• ForeverDavid / marching-cubes-cuda
  ☆37Updated 7 years ago
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆34Updated last week
• navining / cuda-raytracing
  GPU acceleration of smallpt with CUDA. Obtain an acceleration of >35x comparing to the original CPU-parallelized code with OpenMP
  ☆46Updated 5 years ago
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆123Updated 2 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆168Updated 7 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆156Updated 2 years ago
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 4 years ago
• m-schuetz / CudaLOD
  CUDA-accelerated LOD construction for point clouds
  ☆149Updated 2 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆56Updated 11 months ago
• jbehley / octree
  Fast radius neighbor search with an Octree (ICRA 2015)
  ☆368Updated 5 years ago
• anapupa / cuMesh
  ☆13Updated 3 years ago
• sebastianlipponer / surface_splatting
  OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.
  ☆242Updated last year
• MuGdxy / muda
  μ-Cuda, COVER THE LAST MILE OF CUDA. With features: intellisense-friendly, structured launch, automatic cuda graph generation and updatin…
  ☆188Updated 2 months ago
• vladap2013 / octree_cuda
  ☆23Updated 4 years ago
• rbregier / plycpp
  a simple C++ library to import/export Stanford PLY data.
  ☆22Updated last year
• MeshFrame / MeshFrame
  A light-weighted, efficient and header-only mesh processing frame work.
  ☆52Updated 2 years ago
• ingowald / closestSurfacePointQueries
  Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
  ☆24Updated 3 years ago