Alternatives and similar repositories for range-tree

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

• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆65Updated 9 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…
  ☆68Updated 4 months ago
• virtuald / r-star-tree
  A relatively simple implementation of the R* Tree data structure for C++
  ☆50Updated 2 years ago
• shortsleeves / visvalingam_simplify
  C++ Implementation of Visvalingam's algorithm (also known as Visvalingam Whyatt algorithm)
  ☆33Updated 4 years ago
• cdalitz / hclust-cpp
  C++ fast hierarchical clustering algorithms
  ☆87Updated 2 years ago
• tgeijten / xo
  Lightweight c++17 utility library
  ☆9Updated 2 months ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆67Updated 2 years ago
• improbable-eng / phtree-cpp
  PH-Tree C++ implementation by Improbable.
  ☆23Updated 2 years ago
• mraggi / discreture
  A modern C++ library for efficiently and easily iterating through common combinatorial objects, such as combinations, permutations, parti…
  ☆71Updated 3 years ago
• kashif / ceres-solver
  A Nonlinear Least Squares Minimizer
  ☆35Updated 13 years ago
• marcel-goldschen-ohm / EigenLab
  C++ utility for parsing/evaluating matrix math equations input at run time in a format similar to MATLAB (requires Eigen for matrix math)…
  ☆65Updated 5 years ago
• grame-cncm / digraph
  Very simple C++ directed graph library
  ☆76Updated 2 years ago
• ttalvitie / tinygeom2d
  Tiny 2D Geometry Library
  ☆29Updated 6 years ago
• genbattle / dkm
  A generic C++11 k-means clustering implementation
  ☆213Updated 2 months ago
• tpet / lemon
  LEMON Graph Library
  ☆42Updated 5 years ago
• IvanPinezhaninov / IntervalTree
  A red-black self-balancing interval tree
  ☆30Updated 4 years ago
• dengwirda / robust-predicate
  Robust geometric predicates without the agonising pain.
  ☆21Updated 5 years ago
• erikerlandson / st_tree
  A fast and flexible c++ template class for tree data structures
  ☆104Updated 3 years ago
• hroest / CppLowess
  A pure C++ implementation of the lowess algorithm using templates
  ☆21Updated 9 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated 2 months ago
• tomilov / quickhull
  Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
  ☆75Updated 2 years ago
• adishavit / hilbert
  Doug Moore's Fast Hilbert Curve Generation, Sorting, and Range Queries
  ☆71Updated 8 years ago
• gishi523 / kd-tree
  An implementation of k-d tree
  ☆180Updated last year
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆230Updated 4 years ago
• nitnelave / lru_cache
  A C++ implementation of a LRU cache
  ☆38Updated 4 years ago
• lemire / runningmaxmin
  Fast maximum-minimum filters implemented in C++
  ☆45Updated 2 years ago
• EvanBalster / STL_mono_wedge
  STL-Compatible Lemire-Fenn algorithm for running min/max
  ☆27Updated 5 years ago
• aary / sharp
  Some C++ libraries I implemented
  ☆15Updated 7 years ago
• NewProggie / ShapePP
  ShapePP is a rewrite of ShapeOp, a header-only C++ library for static and dynamic geometry processing.
  ☆16Updated 8 years ago
• tuxalin / THST
  Templated hierarchical spatial trees designed for high-peformance.
  ☆130Updated last year