Lookup reference for Part 1 (notes 01–07). Every key formula on one page, for revision and for checking hand work. Matrices use column vectors (); for row vectors (, as in the SSG 511 assignment) transpose each one. The explanation of each formula lives in the linked note — this page is for after you have understood it.

Display → note 01

bits per pixel → colours.

Lines → note 02

Slope and DDA

Bresenham, (step in )

Bresenham, (step in )

Midpoint line: ; (lower) or (upper).

Circles → note 03

Midpoint circle

Bresenham circle

Eight-way symmetry: and about the centre.

Scan-line fill: next crossing (the edge’s inverse slope).

Clipping → note 04

Region code (TBRL): T if , B if , R if , L if . OR = 0000 → accept; AND ≠ 0000 → reject.

Cohen–Sutherland intersections

Liang–Barsky

Visible if . If and , reject.

Cyrus–Beck (outward normal , any edge point , )

entering (keep the largest as ); leaving (keep the smallest as ).

3D: 6-bit codes; in clip space, inside means .

2D transformations → note 05

About a point: .

Row-vector rotation:

, , , .

3D transformations → note 05

with , .

Homogeneous: ; ; is a direction.

Blocks: top-left 3 × 3 linear; right column translation; bottom row perspective; corner uniform scale.

Vectors and Bézier curves → note 06

Affine and barycentric combinations

Bernstein form

Quadratic and cubic

Cubic in matrix form

Derivative and end conditions

de Casteljau

Split at : the left edge is the first part; the right edge (bottom up) the second. First half at :

Chaikin corner cutting (each edge )

B-splines (Cox–de Boor) → note 06

Order , degree , continuity with distinct knots.

Geometry helpers → note 06

Point to segment

Flatness of a quadratic Bézier (max distance from the chord; halving divides it by 4)

Regular -gon, centre , radius

Visible surfaces → note 07

Back face (view direction into the scene): ; looking down , .

Depth-buffer memory: bytes per depth (1080p at 4 bytes ≈ 8.3 MB).

↑ Back to Computer Graphics