3- Intended Learning Outcome :-

a- Knowledge and Understanding :-

Students who complete the course will have the ability to :-

a1- Illustrate Basics of Computational Geometry.

a2- calculate fractal dimension and apply the Iterative Function System in generating fractals.

a3- implement algorithms of triangulation and of two-dimensional convex hull generation in geometric problems. 

a4- characterize invariance properties of Euclidean geometry by groups of transformations.

a5- describe and construct basic geometric shapes and concepts by computational means.

a6- explain fundamental properties of Delaunay triangulation and sketch Voronoi diagrams.

b. Intellectual Skills :-

Students who complete the course will have the ability to :-

b1- Implement Geometrical problems.

b2- Build and plan an efficient algorithm for the given problem.

b3- Conclude and make proof of the theories using systematic steps.

b4- Integrate application of the geometrical algorithms in other scientific area. 

c-Professional Skills :-

Knowledge of the concepts and material presented in this course will provide the students with practical know-how to :-

c1- Design an effective algorithm for the geometrical problem.

c2- Write effective computer programs for the geometrical algorithm.

d-General Skills :-

Knowledge of the concepts and material presented in this course will provide the students with the capability to :-

d1- Understand and present the geometrical problem and how to deal with it as a data to be processed.

d2- Write and discuss effective computer programs that employ efficient algorithms.

d3- Analyze and design algorithms for solving scientific problems related to other disciplines.