Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Interval tree
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== External links == * [http://www.cgal.org/ CGAL : Computational Geometry Algorithms Library in C++] contains a robust implementation of Range Trees * [https://www.boost.org/doc/libs/1_64_0/libs/icl/doc/html/index.html Boost.Icl] offers C++ implementations of interval sets and maps. * [https://github.com/chaimleib/intervaltree IntervalTree (Python)] - a centered interval tree with AVL balancing, compatible with tagged intervals * [http://code.google.com/p/intervaltree/ Interval Tree (C#)] - an augmented interval tree, with AVL balancing * [https://github.com/misshie/interval-tree/ Interval Tree (Ruby)] - a centered interval tree, immutable, compatible with tagged intervals * [https://github.com/Breinify/brein-time-utilities/#intervaltree IntervalTree (Java)] - an augmented interval tree, with AVL balancing, supporting overlap, find, Collection interface, id-associated intervals * [https://metacpan.org/dist/Tree-Interval-Fast Tree::Interval::Fast (Perl/C)] - Efficient creation and manipulation of interval trees. {{CS-Trees}} [[Category:Articles with example Java code]] [[Category:Search trees]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)