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.
  ☆100Updated last year
• 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
  ☆29Updated last month
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆22Updated 3 years 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…
  ☆109Updated 3 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 4 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆52Updated last month
• owensgroup / MVGpuBTree
  GPU B-Tree with support for versioning (snapshots).
  ☆47Updated 5 months ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆70Updated 8 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆115Updated 3 weeks ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 2 years ago
• prideout / camera_demo
  demo for par_camera_control.h
  ☆11Updated 2 years ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated last year
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• tzaeschke / phtree
  PH-Tree
  ☆127Updated 2 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• ParAlg / ParGeo
  ☆47Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• Pierre-Terdiman / BoxPruning
  Broad-phase optimizations.
  ☆49Updated 6 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• hadeaninc / libzinc
  Zinc is a C++ library for spatial processing.
  ☆48Updated 6 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 8 years ago
• gerazo / loose_quadtree
  Loose Quadtree (Region Tree) simple C++11 implementation
  ☆66Updated 10 months ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆127Updated last year