Course Title:
Discrete and Computational Geometry
Course Description:
Retired August 31, 2007; replaced with MTH G235. Discusses basic concepts in discrete and combinatorial geometry, as well as some concepts in computational geometry. Topics may include convex sets and their basic properties; separation theorems for convex bodies; lattices and quadratic forms; Minkowski’s theorem and the geometry of numbers; packing, covering, and tiling of spaces; packing and covering densities; Minkowski-Hlawka theorem; sphere packings and codes; triangulation algorithms; algorithms for Voronoi diagrams; convex hull algorithms; and other topics at instructor’s discretion.
Fall Offering:
None
Lab/Coreq 1:
Spring Offering:
None
Lab/Coreq 2:
Summer Offering:
None
Lab/Coreq Remarks:
Summer 1 Offering:
None
Prerequisite 1:
Summer 2 Offering:
None
Prerequisite 2:
Cross-Listed Course 1:
Prerequisite 3:
Cross-Listed Course 2:
Prerequisite 4:
Cross-Listed Course 3:
Prerequisite 5:
Cross-Listed Course 4:
Prerequisite Remarks:
Cross-Listed Course 5:
Repeatable:
N
Additional Information:
Retired course
