Alternatives and similar repositories for ParGeo

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

• horizon-research / rtnn
  ☆69Updated 3 months ago
• txstc55 / EGGS
  EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…
  ☆26Updated 5 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆52Updated 3 weeks ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆71Updated 6 months ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆118Updated 6 years ago
• ingowald / cudaKDTree
  ☆278Updated 2 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated 2 years ago
• owensgroup / SlabAlloc
  A dynamic GPU memory allocator, suitable for warp synchronized scenarios.
  ☆11Updated 6 years ago
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆66Updated last year
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆108Updated last year
• shamanDevel / cuMat
  An expression template based linear algebra library running completely on the GPU using CUDA
  ☆25Updated 4 years ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆55Updated 6 months ago
• ZJUCADGeoSim / Hausdorff
  Compute one-side Hausdorff distance between triangle meshes with error bound.
  ☆29Updated 3 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆143Updated 9 months ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• ingowald / closestSurfacePointQueries
  Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
  ☆24Updated 4 years ago
• NVIDIA / optix-dev
  OptiX SDK headers, everything needed to build & run OptiX applications. SDK samples not included.
  ☆40Updated 3 weeks ago
• dcoeurjo / GeometryProcessing-cmake-recipes
  CPM / cmake recipes for geometry processing stuff
  ☆20Updated last month
• gishi523 / cusparse-cholesky-solver
  A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
  ☆21Updated 6 years ago
• ultimaille / stlbfgs
  C++ L-BFGS implementation using plain STL
  ☆36Updated last month
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆174Updated 7 years ago
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 4 years ago
• ingowald / legacy-cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆39Updated 2 months ago
• qnzhou / nanospline
  A nano spline library in modern C++.
  ☆128Updated 3 weeks ago
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆40Updated last year
• MarcoAttene / CDT
  ☆74Updated 3 weeks ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆76Updated last year
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 3 years ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆415Updated 2 months ago