— Computational Geometry

Prerequisites & course information

Course Description: Mathematics of unstructured data. Algorithms for data structures such as Voronoi diagrams, oct-trees, and arrangements. Applications in computer graphics, concentrating on problems in three-dimensions. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter.