interval-tree

This is an algorithmic question about a somewhat complex problem. The foundation is this: A scheduling system based on available slots and reserved slots . Slots have certain criteria, let's call them tags . A reservation is matched to an available slot by those tags, if the available slot's tag set is a superset of the reserved slot. As a concrete example, take this scenario: 11:00 12:00 13:00 +--------+ | A, B | +--------+ +--------+ | C, D | +--------+ Between the times of 11:00 to 12:30 reservations for the tags A and B can be made, from 12:00 to 13:30 C and D is available, and there's an

I need an IntervalTree or RangeTree implementation in Java, and am having trouble finding one with working deletion support. There's a built-in one at sun.jvm.hotspot.utilities.IntervalTree , but the deleteNode method in the RBTree superclass states: /** * FIXME: this does not work properly yet for augmented red-black * trees since it doesn't update nodes. Need to figure out exactly * from which points we need to propagate updates upwards. */ Trying to delete nodes from a tree ends up throwing the exception: Node's max endpoint was not updated properly How difficult would it be to properly

I'm looking for an interval tree algorithm similar to the red-black interval tree in CLR but that supports merging of intervals by default so that there are never any overlapping intervals. In other words if you had a tree containing two intervals [2,3] and [5,6] and you added the interval [4,4], the result would be a tree containing just one interval [2,6]. Thanks Update: the use case I'm considering is calculating transitive closure. Interval sets are used to store the successor sets because they have been found to be quite compact . But if you represent interval sets just as a linked list I

I was searching the last few days for a stable implementation of the R-Tree with support of unlimited dimensions (20 or so would be enough). I only found this http://sourceforge.net/projects/jsi/ but they only support 2 dimensions. Another Option would be a multidimensional implementation of an interval-tree. Maybe I'm completly wrong with the idea of using an R-Tree or Intervall-Tree for my Problem so i state the Problem in short, that you can send me your thoughts about this. The Problem I need to solve is some kind of nearest-neighbour search. I have a set of Antennas and rooms and for each

Given a list of intervals of time, I need to find the set of maximum non-overlapping intervals. For example, if we have the following intervals: [0600, 0830], [0800, 0900], [0900, 1100], [0900, 1130], [1030, 1400], [1230, 1400] Also it is given that time have to be in the range [0000, 2400] . The maximum non-overlapping set of intervals is [0600, 0830], [0900, 1130], [1230, 1400] . I understand that maximum set packing is NP-Complete. I want to confirm if my problem (with intervals containing only start and end time) is also NP-Complete. And if so, is there a way to find an optimal solution in