Teaching Data Structures and Algorithms through Graphics

Simple item page
dc.contributor.authorDavis, Timen_US
dc.contributor.editorIsabel Navazo and Petr Felkelen_US
dc.date.accessioned2015-07-14T12:21:59Z
dc.date.available2015-07-14T12:21:59Z
dc.date.issued2007en_US
dc.description.abstractThis paper presents experiences from a first-time implementation of a data structures and algorithms course based on a specific computer graphics problem, namely surface reconstruction from unorganized points, as the teaching medium. The course required sophomore students to implement the algorithm found in Hoppe et al. s SIGGRAPH 92 paper of the same title. This problem was chosen since the solution lends itself well to an exploration of data structures and code modularization into distinct project phases and milestones, both of which are traditionally taught in early CS courses. While the original course goals were accomplished, our experiences suggest potentials for greater streamlining of these concepts, which are detailed herein.en_US
dc.description.sectionheadersED2 - Teaching with Computer Graphicsen_US
dc.description.seriesinformationEG Education Papersen_US
dc.identifier.doi10.2312/eged.20071014en_US
dc.identifier.pages33-40en_US
dc.identifier.urihttps://doi.org/10.2312/eged.20071014en_US
dc.publisherThe Eurographics Associationen_US
dc.titleTeaching Data Structures and Algorithms through Graphicsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
033-040.pdf
Size:
335.91 KB
Format:
Adobe Portable Document Format
Download
Collections
Education Papers 2007