RangeTree
A generic implementation of a centered interval tree in C#. In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.
Activity
- Latest release
- 5y ago
- Total releases
- 12
- Cadence
- ~2 months
- Last 12 months
- 0
Details
- First release
- Jul 01, 2017
Releases
| Version | Released | |
|---|---|---|
3.0.1
patch
| ||
3.0.0
major
| ||
2.1.0
minor
| ||
2.0.1
patch
| ||
2.0.0
major
| ||
1.0.6
patch
| ||
1.0.5
patch
| ||
1.0.4
patch
| ||
1.0.3
patch
| ||
1.0.2
patch
| ||
1.0.1
patch
| ||
1.0.0
initial
|