CSCE 441 Lecture 20

From Notes
Jump to navigation Jump to search

« previous | Friday, February 28, 2014 | next »

End Exam 1 content


Exam Review

6 questions, some with multiple parts (max sub-parts = 18)

  • Explanations, short-answer
  • Computation
  • No programming

50 minutes to complete


Know Algorithms

  • Scan conversion
  • Clipping


Clipping

Cohen-Sutherland

Region Codes where 1 bit means "outside the window"

  • If bitwise AND between region codes of endpoints is non-zero, then trivially reject
  • If bitwise OR is identical to zero, then trivially accept
  • Otherwise, have to split line into two segments via intersection


Liang-Barsky
  1. Set up parametric equation of line for t[0,1]
  2. Find intersection parameter with boundary.
  3. Reject if xmin>xmax

Transformations

Taking vector equations and turning them into matrix Form


Cross Product Matrix

(v×)=[0vzvyvz0vxvyvx0]


Non-Uniform Scaling

p^=p+(α1)(v(po))v

What's multiplied?

  • I
  • (α1)vvT

What's added?

  • (1α)v(vo)


[p^1]=[I+(α1)vvT(1α)v(vo)01][p1]

3D Rotations

p^=o+(1cosθ)(vq)v+(v×q)sinθ+qcosθ

q^=(1cosθ)(vq)+(v×q)sinθ+qcosθ


What is multiplied by q?

  • cosθ, but it's not a scalar, so we need an identity factor: cosθI
  • sinθ(v×)
  • (1cosθ)vvT

We add all of these things together (esentially factoring out q) and fill in the upper-left block of our matrix

[cosθI+sinθ(v×)+(1cosθ)vvT001]

Color

  • Half-toning
  • Dithering
  • Error diffusion
  • models of color
  • Equations (total of 3; one per color)
  • Properties of light

Lighting

(last topic covered chronologically)

Know definitions and ways to compute

  • Ambient
  • Diffuse
  • Specular