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 5 months ago
• 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
• mapbox / geometry.hpp
  C++ geometry types
  ☆100Updated 10 months ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆100Updated last year
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 2 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated 2 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
• nushoin / RTree
  N-dimensional RTree implementation in C++
  ☆398Updated last month
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 10 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆128Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• boostorg / sort
  Boost.Sort
  ☆52Updated this week
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• HBPVIS / ZeroBuf
  zero-copy, zero-serialize, zero-hassle protocol buffers
  ☆56Updated 7 years ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 8 years ago
• Kolkir / cpptask
  Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.
  ☆73Updated 9 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆103Updated 4 years ago
• bchoi / ParKD
  Parallel k-D Tree Construction
  ☆57Updated 13 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 7 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 11 months ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆139Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• iritkatriel / streamulus
  A C++ DSEL for real-time event stream processing
  ☆77Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago