Course Descriptions

Image: Photos of SF State students and scenes from around campus

MATH 870 : Computational Discrete Geometry

Prerequisites: CSC 210, CSC 330, MATH 325, or consent of instructor.
Description: Comprehensive overview of basic topics in computational discrete geometry: generating functions, complexity theory, convex hull, nearest-neighbor problems, efficient algorithims, etc. This course is offered as MATH 870 and CSC 870. Students may not repeat the course under an alternate prefix.
Units: 3
SF State Home