This version
Brightness from each vertex normal, interpolated across every triangle, faces sorted back to front, 576 triangles, no z-buffer.
How this version works
A torus with 24 segments around its ring and 12 around its tube is rotated and projected into a 320-pixel-wide CPU buffer. Its analytic vertex normals rotate with the mesh, and their dot products with a fixed light direction produce brightness values with a small ambient offset. Brightness is interpolated across each triangle and used to index a 256-entry, VGA-quantised colour ramp. The 288 quads are sorted from far to near, back-facing quads are rejected, and each remaining quad becomes two triangles.
The trick in this version
The texture-triangle routine is reused as a Gouraud shader by treating brightness as a one-dimensional texture coordinate. Painter sorting replaces a per-pixel depth buffer.
Historical context · PC
1994 · Jmagic & Jugi / Komplex · Cyboman 2
Gouraud in 64K
The Party 1994 64K winner, with smoothly shaded objects: brightness per vertex, interpolated across each polygon.
mid-'90s · Logic Design
One polygon more
As the story is told, Logic Design answered with a wasp of one polygon more, then flew it into a fan, so you watch the face count fall as it gets chopped up.
1993 · Psi / Future Crew · Second Reality
Glenz and filled vectors
A separate vector engine and a GLENZ executable: CPU-rendered polygon objects inside a tightly sequenced demo.
- Platform
- PC · 486
- Era
- PC
- Rendered on
- CPU
- Tags
- Gouraud · painter's algorithm