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.
  ☆102Updated last year
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆22Updated 4 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆30Updated 2 months ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆129Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 5 months ago
• gerazo / loose_quadtree
  Loose Quadtree (Region Tree) simple C++11 implementation
  ☆66Updated last year
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆43Updated last year
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 7 months ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 8 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• LLNL / fpzip
  Lossless compressor of multidimensional floating-point arrays
  ☆112Updated 5 years ago
• nmoehrle / libacc
  Acceleration structure library (BVH-, KD-Tree) with basic parallel construction
  ☆54Updated 6 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated last month
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• apc-llc / whippletree
  Whippletree, a novel approach to scheduling dynamic, irregular workloads on the GPU
  ☆21Updated 9 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 5 years ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• davemc0 / DMcTools
  Graphics tools in C++: 3D vector, image load/save 3D model load/save, Morton code, Halton sequence, matrix math, Perlin noise, image filt…
  ☆13Updated last year
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆33Updated 4 years ago
• bfraboni / vptree-draw
  Space partitioning structures visualization
  ☆42Updated 2 years ago
• hadeaninc / libzinc
  Zinc is a C++ library for spatial processing.
  ☆49Updated 6 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆90Updated 7 years ago
• mitsuba-renderer / nanothread
  nanothread — Minimal thread pool for task parallelism
  ☆78Updated last month