Show simple item record

dc.contributor.authorStahl, Daviden_US
dc.contributor.editor-en_US
dc.date.accessioned2015-12-10T13:43:21Z
dc.date.available2015-12-10T13:43:21Z
dc.date.issued7-1-2008en_US
dc.identifier.issn-en_US
dc.identifier.urihttp://dx.doi.org/10.2312/cgems04-11-1359en_US
dc.description.abstractRasterizing 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.subject2D and 3D modelingen_US
dc.subjectAlgorithm developmenten_US
dc.subjectRenderingen_US
dc.subjectAlgorithmicen_US
dc.titleA Lab Exercise for Rasterizing Linesen_US
dc.description.seriesinformationCGEMS - Computer Graphics Educational Materialsen_US
dc.description.sectionheadersModulesen_US
dc.identifier.doi10.2312/cgems04-11-1359en_US
dc.identifier.pagesDavid Stahl-2D and 3D modeling, Algorithm development, Rendering, Algorithmicen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record