Alternatives and similar repositories for spatial_index_benchmark

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

• libspatialindex / libspatialindex
  C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API
  ☆767Updated 2 weeks ago
• nushoin / RTree
  N-dimensional RTree implementation in C++
  ☆427Updated 8 months ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆114Updated 7 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…
  ☆78Updated 5 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆215Updated 7 months ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆496Updated last year
• mapbox / geometry.hpp
  C++ geometry types
  ☆100Updated last year
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 2 years ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆68Updated 3 years ago
• mapbox / protozero
  Minimalist protocol buffer decoder and encoder in C++
  ☆361Updated last month
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆30Updated 10 years ago
• boostorg / graph
  Boost.org graph module
  ☆367Updated this week
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆440Updated 5 months ago
• morton-nd / morton-nd
  A header-only compile-time Morton encoding / decoding library for N dimensions.
  ☆110Updated 2 years ago
• mapbox / variant
  C++11/C++14 Variant
  ☆378Updated 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
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• nvmd / libkdtree
  libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretical…
  ☆73Updated 2 months ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆366Updated last month
• boostorg / geometry
  Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
  ☆499Updated last week
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• STEllAR-GROUP / hpxcl
  This repository contains components that will support percolation via OpenCL and CUDA
  ☆32Updated 3 years ago
• mapbox / spatial-algorithms
  Spatial algorithms library for geometry.hpp
  ☆37Updated 5 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…
  ☆117Updated 11 months ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆131Updated last year
• LLNL / fpzip
  Lossless compressor of multidimensional floating-point arrays
  ☆122Updated 5 years ago
• drycpp / lmdbxx
  C++11 wrapper for the LMDB embedded B+ tree database library.
  ☆281Updated 5 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last month
• kit-algo / flow-cutter
  Experimental FlowCutter Code
  ☆13Updated 6 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆79Updated 2 years ago