Wednesday, July 16, 2008

Cool Data-Structure: Interval Tree

Geometric Algorithms are pretty darned cool. I've found them interesting for a long time; in fact my new-found love affair with cool algorithms came from my interest in them. The book Data Structures for Computer Graphics, while lacking in certain descriptions, contains a load of fun structures. The first one I just had to implement in Ruby was the Interval Tree, which as a mathematician allowed me to play with the structure theorem for open intervals in the reals in a cool way. I may even post my implementation here later, but for now read the Wiki and see if this is cool for you too!

For a snippet of the book check out this file: Geometric Data Structures for Computer Graphics [PDF]. This is by the authors of the above book and contains much of the same content and even some pretty pictures.

Coming Soon: my implementation from early in my Ruby explorations.

No comments:

Powered By Blogger