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. (Cross listed with CSC 870. May not be repeated under alternate prefix.) |
| Units: | 3 |
