pp. 49-56
DOI: 10.2312/conf/EG2012/education/049-056
Abstract:
This paper presents the evolution of a data structures and algorithms
course based on a specific computer graphics problem, namely photon
mapping, as the teaching medium. The paper reports development of the
course through several iterations and evaluations, dating back five years.
The course originated as a problem-based graphics course requiring
sophomore students to implement Hoppe et al.'s algorithm for
surface reconstruction from unorganized points found in their SIGGRAPH
'92 paper of the same title. Although the solution to this
problem lends itself well to an exploration of data structures and code
modularization, both of which are traditionally taught in early computer
science courses, the algorithm's complexity was reflected in
students' overwhelmingly negative evaluations. Subsequently,
because implementation of the kd-tree was seen as the linchpin data
structure, it was again featured in the problem of ray tracing trees
consisting of more than 250,000,000 triangles. Eventually, because the tree
rendering was thought too specific a problem, the photon mapper was chosen
as the semester-long problem considered to be a suitable replacement. This
paper details the resultant course description and outline, from its now
two semesters of teaching.
Categories and Subject Descriptors (according to ACM CCS): I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics Data Structures and Data Types