|
p' = Mp, where p=[x,y,1]T and M is a 3x3 matrix of the form: |
|
- [3 marks] Write the matrix M for such a transformation if one exists.
- [3 marks] Decompose M into a scale matrix S, and translate matrix T.
- [2 marks BONUS] Prove or disprove that an ellipse with its principal axes along X and Y can be transformed to a circle of radius 1 centered at <0,0> using only a scale and translate operation.
Suppose we now triangulate the clipped polygon and scan convert every other triangle (If you look at any internal edge you have introduced to triangulate your polygon, one and only one of the two triangles on either side of the edge should be scan converted).
[1 mark] Is it always possible to scan convert every other triangle as described?
[3 marks BONUS] Given a convex polygon with n vertices what is the number of different triangulations T(n) it can have (Example : T(3)=1, T(4)=2, T(5)=5,T(6)=14).
submit -N a1q5 csc418h poly.cpp ui.cpp
submit -N a1q5 csc2504h poly.cpp ui.cpp