COMPUTATIONAL GEOMETRY (2 CREDITS)

Learning Outcomes:

On successful completion of this course, students will be able to: Explain the properties of geometric objects in geometric problems; Describe efficient algorithms for convex hull, triangulation, Voronoi diagram and point location; Devise algorithms and data structure for geometric problems using OpenGL and CGAL; Describe convenient data structure for convex hull, triangulation, Voronoi diagram and point location.

Topics:

1. Introduction to Computational Geometry;
2. Convex Hulls;
3. Line Segment Intersection;
4. Polygon Triangulation;
5. Delaunay Triangulations;
6. Voronoi Diagrams;
7. Point Location;
8. Robot Motion Planning;
9. Project Presentation;
10. Introduction to OpenGL and CGAL;
11. Line Segment Intersection;
12. Polygon Triangulation;
13. Delaunay Triangulation;
14. Voronoi Diagrams;
15. Point Location;
16. Convex Hulls.