ParAlg / ParGeoLinks
☆50Updated 3 years ago
Alternatives and similar repositories for ParGeo
Users that are interested in ParGeo are comparing it to the libraries listed below
Sorting:
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- 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 5 years ago
- ☆69Updated 2 months ago
- A gpu based implementation of a K-D Tree Builder☆117Updated 6 years ago
- Parallel Graph Input Output☆18Updated 2 years ago
- ☆278Updated last month
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated 2 weeks ago
- An expression template based linear algebra library running completely on the GPU using CUDA☆25Updated 4 years ago
- A dynamic GPU memory allocator, suitable for warp synchronized scenarios.☆11Updated 6 years ago
- CUDA implementation of parallel radix sort using Blelloch scan☆66Updated last year
- A warp-oriented dynamic hash table for GPUs☆76Updated last year
- BGHT: High-performance static GPU hash tables.☆71Updated 5 months ago
- Easy-to-use linear and non-linear solver☆55Updated 5 months ago
- C++ L-BFGS implementation using plain STL☆35Updated 2 weeks ago
- Interpolated corrected curvature measures for polygonal surfaces☆16Updated 5 months ago
- Ponca is a header only C++/CUDA library for point cloud analysis☆45Updated last week
- Fast zero-overhead bindings between NumPy and Eigen☆143Updated 8 months ago
- A Library for fast Hash Tables on GPUs☆128Updated 2 months ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆107Updated last year
- MWE for using the Eigen library in CUDA kernels☆120Updated 3 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆174Updated 7 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
- CPM / cmake recipes for geometry processing stuff☆20Updated 2 weeks ago
- Local and distributed octrees based on Morton codes with halo discovery and exchange with a 3D collision detection algorithm☆44Updated last month
- Automatic Differentiation in Geometry Processing Made Simple☆411Updated last month
- A header-only compile-time Morton encoding / decoding library for N dimensions.☆110Updated 2 years ago
- OptiX SDK headers, everything needed to build & run OptiX applications. SDK samples not included.☆35Updated 9 months ago
- A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library☆21Updated 5 years ago
- Lossless compressor of multidimensional floating-point arrays☆122Updated 5 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆29Updated 3 years ago