Bregman Voronoi diagrams

Jean-Daniel Boissonnat (1) , Frank Nielsen (2) , Richard Nock (3)

1 GEOMETRICA - Geometric computing
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 CEREGMIA - Centre de Recherche en Economie, Gestion, Modélisation et Informatique Appliquée

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define various variants of Voronoi diagrams depending on the class of objects, the distance function and the embedding space. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow one to define information-theoretic Voronoi diagrams in sta- tistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g. k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connection with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation.

Mots clés: Computational Information Geometry; Voronoi diagram; Delaunay triangula- tion; Bregman divergence; Bregman ball; Legendre transformation

Domaines: Géométrie algorithmique [cs.CG]

Jean-Daniel Boissonnat, Frank Nielsen, Richard Nock. Bregman Voronoi diagrams. Discrete and Computational Geometry, 2010, pp.200. ⟨hal-00488441⟩