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 3 weeks 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.
  ☆101Updated last year
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆29Updated 10 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆129Updated last year
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 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
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 7 months ago
• mapbox / wagyu
  A general library for geometry operations of union, intersections, difference, and xor
  ☆175Updated last year
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆67Updated 2 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
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• libspatialindex / libspatialindex
  C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
  ☆742Updated this week
• nushoin / RTree
  N-dimensional RTree implementation in C++
  ☆405Updated 2 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• boostorg / sort
  Boost.Sort
  ☆52Updated 2 weeks ago
• mapbox / supercluster.hpp
  A fast geospatial static point clustering library for C++14
  ☆35Updated 3 years ago
• alex-87 / HyperGraphLib
  C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
  ☆21Updated 2 years ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 8 years ago
• mapbox / geojson-cpp
  A C++14 library for converting GeoJSON into geometry.hpp representation
  ☆69Updated 2 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆122Updated 11 months ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 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
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆213Updated 3 weeks ago