This repository contains my TIPE (both the code, the report and a beamer presentation) I presented during the entrance oral exams of the Grandes Écoles (some prestigious French engineering schools).
The code is essentially a full implementation from scratch in Python (with all necessary data structures, also implemented) of the Fortune's algorithm (see Fortune's algorithm - Wikipedia) to compute Voronoï diagrams. The implementation follows the rough pseudocode given in chapter 7 of the book Computational Geometry, Algorithms and Applications - Third Edition by Mark Berg, Otfried Cheong, Marc Kreveld, Mark Overmars.