Computer Graphics Educational Materials (CGEMS) [2004 - 2011]

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/13864

Browse

Browsing Computer Graphics Educational Materials (CGEMS) [2004 - 2011] by Subject "Algorithm development"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    A Lab Exercise for 2D Line Clipping
    (The Eurographics Association, 9-7-2007) Stahl, David; -
    Line clipping is a fundamental topic in an introductory graphics course. The simplicity and elegance of the classic Cohen-Sutherland 2D Line Clipping Algorithm makes it suitable for implementation by the student in a lab exercise. An understanding of the algorithm is reinforced by having students write actual code and see the results. A code framework is provided that allows an instructor to focus student effort on the algorithm while avoiding the details of the visualization API used to render the results.
  • No Thumbnail Available
    Item
    A Lab Exercise for Rasterizing Lines
    (The Eurographics Association, 7-1-2008) Stahl, David; -
    Rasterizing lines is one of many fundamental topics in an introductory graphics course, with Bresenham's Algorithm particularly well suited for student implementation. By having students complete carefully prepared scaffold code, understanding is reinforced by means of an exercise no more difficult than a short lab assignment. To accomplish this a particular code framework is imposed that allows an instructor to focus student effort on the algorithm while avoiding details of the visualization API.
  • No Thumbnail Available
    Item
    Parametric Polynomial Curves
    (The Eurographics Association, 25-1-2008) Stahl, David; -
    Spline curves and surface patches have an innate mathematical beauty and broad practical application in the field of computer graphics. Yet the subject proves difficult to convey to beginning graphics students averse to math and theory in general. The difficulty is mitigated by having students complete an implementation of carefully prepared scaffold code. A particular code framework allows focusing student effort on understanding the algorithm and the theory rather than the visualization details. In this manner understanding is developed and reinforced by means of an exercise no more difficult than a short lab assignment.