Alternatives and similar repositories for range-tree

Users that are interested in range-tree are comparing it to the libraries listed below

• ttalvitie / tinygeom2d
  Tiny 2D Geometry Library
  ☆30Updated 7 years ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆68Updated 3 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆67Updated 10 years ago
• hroest / CppLowess
  A pure C++ implementation of the lowess algorithm using templates
  ☆21Updated 10 years ago
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆36Updated 5 years ago
• tomilov / quickhull
  Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
  ☆76Updated 3 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆216Updated 9 months ago
• jrd730 / QuadTree
  a dynamic 2d space partitioning tree
  ☆24Updated 4 years ago
• erikerlandson / st_tree
  A fast and flexible c++ template class for tree data structures
  ☆115Updated 5 months ago
• cdalitz / kdtree-cpp
  Kd-Tree library for kNN and range queries in plain C++98
  ☆97Updated 2 years ago
• grame-cncm / digraph
  Very simple C++ directed graph library
  ☆79Updated 3 years ago
• vicrucann / CurveFitting
  Curve fitting based on Schneider's algorithm. Written using C++11 and OpenSceneGraph (visualization)
  ☆107Updated 8 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆132Updated last year
• aary / sharp
  Some C++ libraries I implemented
  ☆15Updated 8 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…
  ☆64Updated 7 years ago
• lemire / runningmaxmin
  Fast maximum-minimum filters implemented in C++
  ☆47Updated 3 years ago
• gishi523 / kd-tree
  An implementation of k-d tree
  ☆187Updated last year
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆80Updated 2 years ago
• hgomersall / SSE-convolution
  A demonstration of speeding up a 1D convolution using SSE
  ☆51Updated 9 years ago
• tzaeschke / phtree-cpp
  PH-Tree C++ implementation
  ☆37Updated this week
• FlexCoreLib / flexcore
  Build fast computational graphs quickly using modern C++
  ☆54Updated 5 years ago
• Jaybro / pico_tree
  A C++ header only library for fast nearest neighbor and range searches using a KdTree. It supports interfacing with Eigen, OpenCV, and cu…
  ☆46Updated 5 months ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆71Updated 9 years ago
• gerazo / loose_quadtree
  Loose Quadtree (Region Tree) simple C++11 implementation
  ☆65Updated last year
• bfierz / vcl
  Visual Computing Library
  ☆20Updated 3 weeks 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…
  ☆74Updated 3 months ago
• nitnelave / lru_cache
  A C++ implementation of a LRU cache
  ☆42Updated 5 years ago
• atoader / HilbertRTree
  Naive Hilbert R-Tree implementation
  ☆31Updated 11 years ago
• llnl / fpzip
  Lossless compressor of multidimensional floating-point arrays
  ☆124Updated 5 years ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆51Updated 3 years ago