| dc.contributor.author | Stahl, David | en_US |
| dc.contributor.editor | - | en_US |
| dc.date.accessioned | 2015-12-10T13:43:22Z | |
| dc.date.available | 2015-12-10T13:43:22Z | |
| dc.date.issued | 9-7-2007 | en_US |
| dc.identifier.issn | - | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/cgems04-11-1362 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | 2D and 3D modeling | en_US |
| dc.subject | Algorithm development | en_US |
| dc.subject | Rendering | en_US |
| dc.subject | Algorithmic | en_US |
| dc.title | A Lab Exercise for 2D Line Clipping | en_US |
| dc.description.seriesinformation | CGEMS - Computer Graphics Educational Materials | en_US |
| dc.description.sectionheaders | Modules | en_US |
| dc.identifier.doi | 10.2312/cgems04-11-1362 | en_US |
| dc.identifier.pages | David Stahl-2D and 3D modeling, Algorithm development, Rendering, Algorithmic | en_US |
