On Bregman Voronoi diagrams

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 746-755

  Nielsen, Frank ^a   Boissonnat, Jean Daniel ^b   Nock, Richard ^c  

^a SONY COMPUTER SCIENCE LABORATORIES INC   (Japan)

^b INRIA   (France)

^c UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY; INFORMATION THEORY;

BREGMAN DIVERGENCES; DELAU-NAY TRIANGULATIONS; DIMENSIONAL SPACES; DISTORTION MEASURES; DIVERGENCE MEASURES; ENTROPIC FUNCTION; EUCLIDEAN DISTANCE; GEOMETRIC STRUCTURE;

GRAPHIC METHODS;

EID: 84969213993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. S. Amari and H. Nagaoka, Methods of Information Geometry, Oxford University Press, 2000.
2. F. Aurenhammer, Power diagrams: Properties, algorithms and applications, SIAM Journal of Computing, 16 (1987), pp. 78-96.
3. F. Aurenhammer and R. Klein, Voronoi Diagrams, Handbook of Computational Geometry, J. Sack and G. Urrutia, Eds., Elsevier, 2000, pp. 201-290.
4. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, Clustering with Bregman divergences, Journal of Machine Learning Research, 6 (2005), pp. 1705-1749.
5. J.-D. Boissonnat and M. Karavelas, On the combinatorial complexity of Euclidean Voronoi cells and convex hulls of d-dimensional spheres, Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 305-312.
6. J.-D. Boissonnat, C. Wormser, and M. Yvinec, Anisotropic diagrams: Labelle Shewchuk approach revisited, 17th Canadian Conference on Computational Geometry, 2005, pp. 266-269.
7. J.-D. Boissonnat and M. Yvinec, Algorithmic Geometry, Cambridge University Press, 1998.
8. L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Computational Mathematics and Mathematical Physics, 7 (1967), pp. 200-217.
9. K. Q. Brown, Voronoi diagrams from convex hulls, Inf. Process. Lett., 9 (1979), pp. 223-228.
10. B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete Computational Geometry, 10 (1993), pp. 377-409.
11. Q. Du, V. Faber and M. Gunzburger, Centroidal Voronoi Tesselations : Applications and Algorithms, SIAM Review, 41 (1999), pp. 637-676.
12. Y. Eldar, M. Lindenbaum, M. Porat and Y. Y. Zeevi, The Farthest Point Strategy for Progressive Image Sampling, IEEE Trans. on Image Processing, 6(9) (1997), pp. 1305-1315.
13. M. Herbster and M. Warmuth, Tracking the best regressor, Proc. 11th Conference on Computational Learning Theory, 1998, pp. 24-31.
14. R. Klein, Concrete and Abstract Voronoi Diagrams, vol. 400 of Lecture Notes in Computer Science, Springer, 1989. ISBN 3-540-52055-4.
15. G. Leibon and D. Letscher, Delaunay triangulations and Voronoi diagrams for Riemannian manifolds, Proc. 16th Symposium on Computational Geometry, 2000, pp. 341-349.
16. S. P. Lloyd, Least squares quantization in PCM, IEEE Trans. Inform. Theory (1982), pp. 129-137
17. P. McMullen, The maximum numbers of faces of a convex polytope, J. Combinatorial Theory, Ser. B, 10 (1971), pp. 179-184.
18. F. Nielsen, J.-D. Boissonnat, and R. Nock, On Bregman Voronoi diagrams, INRIA technical report, 2006.
19. R. Nock and F. Nielsen, Fitting the smallest enclosing Bregman ball, 16th European Conference on Machine Learning, 2005, pp. 649-656.
20. K. Onishi and H. Imai, Voronoi diagram in statistical parametric space by Kullback-Leibler divergence, in Proc. 13th Symposium on Computational Geometry, 1997, pp. 463-465.
21. K. Onishi and N. Takayama, Construction of Voronoi diagram on the upper half-plane, IEICE Transactions, 79-A (1996), pp. 533-539.
22. V. T. Rajan, Optimality of the Delaunay triangulation in Rd, Disc. & Comp. Geom., 12 (1994), pp. 189-202.
23. J. Ruppert, A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation, J. Algorithms, 18 (1995), pp. 548-585.
24. K. Sadakane, H. Imai, K. Onishi, M. Inaba, F. Takeuchi, and K. Imai, Voronoi diagrams by divergences with additive weights, Proc. 14th Symposium on Computational Geometry, 1998, pp. 403-404.
25. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom., 12 (1994), pp. 327-345.