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 4 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
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆99Updated last year
• 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
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 years ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆70Updated 8 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• mapbox / geometry.hpp
  C++ geometry types
  ☆99Updated 9 months ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆66Updated 2 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 10 months ago
• boostorg / sort
  Boost.Sort
  ☆51Updated last week
• rawrunprotected / hilbert_curves
  Fast Hilbert Curves
  ☆73Updated 8 years ago
• mourner / kdbush.hpp
  A fast static spatial index for 2D points in C++11
  ☆33Updated 5 years ago
• DNCrane / Cover-Tree
  A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…
  ☆62Updated 7 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆127Updated last year
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• 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
  ☆52Updated last year
• jupyter-xeus / xproperty
  Traitlets-like C++ properties and implementation of the observer pattern
  ☆43Updated 9 months ago
• mapbox / wagyu
  A general library for geometry operations of union, intersections, difference, and xor
  ☆172Updated last year
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆22Updated 2 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated last year
• libspatialindex / libspatialindex
  C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
  ☆727Updated 3 months ago
• nushoin / RTree
  N-dimensional RTree implementation in C++
  ☆397Updated last week
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆488Updated last year
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• aavenel / FastMortonKeys
  Compute morton keys using a look-up table generated at compile-time.
  ☆31Updated 8 years ago