MATH 378 Discrete and Computational Geometry

How many ways can a polygon be subdivided into triangles? What is the analogue of a cube in higher dimensions? How can we describe the space of possible configurations for a robotic arm? In this class we will explore questions of discrete geometry like these and discuss their applications and implementations. Potential topics include convexity, polygons and polytopes, triangulations, Voronoi diagrams, configuration spaces, partially ordered sets and lattices.

Credits

1

Prerequisite

MATH 264 or 272 or 290 or permission of instructor

Offered

Fall

Instructor

Michael Dougherty