Davis, TimIsabel Navazo and Petr Felkel2015-07-142015-07-142007https://doi.org/10.2312/eged.20071014This 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.10.2312/eged.2007101433-40