Workshop on the computation of Voronoi diagrams and their applications in geometry and image processing.

The repository used during the hands-on part of the workshop is available on GitHub.

Course Abstract

Voronoi diagrams are among the most versatile structures in computational geometry and computer graphics. Their applications range from facility location and natural pattern formation to procedural shading and surface triangulation.

At their core, Voronoi diagrams express a simple idea: partition space according to the nearest sample. Yet, despite this intuitive definition, their efficient computation can be surprisingly subtle. We will explore a variety of scenarios, highlighting the key ideas behind different algorithmic approaches. Along the way, you will be challenged to implement your own solutions and to think creatively about how these structures can be adapted and applied to diverse problems.

To follow this workshop you should have basic knowledge of geometry and coding (possibly in C/C++). Be sure to bring your laptop and some friends (teamwork is highly encouraged!).