Alternatives and similar repositories for ParGeo

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

• horizon-research / rtnn
  ☆64Updated 2 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
  ☆53Updated 10 months ago
• sebastianlipponer / zorder_knn
  Floating point morton order comparison operator.
  ☆15Updated last year
• 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 4 years ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated 3 weeks ago
• owensgroup / BGHT
  BGHT: High-performance static GPU hash tables.
  ☆63Updated last month
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 6 months ago
• dengwirda / robust-predicate
  Robust geometric predicates without the agonising pain.
  ☆21Updated 5 years ago
• mark-poscablo / gpu-radix-sort
  CUDA implementation of parallel radix sort using Blelloch scan
  ☆63Updated last year
• owensgroup / SlabHash
  A warp-oriented dynamic hash table for GPUs
  ☆73Updated last year
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆39Updated last year
• shamanDevel / cuMat
  An expression template based linear algebra library running completely on the GPU using CUDA
  ☆25Updated 3 years ago
• poncateam / ponca
  Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis
  ☆33Updated this week
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆111Updated 5 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆100Updated last year
• chenxuhao / csrcolor
  Efficient and High-quality Graph Coloring on the GPU
  ☆15Updated 3 years ago
• danshapero / predicates
  Robust geometric predicates
  ☆58Updated 10 months ago
• owensgroup / SlabAlloc
  A dynamic GPU memory allocator, suitable for warp synchronized scenarios.
  ☆11Updated 5 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆139Updated last month
• ingowald / cudaKDTree
  ☆235Updated last month
• EPFL-LGG / RotationOptimization
  Gradients/Hessians for optimizing with rotation variables.
  ☆26Updated 2 years ago
• sleeepyjack / warpcore
  A Library for fast Hash Tables on GPUs
  ☆117Updated 2 years ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated last month
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆54Updated 7 months ago
• apc-llc / whippletree
  Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU
  ☆21Updated 9 years ago
• ultimaille / stlbfgs
  C++ L-BFGS implementation using plain STL
  ☆33Updated 2 years ago
• Jurwen / Adaptive-grid-generation
  The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)
  ☆17Updated 7 months ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆55Updated 2 years ago
• Continuous-Collision-Detection / Exact-Root-Parity-CCD
  Exact floating-point implementation of root parity CCD [Wang et al. 2022]
  ☆34Updated 2 years ago