interval-tree

I'm looking for an interval tree C# collection class. I need to be able to add intervals, idealy 2D, otherwise perhaps I could combine two standard 1D interval trees. I also need to be able to find out what intervals overlap a given interval. I found this intervaltree.codeplex.com but There are no downloads associated with this release. edit: Continue here: C# using others code There is a download on the codeplex page: http://intervaltree.codeplex.com/SourceControl/list/changesets -> Right hand side -> Download I just wrote another implementation which can be found here: https://github.com

This question already has an answer here: C++ - interval tree implementation 5 answers I'm trying to find an efficient C++ interval tree implementation (mostly likely based on red black trees) without a viral or restrictive license. Any pointers to a clean lightweight standalone implementation? For the use case I have in mind, the set of intervals is known at the outset (there would be say a million) and I want to be able to quickly obtain a list of intervals that overlap a given interval. Thus the tree once built will not change -- just needs rapid queries. I've written a template-based

Iv'e downloaded a C# interval tree collection class class from here http://intervaltree.codeplex.com/SourceControl/list/changesets -> Right hand side -> Download. However I can't open the whole project on my Microsoft Visual C# 2010 Express (that also runs C# XNA) because Solution folders are not supported in this version of the application Also I just want the class to use separately in my own seprate project. I tried to copy the three important seeming files Interval.cs , IntervalNode.cs and IntervalTree.cs into my project but this generated the compile error There are no importers which

Does someone know any good interval tree implementation in C++? Obviously, something template-driven, better in boost -like style. And another question - if somebody tested, does a basic std::vector -based interval tree implementation with sorting can beat the generic interval tree (with O(lg) operations) in practice? Boost-like ? Boost ICL ! The Boost Interval Container Library I had exactly the same need. I couldn't find any suitable (simple, modern, portable) implementations, so I used a python implementation by Brent Pedersen as a guide and wrote a barebones C++ version . The IntervalTree

What are differences between segment trees, interval trees, binary indexed trees and range trees in terms of: Key idea/definition Applications Performance/order in higher dimensions/space consumption Please do not just give definitions. All these data structures are used for solving different problems: Segment tree stores intervals, and optimized for " which of these intervals contains a given point " queries. Interval tree stores intervals as well, but optimized for " which of these intervals overlap with a given interval " queries. It can also be used for point queries - similar to segment