Semester:
8th
Course Type:
Elective Specialization courses (ΠΜ-E)
Track:
-
Code:
ΘΠ11
ECTS:
6
TEACHING HOURS per week
Theory:
3
Seminar:
1
Laboratory:
-
Specializations
Foundations of Computer Science (S1):
B Βασικό
Data and Knowledge Management (S2):
-
Software (S3):
-
Hardware and Architecture (S4):
-
Communications and Networking (S5):
-
Signal and Information Processing (S6):
-
Related Courses
Detailed Description
Course Content
Introduction to Geometric Algorithms and Extensions to the Research Areas of Computational Geometry.
In particular:
- Convexity in two dimensions and in three dimensions, but also in a general dimension.
- Volume of curved polyhedra and Minkowski Sum of Polyhedra.
- Triangulation and Delaunay Triangulation / Voronoi Diagram.
- Geometric Search Algorithms, Geometric Data Structures, Nearest Neighbor, clustering.
Also, topics on geometric algorithms and the use of libraries (eg CGAL) for the development of geometric software in programming languages like C / C ++, and Python are presented.
LITERATURE AND STUDY MATERIALS - READING LIST
Ioannis Emiris. Computational geometry: a modern algorithmic approach. Kleidarithmos Publishing, 2008.
Mark Overmars et al. Computational geometry and Applications. Springer.
Notes and Slides for Python.
e-Class link