Here you will find all availble EECS courses listed alphabetically. The tabs above futher organize the courses by the starting letter of the course name. If there is a courses that you cannot find listed, or have questions about a course that are not answered by the courses description feel free to Contact Us.
Introduction to the representation, manipulation, and analysis of geometric models of objects. Implicit and parametric representations of curves and surfaces, with an emphasis on parametric freeform curves and surfaces such as Bezier and Nonuniform Rational B-Splines (NURBS). Curve and surface design and rendering techniques. Introduction to solid modeling: representations and basic algorithms. Projects in C/C++ using OpenGL.
Prerequisite(s): EECS 672 or permission of instructor.
Back to top
This course introduces students to computational graph theory and various graph algorithms and their complexities. Algorithms and applications covered will include those related to graph searching, connectivity and distance in graphs, graph isomorphism, spanning trees, shortest paths, matching, flows in network, independent and dominating sets, coloring and covering, and Traveling Salesman and Postman problems.
Prerequisite(s): EECS 560 or graduate standing with consent of instructor.
Back to top
