| Course Type | Elective Course |
|---|
| Course Level | Bachelor's Degree |
|---|
| Year of Study | - |
|---|
| Semester | - |
|---|
| ECTS | 5 |
|---|
| Name of Lecturer(s) |
|
| Learning Outcomes |
At the end of this course, the students;
- Learn principles of computer graphics, graphic packets and related algorithms and also related searching algorithms and data structures.
- Learn information about trees, vectors, points, polygones, edges, geometric objects and triangles.
- Learn finding of polygones in star shape, point encapsulation.
- Learn clipping algorithms and finding convex shells.
- Learn polygone triangulation, hidden surface removal, intersection and delaunay triangulation.
- All students make a final project that covers all the topics they learned.
|
| Mode of Delivery | Face to face |
|---|
| Prerequisites | No |
|---|
| Recommended Optional Programme Components | None |
|---|
| Course Description | 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 |
Fundamentals of Computer Graphics |
|
2nd Week |
Graphics Systems |
|
3rd Week |
Graphics Packages |
|
4th Week |
Application Areas |
|
5th Week |
Related Search Algorithms |
|
6th Week |
Data Structures |
|
7th Week |
Trees |
|
8th Week |
Mid-term |
|
9th Week |
Vectors |
|
10th Week |
Points |
|
11th Week |
Polygons, Edges, Geometric Objects |
|
12th Week |
Triangles, Intersection Finding, Star-Shaped Polygon Detection, Point Enclosure |
|
13th Week |
Clipping Algorithms, Convex Hull Finding |
|
14th Week |
Hidden Surface Removal, Intersection Finding and Delaunay Triangulation |
|
15th Week |
General Repeat |
|
| Recommended 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ı
|
|---|
| Planned Learning Activities and Teaching Methods |
- Questions/Answers
- Lecture
- Experiment
- Project
- Report Preparation
- Problem Solving
|
|---|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
30 |
| Assignment |
1 |
5 |
| Quiz |
5 |
15 |
| Project |
1 |
10 |
| Total(%) |
|
60 |
| Contribution of In-term Studies to Overall Grade(%) |
|
60 |
| Contribution of Final Examination to Overall Grade(%) |
|
40 |
| Total(%) |
|
100 |
|
| ECTS Allocated Based on Student Workload |
| Activities |
Quantity |
Duration (Hour) |
Total Workload (Hour) |
| Midterm exam |
1 |
1.5 |
1.5 |
| Preparation for Quiz |
|
|
|
| Individual or group work |
|
|
|
| Preparation for Final exam |
1 |
20 |
20 |
| Course hours |
14 |
3 |
42 |
| Preparation for Midterm exam |
1 |
15 |
15 |
| Laboratory (including preparation) |
|
|
|
| Final exam |
1 |
1.5 |
1.5 |
| Homework |
|
|
|
| Project |
1 |
70 |
70 |
| Quiz |
4 |
0.5 |
2 |
| Total Work Load | 152 |
| Total Work Load / 30 (h) | 5.06 |
| ECTS Credit of the Course | 5 |
|
| Language of Instruction | Turkish |
|---|
| Work Placement(s) | No |
|---|
