Information Package
baskent.edu.tr

Program of Computer Engineering (English)

CSE321

COMPUTATIONAL GRAPHICS

Course Code
CSE321
Semester
-
Theory+Practice
3 + 0
ECTS
5
Course TypeElective Course
Course LevelBachelor's Degree
Year of Study-
Semester-
ECTS5
Name of Lecturer(s) -
Learning Outcomes

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
PrerequisitesNo
Recommended Optional Programme ComponentsNone
Course DescriptionApplications 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.
15th Week General Review
Recommended 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 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
Language of InstructionTurkish
Work Placement(s)No

Programme Qualifications / Learning Outcomes

LO1 LO2 LO3 LO4 LO5 LO6
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