Nov 19, 2019  
2018-2019 Catalog 
    
2018-2019 Catalog [ARCHIVED CATALOG]

[Add to My Catalog]

EECS 265: Computational Geometry


Units: 4

Design and analysis of efficient and robust algorithms for geometric problems in two and three dimensions. Computational geometry algorithms are needed to solve problems in robotics, GIS, solid modeling, etc. Theoretical studies will be complemented by programming assignments. Undergraduate level knowledge of algorithm design and analysis, and linear algebra with programming experience in C/C++/Java and Matlab is strongly suggested.

Course Details
Repeatable for Credit: No
Laboratory included
Normal Letter Grade only

Requisites and Restrictions
Instructor Permission Required: No


Fall 2019 course scheduling information

Spring 2020 course scheduling information




[Add to My Catalog]