johnarobinson77 / KdTreeGPULinks
A gpu based implementation of a K-D Tree Builder
☆118Updated 6 years ago
Alternatives and similar repositories for KdTreeGPU
Users that are interested in KdTreeGPU are comparing it to the libraries listed below
Sorting:
- ☆280Updated 3 months ago
- GPU-accelerated KD-tree implementation☆46Updated 4 years ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆109Updated last year
- A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.☆32Updated last year
- 离散几何处理中文版翻译☆62Updated 3 years ago
- Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.☆80Updated 5 years ago
- Ponca is a header only C++/CUDA library for point cloud analysis☆46Updated this week
- CUDA implementation of parallel radix sort using Blelloch scan☆67Updated last year
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆58Updated last year
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆39Updated 3 months ago
- an implementation of parallel linear BVH (LBVH) on GPU☆249Updated 5 years ago
- A C++ header-only parser for the PLY file format. Parse .ply happily!☆385Updated 4 months ago
- GPU-accelerated triangle mesh processing☆291Updated last week
- Signed Distance Function from triangle mesh.☆95Updated 6 years ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- ☆39Updated 7 years ago
- An expression template based linear algebra library running completely on the GPU using CUDA☆25Updated 4 years ago
- GPU acceleration of smallpt with CUDA. Obtain an acceleration of >35x comparing to the original CPU-parallelized code with OpenMP☆48Updated 5 years ago
- Curvature assignment for Geometry Processing course☆156Updated 2 years ago
- OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.☆241Updated last year
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆176Updated 7 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆179Updated 8 years ago
- Simple OpenGL mesh/point cloud viewer☆122Updated 3 years ago
- ☆18Updated 4 years ago
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 4 years ago
- Interpolated corrected curvature measures for polygonal surfaces☆16Updated 7 months ago
- ☆23Updated 4 years ago
- Automatic Differentiation in Geometry Processing Made Simple☆424Updated 3 months ago
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆172Updated 4 months ago
- Mepp2 - 3D MEsh Processing Platform☆82Updated 3 years ago