CSC 634 Computational Geometry (3 credits)
The course covers design, implementation and analysis of data structures and algorithms for solving geometric problems concerning objects like points, lines, polygons in 2-dimensional space and in higher dimensions. The course emphasizes the applications of computational geometry. Topics include overview of geometric concepts, curves and surfaces, data structures for representing solid models, convex hulls, line segment intersection, multi-dimensional data structures (kd-trees, quadtrees and BSP trees), and range searching, point location, triangulations and Voronoi diagrams.
Prerequisite: CSC 551 Design and analysis of Algorithms.