Skew Jensen-Bregman Voronoi Diagrams
From MaRDI portal
Publication:3223927
DOI10.1007/978-3-642-25249-5_4zbMath1250.68275OpenAlexW36455802MaRDI QIDQ3223927
Publication date: 9 March 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25249-5_4
Jensen's inequalityinformation geometryJensen-Shannon divergenceBhattacharyya distanceBregman divergencesJensen-von Neumann divergence
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Measures of information, entropy (94A17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Riemannian geometry and matrix geometric means
- Metrics defined by Bregman divergences. II
- Geometry of \(f\)-divergence
- An optimal convex hull algorithm in any fixed dimension
- Averaging anisotropic elastic constant data
- On Information Theoretic Security: Mathematical Models and Techniques
- Divergence measures based on the Shannon entropy
- Exact forms of some invariants for distributions admitting sufficient statistics
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- On the convexity of some divergence measures based on entropy functions
- On the convexity of higher order Jensen differences based on entropy functions (Corresp.)
- The Concave-Convex Procedure
- Centroidal Voronoi Tessellations: Applications and Algorithms
- A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
- The Burbea-Rao and Bhattacharyya Centroids
- Learning Theory and Kernel Machines
- An invariant form for the prior probability in estimation problems
- Decision Rules, Based on the Distance, for Problems of Fit, Two Samples, and Estimation
- Bregman Voronoi diagrams
