ingowald / cudaKDTreeLinks
☆273Updated 3 months ago
Alternatives and similar repositories for cudaKDTree
Users that are interested in cudaKDTree are comparing it to the libraries listed below
Sorting:
- A gpu based implementation of a K-D Tree Builder☆114Updated 5 years ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆106Updated last year
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆35Updated 3 weeks ago
- an implementation of parallel linear BVH (LBVH) on GPU☆224Updated 5 years ago
- GPU-accelerated KD-tree implementation☆45Updated 4 years ago
- CUDA implementation of parallel radix sort using Blelloch scan☆64Updated last year
- GPU acceleration of smallpt with CUDA. Obtain an acceleration of >35x comparing to the original CPU-parallelized code with OpenMP☆45Updated 5 years ago
- GPU-accelerated triangle mesh processing☆274Updated 2 weeks ago
- An easily integrable Cholesky solver on CPU and GPU☆241Updated 10 months ago
- Dr.Jit — A Just-In-Time-Compiler for Differentiable Rendering (core library)☆116Updated last week
- A C++ header-only parser for the PLY file format. Parse .ply happily!☆367Updated 2 weeks ago
- CUDA-accelerated LOD construction for point clouds☆151Updated 2 years ago
- μ-Cuda, COVER THE LAST MILE OF CUDA. With features: intellisense-friendly, structured launch, automatic cuda graph generation and updatin…☆192Updated this week
- Automatic Differentiation in Geometry Processing Made Simple☆408Updated 5 months ago
- A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.☆30Updated 7 months ago
- fast distance and ray intersection queries☆427Updated last week
- OptiX SDK headers, everything needed to build & run OptiX applications. SDK samples not included.☆32Updated 6 months ago
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated 10 months ago
- Set of utilities supporting workflows common in GPU raytracing applications☆119Updated last week
- A simple header only implementation of a SVD for 3x3 Matrices based on "Computing the Singular Value Decomposition of 3x3 matrices with m…☆17Updated last year
- Fast rendering of large point clouds in OpenGL through compute shaders.☆163Updated 4 months ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis☆38Updated last week
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆140Updated last year
- Grid-Free Monte Carlo Solvers for Partial Differential Equations☆253Updated 2 weeks ago
- Fast radius neighbor search with an Octree (ICRA 2015)☆369Updated 5 years ago
- 离散几何处理中文版翻译☆60Updated 3 years ago
- Finding the nearest neighbor for 3d points in KD tree. Two implementations: nn.cpp (CPU) and nn.cu (CUDA GPU).☆14Updated 3 years ago
- OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.☆242Updated last year