Adobe Photoshop, Gimp and many other graphic programs have a tool called Curves. You have several "knots" and while you move them, it computes a curve between. I was always wondered, how is this curve computed.
There are many "smart" algorithms in 2D graphics and Floyd-Steinberg error diffusion is one of them. Attached demo demonstrates a dithering on webcam output (or Bucks Bunny video, when webcam is not available).
Today's post will be about Quadtrees. I have coded a little visualization, which may help you understand this data structure.
I have made a little tool. Here you can specify some binary relation over a finite set. Then you can generate a closure of it.
Today I woud like to show you a remake of my previous flash app, which I rewrote into HTML5. It is the force-based graph algorithm form my previous article.