Using Trees for Sorted Rendering

Using Trees for Sorted Rendering
Author: Henry Yuen
Description: This article discusses the idea of using Binary Search Trees (BSTs) to render objects in the desired order.

nice article, thanks for your contribution

nicely written, Henry Yuen. Thank you

Thanks a lot! Its my first tutorial...just trying to give back to the community that nourished me when i was a complete noob!

cool, sounds like you got more in stock ?

why not use std::set? it's most often implemented as a RB-tree giving that it's mostly balanced.

I like to avoid STD containers, as:

1. I like to write things from scratch (yes, I know, I have the reinvent-the-wheel syndrome)
2. Overhead is slightly more than a bare bones tree. =).

Well I can understand the will to write it yourself it's a great learning experience.
But wouldn't it at least be quite smart to spend the time to implement a selfbalancing tree like a RB-tree then? Plain old B-trees have a tendency to get awfully unbalanced and that degenerates their performance to in worst case linear complexity O(N).

Also for locality of reference and other aspects I would consider taking a deeper look at your usage patterns, as describied in the article I think a heap would be a quite good match to.