COMPUTATIONAL GEOMETRY
| Title | ΥΠΟΛΟΓΙΣΤΙΚΗ ΓΕΩΜΕΤΡΙΑ / COMPUTATIONAL GEOMETRY |
| Code | NIS-08-03 |
| Faculty | Sciences |
| School | Informatics |
| Cycle / Level | 1st / Undergraduate |
| Teaching Period | Spring |
| Coordinator | Apostolos Papadopoulos |
| Common | No |
| Status | Active |
| Course ID | 40002981 |
Programme of Study: PPS-Tmīma Plīroforikīs (2019-sīmera)
Registered students: 0
| Orientation | Attendance Type | Semester | Year | ECTS |
|---|---|---|---|---|
| GENIKĪ KATEUTHYNSĪ | Elective Courses | 8 | 4 | 5 |
| Academic Year | 2020 – 2021 |
| Class Period | Spring |
| Faculty Instructors |
|
| Weekly Hours | 3 |
| Class ID | 600180196
|
Course Type 2016-2020
- Scientific Area
Course Type 2011-2015
Specific Foundation / Core
Mode of Delivery
- Face to face
Digital Course Content
- e-Study Guide https://qa.auth.gr/en/class/1/600180196
- At the Website of the School: http://delab.csd.auth.gr/~tsichlas/geometry.html
Language of Instruction
- Greek (Instruction, Examination)
- English (Examination)
Prerequisites
Required Courses
- NCO-02-03 DATA STRUCTURES
- NCO-04-03 ALGORITHMS
Learning Outcomes
Cognitive: The students will acquire knowledge related to Line segment intersection, Polygon Triangulation, Linear Programming, Orthogonal range searching, Point location, Voronoi diagrams, Delaunay triangulations, Geometric data structures, Convex hulls, Binary space partitions, Visibility graphs.
Skills:
• Learning of basic algorithmic techniques in computational geometry.
• Learning of analysis and design tools with emphasis in computational geometry.
• Applications and programming of such algorithms.
General Competences
- Make decisions
- Work autonomously
- Work in teams
- Advance free, creative and causative thinking
Course Content (Syllabus)
Line segment intersection, Polygon Triangulation, Linear Programming, Orthogonal range searching, Point location, Voronoi diagrams, Delaunay triangulations, Geometric data structures, Convex hulls, Binary space partitions, Visibility graphs.
Keywords
Geometric data structures, Triangulation, Range searching, Segment intersection, Convex Hulls
Educational Material Types
- Slide presentations
- Book
Use of Information and Communication Technologies
Use of ICT
- Use of ICT in Course Teaching
Course Organization
| Activities | Workload | ECTS | Individual | Teamwork | Erasmus |
|---|---|---|---|---|---|
| Lectures | 39 | ✓ | ✓ | ||
| Reading Assigment | 48 | ✓ | |||
| Written assigments | 60 | ✓ | ✓ | ||
| Exams | 3 | ✓ | |||
| Total | 150 |
Student Assessment
Description
One can find this information in the course webpage.
Student Assessment methods
- Written Exam with Short Answer Questions (Formative, Summative)
- Written Exam with Problem Solving (Summative)
Bibliography
Course Bibliography (Eudoxus)
1. ΥΠΟΛΟΓΙΣΤΙΚΗ ΓΕΩΜΕΤΡΙΑ - ΑΛΓΟΡΙΘΜΟΙ ΚΑΙ ΕΦΑΡΜΟΓΕΣ, DE BERG MARK, CHEONG OTFRIED, VAN KREVELT MARC, OVERMARS MARK, ΙΔΡΥΜΑ ΤΕΧΝΟΛΟΓΙΑΣ & ΕΡΕΥΝΑΣ-ΠΑΝΕΠΙΣΤΗΜΙΑΚΕΣ ΕΚΔΟΣΕΙΣ ΚΡΗΤΗΣ, 2011.
2. ΥΠΟΛΟΓΙΣΤΙΚΗ ΓΕΩΜΕΤΡΙΑ: ΜΙΑ ΣΥΓΧΡΟΝΗ ΑΛΓΟΡΙΘΜΙΚΗ ΠΡΟΣΕΓΓΙΣΗ, ΓΙΑΝΝΗΣ Ζ. ΕΜΙΡΗΣ, ΕΚΔΟΣΕΙΣ ΚΛΕΙΔΑΡΙΘΜΟΣ ΕΠΕ, 2008.
Additional bibliography for study
1. J. O'Rourke, Computational Geometry in C, Cambridge University Press, 2nd edition, 1998.
2. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
3. Handbook of Discrete and Computational geometry.
Last Update
07-12-2020
