CART cache implementation.

I've created Google Code project to share my implementation of CART caching strategy. It has better characteristics than LRU and is fully thread safe. Kind of 'memcached' inside your C++ application. I'm using it, as example, for Memory Mapped Files to map only limited number of 16MB chunks to avoid enormous virtual memory consumption on very large files (10Gb+). Cache in this case decide which pages to evict from memory, keeping frequently used ones.

You can find implementation here: http://code.google.com/p/cart-cache/

Derivative maps.

Another interesting reading about derivative maps:
http://www.rorydriscoll.com/2012/01/11/derivative-maps/

Author solved the original problem with closeups by doubling bump map storage requirements. Looks pretty cool to me.