Biggest Circle Inscribed In A Polygon

A year project carried during my last year of "Classe préparatoire" meant to deal with Mathematics and Computer Science related topics.

First method : based on the approximation of poles of inaccessibility

The method follows this paper which refers to this paper.

Example of pole of inaccessibility	The method of the paper

Second method : using the medial axis approximation of a polygon using Voronoi diagrams

The method follows this paper by Steven Fortune.

An example of our Fortune algorithm	A first application to a polygon with an interior	A second application to a polygon with an interior

An approximation of the medial axis 1	An approximation of the medial axis 2

Final step : to apply theses methods to a real map (Bretagne)

The map used	The algorithm applied in every county	A zoom

You can found the slides describing the project here