CS 506 - Computational Geometry - 3 credit hours


Development of algorithms and data structures for the manipulation of discrete geometric objects in two- and three-dimensional space. Typical problems include intersection and union of polyhedra, convex hulls, triangulation, point location, neighborhood structures, and path computations.

Prerequisite: 461.