Bregman Voronoi diagrams

DOI10.1007/s00454-010-9256-1zbMath1201.52020arXiv0709.2196OpenAlexW2075057405WikidataQ29544854 ScholiaQ29544854MaRDI QIDQ5962350

Frank Nielsen, Jean-Daniel Boissonnat, Richard Nock

Publication date: 22 September 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.2196

zbMATH Keywords

Voronoi diagramDelaunay triangulationLegendre transformationBregman ballBregman divergencecomputational information geometry

Mathematics Subject Classification ID

Discrete geometry (52C99) Combinatorial complexity of geometric structures (52C45)

Related Items (max. 100)

On farthest Bregman Voronoi cells ⋮ Prediction in Riemannian metrics derived from divergence functions ⋮ Income inequality measurement: a fresh look at two old issues ⋮ Skew Jensen-Bregman Voronoi Diagrams ⋮ The Kullback-Leibler divergence between lattice Gaussian distributions ⋮ An obstruction to Delaunay triangulations in Riemannian manifolds ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Manifold reconstruction using tangential Delaunay complexes ⋮ Hyperlink regression via Bregman divergence ⋮ Voronoi polytopes for polyhedral norms on lattices ⋮ On Geodesic Triangles with Right Angles in a Dually Flat Space ⋮ CONFORMAL GEOMETRY OF ESCORT PROBABILITY AND ITS APPLICATIONS ⋮ Classification into Kullback-Leibler balls in exponential families ⋮ Conformal Flattening on the Probability Simplex and Its Applications to Voronoi Partitions and Centroids ⋮ Monte Carlo Information-Geometric Structures ⋮ Some Universal Insights on Divergences for Statistics, Machine Learning and Artificial Intelligence ⋮ Topological Data Analysis in Information Space. ⋮ Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. ⋮ APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY ⋮ Extropy: complementary dual of entropy

Cites Work

• A weak characterisation of the Delaunay triangulation
• Hitting sets when the VC-dimension is small
• Geometric relations among Voronoi diagrams
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• Concrete and abstract Voronoi diagrams
• An optimal convex hull algorithm in any fixed dimension
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Applications of random sampling in computational geometry. II
• Almost optimal set covers in finite VC-dimension
• Visualizing hyperbolic Voronoi diagrams
• Power Diagrams: Properties, Algorithms and Applications
• Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
• Convex Analysis
• The maximum numbers of faces of a convex polytope
• Manifold reconstruction in arbitrary dimensions using witness complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bregman Voronoi diagrams