Last week when working on an experimental project at my daily job, I remarked that I ended up making lots of range base loops and lots of for loops. These for loops were basically simple 0..K ranges where K was dynamic, then I asked myself if there were Python-like range iterators for sequences instead of for loops in the standard library. I found none. Then I decided to give it a try and code one by myself.
I’m working on a diagram toolkit on top of Qt Graphics View Framework and faced a problem: implementing an efficient bring to front mechanism. There’s the ideas and magic behind it.
Last year I played with clustered deferred shading. The implementation run nicely, and was tested with 1024 real-time lights. The cluster assignment is done with compute shaders, the logarithmic split uses only one variable making the configuration easy, and the shading itself is a simple Phong model.
In 2013, I made a voxel editor that used some of the usual stuff like octrees and marching cubes. Voxel updates were multi-threaded on the CPU, but GPU would be a better choice I guess… Even if I used marching cubes, I kept the blocky look because I love it. Maybe I’ll go back to it !
Chroma is a game I made from scratch in 48 hours for Ludum Dare 30. The theme was “connected worlds”.
Haha ha hahahahaha ! Testing plugins and stuff… fear ! int main(int argc, char** argv) { std::cout << “hello world ! ” << std::endl; return 0; }