Fill 'Er Up looks at a variety of filling algorithms, and what happens when multiple fills are run simultaneously. Fill algorithms are useful for all kinds of applications, from traditional ink-and-paint for 2D animation to computing Voronoi diagrams in the plane.

Tricks of the Trade presents a grab-bag of useful techniques for computer graphics. I discuss cool little algorithms for interpolating 2D data, controlling ease curves, creating hierarchies of bilinear interpolations, and other small but useful tasks.

A Change of Scene talks about the art of the visual transition for film and television. You can see short compressed video demonstrations of the luminance plane, luminance mountains, and black bounce transitions here.

Quantum Computing, Part 1 presents an introduction to the strange world of quantum computing. I present the relevant big concepts from quantum mechanics in a conversational setting, avoiding any math. I show how the quantum world behaves in unexpected ways, and lay the groundwork for the following column.

Quantum Computing Part 2 presents some of the mathematics and theory behind quantum computing. I introduce the notation and basic ideas of the field, and discuss interesting quantum effects like superposition and entanglement. I show how quantum circuits compute simultaneous outputs for all inputs, and introduce the purely quantum "square-root-of-not" gate. Julio Cesar C Neto has pointed out that on page 93, the very first equation of the page should begin with a, not alpha. He's also observed that on page 87, line 8, the sentence should read, "A bra is a row vector, written <abc|, but we create it by forming the complex conjugates of the listed elements..."

Quantum Computing Part 3 wraps up this series. I present some of the key concepts behind quantum algorithms, and cover the cutting-edge techniques of dense coding, teleportation, and theoretically uncrackable encryption. I also provide some more pointers into the quantum computing literature, including some free programs for creating simulated quantum computers. Julio Cesar C Neto has pointed out that on page 73, the second row of the identity matrix should be |1> -> |1>.