Alternatives and similar repositories for ParGeo

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

• horizon-research / rtnn
  ☆68Updated 2 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years 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…
  ☆25Updated 5 years ago
• ingowald / cudaKDTree
  ☆273Updated 2 months ago
• owensgroup / SlabAlloc
  A dynamic GPU memory allocator, suitable for warp synchronized scenarios.
  ☆11Updated 6 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆53Updated 3 weeks ago
• shamanDevel / cuMat
  An expression template based linear algebra library running completely on the GPU using CUDA
  ☆25Updated 4 years ago
• ultimaille / stlbfgs
  C++ L-BFGS implementation using plain STL
  ☆34Updated 2 years ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆114Updated 5 years ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆72Updated 2 months ago
• dengwirda / robust-predicate
  Robust geometric predicates without the agonising pain.
  ☆23Updated 5 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆74Updated last year
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆64Updated last year
• poncateam / ponca
  Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis
  ☆38Updated this week
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆106Updated last year
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆141Updated 5 months ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆52Updated 2 months ago
• ZJUCADGeoSim / Hausdorff
  Compute one-side Hausdorff distance between triangle meshes with error bound.
  ☆28Updated 3 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆20Updated 2 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 3 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
• dcoeurjo / GeometryProcessing-cmake-recipes
  CPM / cmake recipes for geometry processing stuff
  ☆19Updated last week
• ingowald / cuBQL
  'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)
  ☆34Updated 2 weeks ago
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆40Updated last year
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated 2 months ago
• deshanadesai / acorns
  https://arxiv.org/pdf/2007.05094.pdf An Easy-To-Use Code Generator for Gradients and Hessians
  ☆30Updated 3 years ago
• PhHerholz / SymbolicLib
  ☆23Updated 2 years ago
• Continuous-Collision-Detection / Exact-Root-Parity-CCD
  Exact floating-point implementation of root parity CCD [Wang et al. 2022]
  ☆34Updated 3 years ago
• MarcoAttene / CDT
  ☆71Updated 3 weeks ago