Alternatives and similar repositories for KdTreeGPU:

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

• ingowald / cudaKDTree
  ☆222Updated last month
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆43Updated 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.
  ☆99Updated 9 months ago
• ToruNiina / lbvh
  an implementation of parallel linear BVH (LBVH) on GPU
  ☆195Updated 4 years ago
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆242Updated this week
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆62Updated 11 months ago
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆21Updated this week
• InteractiveComputerGraphics / CompactNSearch
  A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…
  ☆161Updated 11 months ago
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆92Updated 5 years ago
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆115Updated 2 years ago
• sebastianlipponer / surface_splatting
  OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.
  ☆234Updated 9 months ago
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 3 years ago
• nmwsharp / happly
  A C++ header-only parser for the PLY file format. Parse .ply happily!
  ☆336Updated last year
• 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
• ForeverDavid / marching-cubes-cuda
  ☆36Updated 6 years ago
• horizon-research / rtnn
  ☆64Updated last year
• kuiwuchn / 3x3_SVD_CUDA
  Fast CUDA 3x3 SVD
  ☆71Updated 6 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆51Updated 5 months ago
• orzzzjq / Parallel-Banding-Algorithm-plus
  Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.
  ☆74Updated 4 years ago
• anapupa / cuMesh
  ☆13Updated 3 years ago
• gishi523 / cusparse-cholesky-solver
  A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
  ☆18Updated 5 years ago
• MuGdxy / muda
  μ-Cuda, COVER THE LAST MILE OF CUDA. With features: intellisense-friendly, structured launch, automatic cuda graph generation and updatin…
  ☆168Updated last week
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆384Updated 3 months ago
• Lancelot899 / discrete_differential_geometry
  离散几何处理中文版翻译
  ☆58Updated 2 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆148Updated 6 years ago
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆126Updated 3 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆153Updated last year
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆134Updated last year
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆61Updated 5 months ago
• Ubpa / UHEMesh
  an elegant, high-performance and user-friendly halfedge data structure
  ☆82Updated 4 years ago