MAT 408 - Computational Geometry

Institution:

Centre College

Subject:

Description:

A study of geometry from an algorithmic perspective, this course examines classic problems such as The Art Gallery Problem, The Post Office Problem, and The Piano Movers' Problem. Computational Geometry focuses on the design and analysis of efficient algorithms to solve problems which can be stated in terms of basic geometric objects like points, lines, segments, polygons, etc. We will consider various strategies for building convex hulls, Voronoi diagrams, and Delaunay triangulations; finding nearest neighbors and closest pairs; as well as line segment intersection, linear programming, polygon triangulation, point location, and range searching. Prerequisite: MAT 290; or MAT 230 and CSC 117; or permission of the instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.centre.edu

Phone Number:

(859) 238-5200

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Four-one-four plan

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.