Topic: Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. It is used in many fields of computer science such as computer graphics, computer-aided design and manufacturing (CAD/CAM), robotics (motion planning and visibility problems), geographic information systems (GIS) (geometrical location and search, route planning), integrated circuit design (IC geometry design and verification), computer-aided engineering (CAE) (mesh generation) and computer vision (3D reconstruction).
Exercise: In this exercise you have to implement one or more computational geometry algorithms such as Voronoi Diagram, Delaunay Triangulation, Closest Pair, Convex Hull etc.
First you have to implement all the necessary data structures (or use library instead) and then write the algorithm. Store the results in images or make a .gif image.
Bonus: Visualize the algorithm while running.
Lecture for better understanding: https://icarus.csd.auth.gr/computational-geometry-lecture/
This exercise was developed by I. Karavitsis.
————————————————————————————————————–
For the solutions to the exercises, please contact koroniioanna@csd.auth.gr