Exercise #2
Examine the code for computing the bounding box of the triangle in
EdgeEqn( ) and FlatTri.triangleSetup( ).
- Explain what is being saved in the EdgeEqn.flag
- Explain the contents FlatTri.sort[ ]
- Explain how the bounding box is computed
- Discuss the advantages and disadvantages of this approach
- Write down I give up if this exercise takes you more than 1 Hr.
Limit your discussion to one single-sided sheet of 8.5 by 11 paper.
Turn this exercise in the next time that we meet.
|