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: CS 561.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
