Re: Intervals tree

On Jun 15, 1:46 am, "0.0 Brain" <kill....@xxxxxxxxx> wrote:
Hi,

I'm looking for a data structure to handle intervals (numeric range
[a,b]). In my scenario ranges can be dinamically modified, inserted or
deleted and queries about intersecation are required.
I readhttp://en.wikipedia.org/wiki/Interval_treebut this
implementation seems not to allow insertion and deletion. While this
document:http://www.dgp.toronto.edu/people/JamesStewart/378notes/22intervals/
lacks of clarity.

Could you help me?

Tnx.

I think you need two structures: one to abstract the interval, other
to abstract a pool of intervals.
Why cant you write a simple class to implement the interval itself,
with intersection computation as a method?
And then use a heap to store these intervals?


.

Relevant Pages

  • [?] Intervals tree
    ... I'm looking for a data structure to handle intervals (numeric range ... deleted and queries about intersecation are required. ... implementation seems not to allow insertion and deletion. ...
    (comp.graphics.algorithms)
  • Re: Efficient Data Structures
    ... I agree with the others that the Red/Black tree should be easy to fix, and the SortedList will probably do what you want, too. ... This data structure is to hold large amounts of key-value pairs, and so needs to be efficient both in insertion and deletion. ... When removing the data, the minimum key with its data is to be removed. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Efficient Data Structures
    ... This data structure is to hold large amounts of key-value pairs, and so needs to be efficient both in insertion and deletion. ... When removing the data, the minimum key with its data is to be removed. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Efficient Data Structures
    ... > This data structure is to hold large amounts of key-value pairs, ... > needs to be efficient both in insertion and deletion. ...
    (microsoft.public.dotnet.languages.csharp)