Home  »  Faculty of Engineering »  Program of Computer Engineering (English 30%)

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
COMPUTATIONAL GRAPHICS BİL321 - 3 + 0 5

TYPE OF COURSE UNITElective Course
LEVEL OF COURSE UNITBachelor's Degree
YEAR OF STUDY-
SEMESTER-
NUMBER OF ECTS CREDITS ALLOCATED5
NAME OF LECTURER(S)Instructor Oğul Göçmen
LEARNING OUTCOMES OF THE COURSE UNIT 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 DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONApplications 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
WEEKTOPICS
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 READING1. 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 METHODSQuestions/Answers,Lecture,Experiment,Project,Report Preparation,Problem Solving
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Assignment15
Quiz515
Project110
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam11,51,5
Preparation for Quiz
Individual or group work
Preparation for Final exam12020
Course hours14342
Preparation for Midterm exam11515
Laboratory (including preparation)
Final exam11,51,5
Homework
Project17070
Quiz4,52
Total Workload152
Total Workload / 305,06
ECTS Credits of the Course5
LANGUAGE OF INSTRUCTIONEnglish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4LO5LO6
K1  X   X   X   X   X  
K2  X   X         X
K3  X   X     X     X
K4  X   X   X     X   X
K5           
K6           
K7           
K8           
K9           
K10           
K11           
K12