Computational Geometry

CS 506 (3)

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: 561



Prerequisites / Corequisites

Algorithms/Data Structure - CS 561



Course Search:




Keyword Search:

Office of the Registrar

MSC 11 6325
1 University of New Mexico
Albuquerque, NM 87131

Phone: (505) 277-8900
Fax: (505) 277-6809