CS 284 - CAGD - Think Problems
Devise Generator Programs for the following cases:
1) Any possible triangle that fits on a 8.5x11" page;
2) Any convex quadrilateral on the infinite x-y-plane;
3) Any possible (infinite, straight) line on the x-y-plane.
In all cases determine the minimum number of DoFs,
and make sure, that your generator could produce all
constructs that are possible and fit the constraints!
OK to discuss this with your neighbors ... !