References
- Bae SW. Tight bound for farthest-color Voronoi diagrams of line segments. WALCOM: algorithms and computation, 40–51. Heidelberg: Springer; 2012. (Lecture Notes in Comput. Sci., 7157).
- Bae SW. Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments. Comput Geom. 2014;47:779–788.
- Bae SW, Chwa K -Y. Farthest Voronoi diagrams under travel time metrics (extended abstract). WALCOM: algorithms and computation, 28–39. Heidelberg: Springer; 2012. (Lecture Notes in Comput. Sci., 7157).
- Cheong O, Everett H, Glisse M, et al. Farthest-polygon Voronoi diagrams. Comput Geom. 2011;44:234–247.
- de Berg M, van Kreveld M, Overmars M, et al. Computational geometry. Berlin: Springer-Verlag; 1997. (Algorithms and applications).
- Dearing PM, Belotti P, Smith AM. A primal algorithm for the weighted minimum covering ball problem in Rn. TOP. 2016;24:466–492.
- Delaunay B. Sur la sphère vide, Izvestia Akademii Nauk SSSR. Otdelenie Matematicheskikh i Estestvennykh Nauk. 1934;7:793–800.
- Goberna MA, Martínez-Legaz JE, Todorov MI. On farthest Voronoi cells. Linear Algebra Appl. 2019;583:306–322.
- Goberna MA, Martínez-Legaz JE, Vera de Serio VN. The Voronoi inverse mapping. Linear Algebra Appl. 2016;504:248–271.
- Goberna MA, Rodríguez MML, Vera de Serio VN. Voronoi cells via linear inequality systems. Linear Algebra Appl. 2012;436:2169–2186.
- Preparata FP, Shamos MI. Computational geometry. An introduction. New York: Springer-Verlag; 1985. (Texts and Monographs in Computer Science).
- Shamos MI. Computational geometry [Ph.D. Thesis]. Department of Computer Science, Yale University, 1978. Available from University Microfilms, Ann Arbor, MI.
- Shamos MI. The early years of computational geometry – a personal memoir. Advances in discrete and computational geometry (South Hadley, MA, 1996), 313–333, Contemp. Math., 223, Providence (RI): Amer. Math. Soc.; 1999.
- Voigt I, Weis S. Polyhedral Voronoi cells. Beiträge Algebra Geom. 2010;51:587–598.
- Boissonnat JD, Nielsen F, Nock R. Bregman Voronoi diagrams. Discrete Comput Geom. 2010;44:281–307.
- Bregman LM. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput Math Phys. 1967;7:200–217.
- Burachik RS, Martínez-Legaz JE. On Bregman-type distances for convex functions and maximally monotone operators. Set-Valued Var Anal. 2018;26:369–384.
- Censor Y, Lent A. An iterative row-action method for interval convex programming. J Optim Theory Appl. 1981;34:321–353.
- Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970. (Princeton Mathematical Series, No. 28).
- Fajardo MD, Goberna MA, Rodríguez MML, et al. Even convexity and optimization. handling strict inequalities. Cham: Springer; 2020. (EURO Advanced Tutorials on Operational Research).
- Kullback S, Leibler RA. On Information and Sufficiency. Ann Math Stat. 1951;22:79–86.
- Kulis B, Sustik MA, Dhillon IS. Low-rank kernel learning with Bregman matrix divergences. J Mach Learn Res. 2009;10:341–376.
- Zaffaroni A. Convex coradiant sets with a continuous concave cogauge. J Convex Anal. 2008;15:325–343.