MAT 354

MAT 554

Discrete and Computational Geometry (3 Cr.)

Prerequisites: MAT 250, MAT 258

Description: This course gives an introduction to the basic theorems and algorithms of computational geometry, with particular attention paid to mathematical foundations. Topics include convex hulls, the theory of triangulation, Art Gallery Theorems, Voronoi diagrams, and the Delaunay graph. Further topics may include Minkowski sums, path finding, and randomized algorithms. CS 330 (Analysis of Algorithms) is recommended background for this course.

Retrieved from "http://www.digipen.edu/main/MAT_354"

This page has been accessed 1,922 times. This page was last modified 23:47, 1 February 2006.


DigiPen Institute of Technology  |  5001 150th Ave NE  |  Redmond, WA 98052  |  Phone toll-free: (866) 478-5236  |  info@digipen.edu

All content copyright © 2007 DigiPen(USA) Corporation. All rights reserved.
DigiPen® is a trademark of DigiPen (Canada) Corp.