Alternatives and similar repositories for spatial_index_benchmark

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

• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated last month
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆76Updated 4 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• mapbox / geometry.hpp
  C++ geometry types
  ☆100Updated 11 months ago
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 2 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 10 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
• mourner / kdbush.hpp
  A fast static spatial index for 2D points in C++11
  ☆33Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆102Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated last year
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆93Updated 4 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated 2 years ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆67Updated 2 years ago
• libspatialindex / libspatialindex
  C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
  ☆747Updated 3 weeks ago
• ieyjzhou / KmeansPlusPlus
  k-means++: a C++ version implement
  ☆19Updated 7 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆129Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• boostorg / sort
  Boost.Sort
  ☆53Updated last month
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆128Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆213Updated last month
• gpichot / cpp-tdigest
  [Not maintained] Implementation of TDigest algorithm in C++
  ☆16Updated 8 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago