RangeTree 3.0.0

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.

Install-Package RangeTree -Version 3.0.0

dotnet add package RangeTree --version 3.0.0

<PackageReference Include="RangeTree" Version="3.0.0" />

paket add RangeTree --version 3.0.0

Release Notes

BREAKING CHANGES: Removing RangeTree code after is has been renamed to IntervalTree in version 2.1.0.
Make sure that you upgrade to version 2.1.0 first and that you have no more errors before upgrading to this version. This version contains no new features, but fixes the misleading name "RangeTree" when in fact it is an Interval tree.
For a full list changes at https://github.com/mbuchetics/RangeTree/releases

Dependencies

• .NETFramework 4.5

  • No dependencies.

• .NETStandard 1.2

  • NETStandard.Library (>= 1.6.1)

• .NETStandard 2.0

  • No dependencies.

Used By

Version History