Methods of Information Geometry, 2000. ,
Rao's distance measure, Sankhya: The Indian Journal of Statistics, vol.43, pp.345-365, 1981. ,
Power Diagrams: Properties, Algorithms and Applications, SIAM Journal on Computing, vol.16, issue.1, pp.78-96, 1987. ,
DOI : 10.1137/0216006
Geometric relations among Voronoi diagrams, 4th Annual Symposium on Theoretical Aspects of Computer Sciences (STACS), pp.53-65, 1987. ,
DOI : 10.1007/bf00181613
Voronoi Diagrams, Handbook of Computational Geometry, pp.201-290, 2000. ,
Clustering with Bregman Divergences, Journal of Machine Learning Research (JMLR), vol.6, pp.1705-1749, 2005. ,
DOI : 10.1137/1.9781611972740.22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2778
Support vector clustering, Scholarpedia, vol.3, issue.6, pp.125-137, 2002. ,
DOI : 10.4249/scholarpedia.5187
Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes, Discrete & Computational Geometry, vol.33, issue.2, pp.37-70, 2009. ,
DOI : 10.1007/s00454-009-9175-1
URL : https://hal.archives-ouvertes.fr/hal-00488434
Curved Voronoi Diagrams, Effective Computational Geometry for Curves and Surfaces, pp.67-116, 2007. ,
DOI : 10.1007/978-3-540-33259-6_2
URL : https://hal.archives-ouvertes.fr/hal-00488446
Algorithmic Geometry, 1998. ,
DOI : 10.1017/CBO9781139172998
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, vol.7, issue.3, pp.200-217, 1967. ,
DOI : 10.1016/0041-5553(67)90040-7
Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, vol.16, issue.2, pp.463-479, 1995. ,
DOI : 10.1007/BF02570718
Parallel Optimization: Theory, Algorithms and Applications, 1997. ,
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three, SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pp.282-291, 1995. ,
An optimal convex hull algorithm in any fixed dimension, Discrete & Computational Geometry, vol.16, issue.4, pp.377-409, 1993. ,
DOI : 10.1007/BF02573985
The Discrepancy Method, 2000. ,
Applications of random sampling in computational geometry, ii. Discrete and Computational Geometry, pp.387-421, 1989. ,
Why Least Squares and Maximum Entropy? An Axiomatic Approach to Inference for Linear Inverse Problems, The Annals of Statistics, vol.19, issue.4, pp.2032-2066, 1991. ,
DOI : 10.1214/aos/1176348385
A weak characterisation of the Delaunay triangulation, Geometriae Dedicata, vol.33, issue.2, p.3964, 2008. ,
DOI : 10.1007/s10711-008-9261-1
Principia Philosophiae. Ludovicus Elzevirius, p.1644 ,
Hitting sets when the VC-dimension is small, Information Processing Letters, vol.95, issue.2, pp.358-362, 2005. ,
DOI : 10.1016/j.ipl.2005.03.010
Geometric clustering models for multimedia databases, Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG'98, 1998. ,
Geometric clustering for multiplicative mixtures of distributions in exponential families, Proceedings of the 12th Canadian Conference on Computational Geometry, 2000. ,
Concrete and Abstract Voronoi Diagrams, Lecture Notes in Computer Science, vol.400, 1989. ,
DOI : 10.1007/3-540-52055-4
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.191-200, 2003. ,
DOI : 10.1145/777792.777822
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.376
Lectures on Discrete Geometry, 2002. ,
DOI : 10.1007/978-1-4613-0039-7
The maximum numbers of faces of a convex polytope, Mathematika, vol.16, issue.02, pp.179-184, 1971. ,
DOI : 10.1007/BF02771542
Visual Computing: Geometry, Graphics, and Vision. Charles River Media, 2005. ,
Statistical exponential families: A digest with flash cards, 2009. ,
The Dual Voronoi Diagrams with Respect to Representational Bregman Divergences, 2009 Sixth International Symposium on Voronoi Diagrams, 2009. ,
DOI : 10.1109/ISVD.2009.15
Hyperbolic Voronoi diagrams made easy Computing Research Repository (CoRR), abs/0903, 2009. ,
Mixed Bregman Clustering with Approximation Guarantees, ECML PKDD '08: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases -Part II, pp.154-169, 2008. ,
DOI : 10.1007/978-3-540-87481-2_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.2796
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams, Institut National de Recherche en Informatique et en Automatique, 1992. ,
URL : https://hal.archives-ouvertes.fr/hal-01180157
Voronoi diagram in statistical parametric space by Kullback-Leibler divergence, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.463-465, 1997. ,
DOI : 10.1145/262839.263084
Voronoi diagrams for an exponential family of probability distributions in information geometry, Japan-Korea Joint Workshop on Algorithms and Computation, pp.1-8, 1997. ,
Optimality of the Delaunay triangulation in ??? d, Discrete & Computational Geometry, vol.80, issue.9, pp.189-202, 1994. ,
DOI : 10.1007/BF02574375
Convex Analysis, 1970. ,
DOI : 10.1515/9781400873173
Voronoi diagrams by divergences with additive weights, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.403-404, 1998. ,
DOI : 10.1145/276884.276929