mloskot / spatial_index_benchmarkLinks
Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R* balancing algorithms as well as bulk loading.
☆48Updated 6 years ago
Alternatives and similar repositories for spatial_index_benchmark
Users that are interested in spatial_index_benchmark are comparing it to the libraries listed below
Sorting:
- Templated Portable I/O Environment☆113Updated 4 months ago
- C++ implementation of R*-tree, an MVR-tree and a TPR-tree with C API☆761Updated last month
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆78Updated 4 years ago
- N-dimensional RTree implementation in C++☆424Updated 6 months ago
- STXXL: Standard Template Library for Extra Large Data Sets☆493Updated last year
- Naive Hilbert R-Tree implementation☆30Updated 10 years ago
- A generic C++11 k-means clustering implementation☆213Updated 4 months ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆68Updated 3 years ago
- Minimalist protocol buffer decoder and encoder in C++☆340Updated 2 months ago
- A relatively simple implementation of the R* Tree data structure for C++☆51Updated 2 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Boost.org graph module☆360Updated 3 weeks ago
- A header-only compile-time Morton encoding / decoding library for N dimensions.☆108Updated 2 years ago
- C++ geometry types☆100Updated last year
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆95Updated 5 years ago
- 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
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 8 months ago
- libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretical…☆72Updated 6 months ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆439Updated 2 months ago
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 4 years ago
- C++ implementation of a memory efficient hash map and hash set☆362Updated this week
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆129Updated 2 years ago
- KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies☆78Updated 4 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆181Updated 11 months ago
- Library for performing spectral clustering in C++☆79Updated 2 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Experimental C++11 version of sparsehash☆292Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- C++11/C++14 Variant☆377Updated 2 years ago