ParAlg / ParGeo
☆46Updated 2 years ago
Alternatives and similar repositories for ParGeo:
Users that are interested in ParGeo are comparing it to the libraries listed below
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 2 years ago
- ☆64Updated last year
- EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…☆25Updated 4 years ago
- BGHT: High-performance static GPU hash tables.☆61Updated 5 months ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆99Updated 9 months ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆29Updated 2 years ago
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated 7 months ago
- A gpu based implementation of a K-D Tree Builder☆108Updated 5 years ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆21Updated this week
- Easy-to-use linear and non-linear solver☆51Updated 2 weeks ago
- Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis☆33Updated 3 months ago
- Interpolated corrected curvature measures for polygonal surfaces☆14Updated 11 months ago
- ☆222Updated last month
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆52Updated 5 months ago
- Multi-GPU Framework for Voxel Grid Computations☆45Updated this week
- An expression template based linear algebra library running completely on the GPU using CUDA☆24Updated 3 years ago
- An algorithm for Structured Volume Decomposition☆36Updated last year
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 6 months ago
- https://arxiv.org/pdf/2007.05094.pdf An Easy-To-Use Code Generator for Gradients and Hessians☆30Updated 3 years ago
- A warp-oriented dynamic hash table for GPUs☆74Updated last year
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last year
- geometry processing and shape analysis framework☆66Updated 2 months ago
- C++ L-BFGS implementation using plain STL☆32Updated last year
- C++ Shape Analysis and Geometry Processing☆38Updated 9 months ago
- A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library☆18Updated 5 years ago
- CUDA implementation of parallel radix sort using Blelloch scan☆62Updated 11 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated 2 months ago