Alternatives and similar repositories for KdTreeGPU:

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

• ingowald / cudaKDTree
  ☆231Updated this week
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆44Updated 3 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆100Updated 11 months ago
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆254Updated this week
• ToruNiina / lbvh
  an implementation of parallel linear BVH (LBVH) on GPU
  ☆202Updated 4 years ago
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆62Updated last year
• ForeverDavid / marching-cubes-cuda
  ☆36Updated 6 years ago
• horizon-research / rtnn
  ☆64Updated last year
• anapupa / cuMesh
  ☆13Updated 3 years ago
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆26Updated 2 weeks 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 4 years ago
• kuiwuchn / 3x3_SVD_CUDA
  Fast CUDA 3x3 SVD
  ☆72Updated 6 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆53Updated 6 months ago
• nmwsharp / happly
  A C++ header-only parser for the PLY file format. Parse .ply happily!
  ☆339Updated last year
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆121Updated 2 years ago
• Lancelot899 / discrete_differential_geometry
  离散几何处理中文版翻译
  ☆58Updated 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
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆389Updated 5 months ago
• ericjang / svd3
  Fast singular value decomposition, diagonalization, QR decomposition of 3x3 matrices.
  ☆155Updated 3 years ago
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆92Updated 6 years ago
• m-schuetz / CudaLOD
  CUDA-accelerated LOD construction for point clouds
  ☆145Updated last year
• wi-re / tbtSVD
  A simple header only implementation of a SVD for 3x3 Matrices based on "Computing the Singular Value Decomposition of 3x3 matrices with m…
  ☆16Updated last year
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 3 years ago
• InteractiveComputerGraphics / CompactNSearch
  A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…
  ☆163Updated last year
• InteractiveComputerGraphics / TreeNSearch
  C++ library for fast computation of neighbor lists in point clouds.
  ☆57Updated 4 months ago
• AmanSachan1 / CUDA-Rasterizer
  GPU Accelerated Rasterizer written in CUDA
  ☆40Updated 7 years ago
• mortacious / cupy-knn
  A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.
  ☆31Updated 2 months ago
• AlfonsoLRz / PointCloudRendering
  Fast rendering of large point clouds in OpenGL through compute shaders.
  ☆149Updated last year
• mitsuba-renderer / nanothread
  nanothread — Minimal thread pool for task parallelism
  ☆73Updated last week
• NVIDIA / optix-toolkit
  Set of utilities supporting workflows common in GPU raytracing applications
  ☆109Updated last week