At the end of this course, the students; 1) Learn principles of computer graphics, graphic packets and related algorithms and also related searching algorithms and data structures. 2) Learn information about trees, vectors, points, polygones, edges, geometric objects and triangles. 3) Learn finding of polygones in star shape, point encapsulation. 4) Learn clipping algorithms and finding convex shells. 5) Learn polygone triangulation, hidden surface removal, intersection and delaunay triangulation. 6) All students make a final project that covers all the topics they learned.
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
None
COURSE DEFINITION
Applications of computer graphics, overview of graphics systems and graphics packages. Related search algorithms, data structures, trees, vectors, points, polygones,edges, geometric objects and triangles. Finding intersection, star shape polygones, clipping algorithms, convex shell, polygone triangulation, hidden surface removal, intersection and delaunay triangulation.
COURSE CONTENTS
WEEK
TOPICS
1st Week
Applications of computer graphics,
2nd Week
overview of graphics systems
3rd Week
and graphics packages.
4th Week
Related search algorithms,
5th Week
Application Fields
6th Week
data structures,
7th Week
trees,
8th Week
Mid-term
9th Week
vectors,
10th Week
points,
11th Week
polygones,edges,geometric objects and triangles.
12th Week
Finding intersection,star shape polygones,
13th Week
clipping algorithms,convex shell,
14th Week
polygone triangulation, hidden surface removal,intersection and delaunay triangulation.
RECOMENDED OR REQUIRED READING
1. Computational Geometry and Computer Graphic in C++, 1996, Laszlo M. J. Prentice Hall 2. Computational Geometry in C, O'Rourke J. 3. Ders Notları