Alternatives and similar repositories for phtree-cpp

Users that are interested in phtree-cpp are comparing it to the libraries listed below

• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆109Updated 2 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆34Updated 8 months ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆131Updated last year
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 2 years ago
• LLNL / fpzip
  Lossless compressor of multidimensional floating-point arrays
  ☆122Updated 5 years ago
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆24Updated 4 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆50Updated last year
• ParAlg / ParGeo
  ☆49Updated 3 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆30Updated 10 years ago
• nmoehrle / libacc
  Acceleration structure library (BVH-, KD-Tree) with basic parallel construction
  ☆56Updated 6 years ago
• gerazo / loose_quadtree
  Loose Quadtree (Region Tree) simple C++11 implementation
  ☆66Updated last year
• thinks / tph_poisson
  Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.
  ☆120Updated 10 months ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆116Updated 10 months ago
• planaria / dmc
  Dual Marching Cubes Implementation in C++
  ☆64Updated 5 years ago
• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆141Updated last month
• d36u9 / async
  async is a tiny C++ header-only high-performance library for async calls handled by a thread-pool, which is built on top of an unbounded …
  ☆32Updated 4 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆173Updated 7 years ago
• attcs / Octree
  Octree/Quadtree/N-dimensional linear tree
  ☆196Updated 3 weeks ago
• Lucaweihs / range-tree
  A C++ RangeTree implementation.
  ☆43Updated 5 years ago
• emilk / Dual-Contouring
  Dual Contoruing implemented in C++
  ☆99Updated 6 years ago
• mgruppi / parallelmeshsimplification
  Implements Parallel Implementation of 3D mesh simplification.
  ☆15Updated 3 years ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆71Updated 9 years ago
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆36Updated 4 years ago
• nitnelave / lru_cache
  A C++ implementation of a LRU cache
  ☆42Updated 5 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆57Updated last year
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆34Updated 7 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆34Updated last week
• lowpoly-modeling / lowpoly-modeling.github.io
  ☆43Updated 3 years ago
• tatsy / tinymesh
  TinyMesh is a light-weight mesh processing library in C/C++.
  ☆97Updated last year