Coloquio del IMUNAM - C. U., noviembre 2026

Resumen:

Given n points on the plane or sphere, how many circles can you draw that separate the points into sets of k and n-k? The answer is related to order-k Voronoi diagrams — diagrams which divide the plane or sphere into regions according to which k points are closest. We will discuss the construction of these diagrams, as well as how the diagrams change as the configuration of points varies. We will then discuss a related question regarding maximal collections of minimally intersecting separating curves on the closed surface of genus 2.