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.
☆47Updated 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:
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆77Updated 4 years ago
- Templated Portable I/O Environment☆113Updated 2 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆67Updated 2 years ago
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 4 years ago
- Naive Hilbert R-Tree implementation☆30Updated 10 years ago
- C++ geometry types☆101Updated last year
- A header-only compile-time Morton encoding / decoding library for N dimensions.☆107Updated 2 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
- STXXL: Standard Template Library for Extra Large Data Sets☆493Updated last year
- N-dimensional RTree implementation in C++☆417Updated 4 months ago
- A relatively simple implementation of the R* Tree data structure for C++☆50Updated 2 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
- Traitlets-like C++ properties and implementation of the observer pattern☆43Updated last year
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretical…☆70Updated 4 months ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- Library for performing spectral clustering in C++☆78Updated 2 years ago
- A generic C++11 k-means clustering implementation☆213Updated 2 months ago
- zero-copy, zero-serialize, zero-hassle protocol buffers☆59Updated 7 years ago
- Spatial algorithms library for geometry.hpp☆37Updated 4 years ago
- STL-based caches for C++☆116Updated 2 years ago
- This repository contains components that will support percolation via OpenCL and CUDA☆32Updated 3 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆128Updated 2 years ago
- C++Now 2016 talk - Pulling Visitors: Boost.Graph + Boost.Coroutine☆9Updated 9 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆134Updated 2 years ago
- C++ API for the TeaFile File Format. TeaFiles is Time Series Persistence in Flat Files.☆60Updated 3 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆49Updated 3 months ago
- Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.☆73Updated 9 years ago