The Ubiquity of Voronoi Diagrams

Filippo Maggioli

Pegaso University

THU afternoon

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!).

Filippo Maggioli is an assistant professor at Pegaso University working in computer graphics and computer vision, with research interests spanning geometry processing, computational geometry, shape analysis, and spectral geometry. He previously held research appointments at the University of Milano-Bicocca and Sapienza University of Rome, and completed his Ph.D. at Sapienza in 2023 with a dissertation on scalable geometry processing for computer graphics applications. His work connects elegant mathematical tools with practical graphics problems, including recent research involving Voronoi-based methods for geometry processing and surface parametrization

MartinThe Ubiquity of Voronoi Diagrams