CSCI3260
Principles of Computer Graphics
Transformations and cameras, rasterization and visibility, lighting and texture, ray intersections and bounding volumes, clipping, Bézier and rational curves, and the graphics pipeline.
Your progress
0/ 26 sections marked complete
Next section: Transformations, cameras, and perspective
Completion marks are saved in this browser.
This course in the web
In the CSCI3260 notes
- Theorem cards
- 54
- Definitions
- 54
- Counterexamples
- 34
- Concept lenses
- 20
- Histories of ideas
- 0
- Proof X-rays
- 24
No concept lens from this course is recorded in the web yet.
Counts cover the 26 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
In the webTheorem cards 54 · Definitions 54 · Counterexamples 34 · Concept lenses 20 · Proof X-rays 24
No concept lens from this course is recorded in the web yet.
Counts cover the 26 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.
Chapter 1 · 1 section
Transformations, cameras, and perspective
Affine and homogeneous coordinates, camera frames, inverse-transpose normals, projection, and clipping.
Theorems 2 · Definitions 2Counterexamples 2Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 1.1
Transformations, cameras, and perspective
Affine and homogeneous coordinates, camera frames, inverse-transpose normals, projection, and clipping.
Chapter 2 · 7 sections
Rasterization, visibility, and perspective-correct interpolation
Edge functions, shared-edge ownership, depth buffering, interpolation, and sampling limitations.
Theorems 18 · Definitions 13Counterexamples 11Lenses 4Proof X-rays 7
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 2.1
Rasterization, visibility, and perspective-correct interpolation
Edge functions, shared-edge ownership, depth buffering, interpolation, and sampling limitations.
- 2.5
Depth planes, visibility cells, and exact polygon averages
Screen-affine depth proofs, deterministic opaque ties, convex visibility cells, exact affine-color integrals and a certified depth-gap bound.
- 2.6
Scanline filling of a nonconvex polygon
Even-odd scanline filling of simple nonconvex polygons, endpoint conventions, boundary tests and exact rational events.
- 2.2
Integer line rasterization: midpoint decisions and exact ties
All-octant canonicalization, integer midpoint invariants, nearest-row error, exact ties and endpoint ownership.
- 2.3
Integer midpoint circles: decisions, symmetry and stopping
Exact integer circle decisions with proved invariants, stopping, symmetry deduplication and complete solutions.
- 2.4
Analytic pixel coverage: straight edges and finite-width strips
Proved finite box-coverage formulas, coordinate normalization, strips, edge-motion bounds and sampling counterexamples.
- 2.7
BSP trees and painter order
Split polygonal geometry by planes and prove a back-to-front traversal for opaque visibility.
Chapter 3 · 6 sections
Light, texture, compositing, and motion
Diffuse reflection, shading, texture filtering, premultiplied compositing, and geometric keyframe interpolation.
Theorems 10 · Definitions 16Counterexamples 7Lenses 5Proof X-rays 4
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 3.1
Light, texture, compositing, and motion
Diffuse reflection, shading, texture filtering, premultiplied compositing, and geometric keyframe interpolation.
- 3.2
Perspective texture footprints and mipmap scale
Perspective texture Jacobians, a proved finite-footprint error bound, singular values, mipmap scale and directional aliasing.
- 3.3
Interpolated shading and missed highlights
Compare vertex lighting with per-sample normal interpolation using explicit calculations.
- 3.4
Shadow maps: visibility from the light
Derive light-space depth comparisons, diagnose sampling errors, and distinguish filtering visibility from filtering depth.
- 3.5
Tangent frames and normal mapping
Construct a surface frame from texture coordinates and use it to interpret a sampled normal.
- 3.6
Linear light and display encoding
Why color arithmetic needs decoding, and how a display code differs from light.
Chapter 4 · 1 section
Ray intersections and visibility
Derive sphere and triangle intersections, nearest hits, and bounded shadow rays.
Theorems 2 · Definitions 1Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 4.1
Ray intersections and visibility
Derive sphere and triangle intersections, nearest hits, and bounded shadow rays.
Chapter 5 · 2 sections
Bézier curves: construction and continuity
Construct cubic curves, subdivide them, and test position and derivative continuity.
Theorems 5 · Definitions 3Counterexamples 2Lenses 2Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 5.1
Bézier curves: construction and continuity
Construct cubic curves, subdivide them, and test position and derivative continuity.
- 5.2
B-spline curves
Define B-spline basis functions by the Cox–de Boor recursion, prove local support and partition of unity, and derive the uniform cubic B-spline with its C² joins.
Chapter 6 · 1 section
Ray–box intervals and bounding-volume hierarchies
Derive a slab test and justify conservative closest-hit pruning.
Theorems 2 · Definitions 3Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 6.1
Ray–box intervals and bounding-volume hierarchies
Derive a slab test and justify conservative closest-hit pruning.
Chapter 7 · 2 sections
Clipping
Clip-space half-spaces and segment intervals.
Theorems 3 · Definitions 3Counterexamples 3Lenses 2Proof X-rays 2
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 7.1
Clipping a segment before perspective division
Derive clip-space parameter intervals, crossings and original-parameter attributes.
- 7.2
Convex clipping and consistent raster visibility
Construct a complete half-space polygon clipper, preserve attributes across new vertices, and connect exact coverage rules to sample-wise visibility.
Chapter 8 · 1 section
Rational curves
Homogeneous Bézier projection and a circular arc.
Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 8.1
Projective Bézier curves and a circular arc
Derive positive rational weights and verify a quadratic quarter circle.
Chapter 9 · 1 section
Rotation interpolation
Quaternion representation and spherical interpolation.
Theorems 2 · Definitions 3Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 9.1
Quaternions and spherical rotation interpolation
Derive quaternion rotations and a unit-length short-arc interpolation, including sign and boundary cases.
Chapter 10 · 1 section
A programmable graphics pipeline from equations to code
A complete WebGL 2 instructional page with buffers, shaders, rigid motion, input and depth testing.
Theorems 2 · Definitions 2Counterexamples 1Lenses 2Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 10.1
A programmable graphics pipeline from equations to code
Follow complete WebGL 2 instructional code through buffers, shaders, transformations, interpolation and depth testing, with explicit mathematical conventions.
Chapter 11 · 1 section
Native graphics dataflow
Graphics resources, frame presentation and input coordinates.
Theorems 2 · Definitions 2Counterexamples 2Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 11.1
Native graphics dataflow: buffers, textures, and framebuffers
Understand OpenGL core state and data ownership, derive fetch and precision contracts, and follow a complete offscreen texture-rendering routine.
Chapter 12 · 1 section
Bézier geometry and quaternion rigid animation
Bézier curves and patches, derivatives, rigid quaternion action and spherical interpolation.
Theorems 2 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 12.1
Joining Bézier surface patches
Derive positional and derivative matching along a complete patch edge, and distinguish tangent-plane agreement from matching parameter speeds.
Chapter 13 · 1 section
Scientific visualization
Scalar fields, volume integration and conforming isosurface extraction.
Theorems 2 · Definitions 3Counterexamples 1Lenses 1Proof X-rays 1
Chapter outline →See this chapter on the web →Not yet indexed in the web
- 13.1
Conforming marching tetrahedra and level ties
Extract the exact piecewise-affine level at a declared perturbed threshold, prove face consistency, and understand what degeneracies remain.