Specific topics include searching, sorting, algorithms for graph problems, efficient data structures, lower bounds and NP-completeness. A variety of other topics may be covered at the discretion of the instructor. These include parallel algorithms, randomized algorithms, geometric algorithms, low level techniques for efficient programming, cryptography, and cryptographic protocols. This course provides a comprehensive introduction to computer graphics modeling, animation, and rendering. Topics covered include basic image processing, geometric transformations, geometric modeling of curves and surfaces, animation, 3-D viewing, visibility algorithms, and shading.
Students gain experience producing simple animations.
Like 15-462, its goal is to teach students to understand how graphics algorithms work, and how to develop their own, rather than on the use of commercial software systems. Prerequisites, hours, and units to be announced at the time of registration. Prerequisites, hours, and units to be negotiated with individual instructors. More information is available at the CS Undergraduate Office. More information is available at the CS Undergraduate Office and on the SCS undergraduate curriculum suggested options page.