[Intermediate → Advanced] · Twelve exercises. Graphics is the domain where you can see whether you understood it.
That’s its advantage over every other course in this vault: a wrong matrix produces a visibly wrong picture, and a wrong shading model looks like plastic. The feedback is immediate and unambiguous.
Two routes, and both are fine:
- Shadertoy — a fragment shader in a browser, zero setup. Best for 1, 4–7
- A CPU renderer in any language writing a PPM/PNG file. Best for 2–3, 8–10. No graphics API, no drivers, no build system — just arithmetic and a file
Solutions in note 18.
Part A — The pipeline (notes 09–10)
1. Colour by normal.
Render a sphere and set the pixel colour to normal * 0.5 + 0.5.
Done when: you get the classic pastel ball, and can say why the transform is needed — and this is the single best first graphics exercise there is, because a wrong normal is instantly visible → note 11.
2. Build the transform chain by hand.
Implement model → world → view → projection → NDC → screen for a cube. No library.
Done when: the cube renders in perspective, and you can state what each matrix does and what happens if you swap two of them → note 09.
3. Rasterise a triangle.
Implement the edge-function test and barycentric interpolation. Fill a triangle with vertex colours interpolated across it.
Done when: the gradient is smooth, adjacent triangles share edges with no gaps and no double-drawn pixels — the fill rule is the fiddly bit → note 10.
4. Break perspective-correct interpolation.
Texture a large quad interpolating UVs linearly in screen space, then correctly (interpolate , , ).
Done when: the naive version shows the characteristic warped seam and the correct one doesn’t. This is why PS1 games look the way they do.
Part B — Shading (notes 11–12)
5. Build up a lighting model.
Start with flat colour, add Lambert diffuse, add Blinn–Phong specular, add ambient. Render each stage.
Done when: you have four images and can attribute each visual change to its term → note 11.
6. Make it physically based.
Replace Blinn–Phong with a GGX/Cook–Torrance BRDF. Render a grid varying roughness and metalness.
Done when: the grid looks like the material charts in every PBR guide, and you can say what energy conservation buys you.
7. Alias, then fix it.
Render a checkerboard receding to the horizon with point sampling. Then add mipmapping, then anisotropic filtering.
Done when: you’ve seen the shimmer, and can explain it as undersampling a signal above the Nyquist limit → note 12 · information theory.
8. Gamma.
Render a gradient and a lighting calculation without gamma correction, then with. Average two colours in sRGB space, then in linear space.
Done when: you can show that averaging in the wrong space gives a visibly wrong midpoint — and you know which of your favourite images are wrong because of this.
Part C — Ray tracing and geometry (notes 14–15)
9. Write a ray tracer in a weekend.
Follow Shirley’s Ray Tracing in One Weekend: spheres, diffuse, metal, dielectric, defocus blur.
Done when: you have the cover image. This is the highest-value single exercise in the course — the rendering equation stops being notation.
10. Add one bounce, then many.
Render your scene at 1, 2, 4, 16 bounces, and at 1, 10, 100, 1000 samples per pixel.
Done when: you can point at colour bleeding that appears only with multiple bounces, and explain why noise falls as rather than → note 14.
11. Make it fast with a BVH.
Add a bounding volume hierarchy. Time before and after on a scene of 500+ spheres.
Done when: you have the ratio and can state the complexity change from per ray → DSA.
12. Mesh normals.
Load an OBJ, compute face normals, then smooth vertex normals by averaging. Render both.
Done when: you can see faceting versus smooth shading, and can explain why a cube should not have smoothed normals → note 15.
Part D — Classical raster graphics (notes 01–07)
The SSG 511 exam and assignment questions are the practice set for Part 1 — Bresenham tables, Cohen–Sutherland clipping, transforming shapes, Bézier control points and de Casteljau splits. They are in the question bank, deliberately unsolved; each teaching note ends with its own independent task, and the runnable scripts in notes 02, 04 and 06 check your hand work.
Related
- Solutions
- SSG 511 question bank
- the course
- graphics for games — the same material under a frame budget
Source: [reference] — built from this course’s own gap-closing list.
Software engineering
Infrastructure & security
Computer science
Hardware & engineering