• e.g., #include <math.h> and -lm
• "interface" (.h) and "implementation" (.c)
• example of vec_sum function

• vec_len, vec_read, vec_print
• example Makefile

• vec_unit, vec_dot, vec_cross
• example Makefile

• coordinate reference frame mapping (image to world coord's)
• 3-stop outline of ray tracing algorithm
• concept of generic linked list data structure

• "interface" (.h) and "implementation" (.c)
• example of link_init, list_init, list_add, list_empty
• example Makefile

• print statements
• the gdb debugger

• material file entry structure
• material data structure (abstract data type)
• material processing functions
  • material_init
  • material_load_attributes
  • material_getbyname
  • material_list_print
  • material_getambient

• parsing the data file mat.txt
• material_load_attributes
• header file organization, Makefile

• generic objects and specialized object instances (inheritance)
• generic and specialized object member functions (polymorphism)
• "isa" relationship
• function pointers
• object_t and plane_t data types
• object_print and plane_print functions

• object_init and plane_init functions

• plane equation
• what is pln->ndotq?
• ray-plane intersection
• object_hits and plane_hits functions

• Makefile
• model.h
• model.c
• matrix.h
• matrix.c
• mat_xpose() and vec_xform()

• vec_xform() bug
• plane_init()
• argc, argv
• fopen, fclose
• camera.h
• camera.c
• pointers to pointers

• calling camera_init() and camera_print()
• on to ray tracing...

• writing a .ppm image
• converting image pixel coordinates to world coordinates
• calculating ray direction
• converting double pixel r,g,b values to unsigned char r,g,b values

• using drgb_t color as color accumulator
• calling object_find_closest()
• getting material ambient color
• scaling material ambient color, adding to drgb_t color color accumulator

• #include <iostream>
• #include <string>
• std::cout << and its interpretation: std::cout.ostream<<()
• the "big three":
  • copy constructor
  • destructor
  • assignment operator
• class data_t (lab 8)

• int main() (lab 7)
• using std::cin for i/o
• list_t function calls
• data_t constructor and friend std::ostream& operator<<(std::ostream& s, data_t rhs)

• list_t interface and implementation

• C
• linear algebra
• object-oriented principles
• writing functions, programs
• understanding (tracing) programs
• pointers, pointers to functions
• linked lists

• constructors (overloaded)
• C++ i/o (std::istream& operator>> and std::ostream& operator<<)
• double& operator[](int i) {} mutator
• const double& operator[](int i) const {} accessor
• intended usage of operator=(), operator*(), operator+(), operator-()

• assignment operator reminder to return *this;
• operator=()
• operator*()
• operator+()
• operator-()
• operator-() (unary)
• dot() and len() functions

• material_t object
• material_getbyname search function

• base class, derived class relationships
• using std::string material as index into materials list
  (eventually could use an associative array to store materials)
• virtual functions
• derived class : public object_t syntax
• getting base class (parent) to read/write itself
  (no need for *priv pointer)

• C++ file i/o
• find_closest() function
• getting model to "read itself" via model_ifs >> model

• ray/sphere intersection

• rendering equation

• ray casting

• general structure of the ray_trace routine
• the lighting loop
• reflection (recursion)
• final color composite (linear interpolation)

• object_t behaves like a pure virtual class— cannot allocate itself
• void *priv; pointer not needed
• object_init() function signature changes
• plane_t must "include" object_t at top for pointer "masquerading" to work

• benefit is code reduction: one class (rgb_t<>) instead of two (drgb_t and irgb_t)
• idea is for compiler to replicate the code for us
• only need to provide three things along with template <typename T> syntax:
  1. forward declaration(s)
  2. templated friend declarations (and separate implementations)
  3. specializations

• need to move data_t into its own header
• make sure you can s << (*rhs);
• let user delete own data (list shouldn't delete data it did not allocate)

• use iterator and const_iterator to iterate through list
• two ways of deleting from list

• two problems with old, singly-linked list

• the doubly-linked list

• writing your own iterators

No class: Student Evaluations (online)

• main()
• ray_trace() (from asg3)

• const_iterator
• iterator

• Makefiles
• C programming
• C++ programming
• C++ polymorphism
• C++ iterators
• C++ templates
• C++ STL