CSE 355 - Computational Geometry

The design and analysis of efficient algorithms to solve geometric problems that arise in computer graphics, robotics, geographical information systems, manufacturing, and optimization. Topics include convex hulls, triangulation, Voronoi diagrams, visibility, intersection, robot motion planning, and arrangements.

3 credits

Prerequisite(s): AMS 301 ; programming knowledge of C or C++ or Java

Offered: This course is offered as both AMS 345  and CSE 355.


Print-Friendly Page (opens a new window)
Close Window