Alternatives and similar repositories for ParGeo

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

• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆116Updated 6 years ago
• sergiud / SuiteSparse
  SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support
  ☆53Updated this week
• horizon-research / rtnn
  ☆69Updated 3 weeks 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
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• ingowald / cudaKDTree
  ☆274Updated 4 months ago
• shamanDevel / cuMat
  An expression template based linear algebra library running completely on the GPU using CUDA
  ☆25Updated 4 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆143Updated 7 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated 2 years ago
• ultimaille / stlbfgs
  C++ L-BFGS implementation using plain STL
  ☆35Updated 2 years ago
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆76Updated last year
• bmerry / mlsgpu
  Reconstruction of triangulated surfaces from range-scanned point clouds
  ☆36Updated 7 years ago
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆40Updated last year
• owensgroup / SlabAlloc
  A dynamic GPU memory allocator, suitable for warp synchronized scenarios.
  ☆11Updated 6 years ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆72Updated 3 months ago
• ZJUCADGeoSim / Hausdorff
  Compute one-side Hausdorff distance between triangle meshes with error bound.
  ☆29Updated 3 years ago
• dcoeurjo / CorrectedNormalCurrent
  Interpolated corrected curvature measures for polygonal surfaces
  ☆16Updated 4 months ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆61Updated 4 months ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆173Updated 7 years ago
• idealab-isu / GPView
  GPU Accelerated Voxelization Framework for 3D CAD models.
  ☆28Updated 7 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆107Updated last year
• 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
• dengwirda / robust-predicate
  Robust geometric predicates without the agonising pain.
  ☆24Updated 5 years ago
• sleeepyjack / warpcore
  A Library for fast Hash Tables on GPUs
  ☆126Updated 2 weeks ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆389Updated last month
• poncateam / ponca
  Ponca is a header only C++/CUDA library for point cloud analysis
  ☆38Updated last week
• MarcoAttene / Indirect_Predicates
  Indirect Predicates for Geometric Constructions
  ☆48Updated 5 months ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆54Updated 4 months ago
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆66Updated last year
• chitalu / oibvh-tree
  Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
  ☆31Updated 4 years ago