On farthest Voronoi cells
From MaRDI portal
Publication:2332415
DOI10.1016/j.laa.2019.09.002zbMath1429.51008OpenAlexW2971463366MaRDI QIDQ2332415
Miguel Angel Goberna, Maxim Ivanov Todorov, Juan-Enrique Martinez-Legaz
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/98671
Polyhedra and polytopes; regular figures, division of spaces (51M20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items
On farthest Bregman Voronoi cells, Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality, A radius of robust feasibility for uncertain farthest Voronoi cells, Selected applications of linear semi-infinite systems theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Voronoi inverse mapping
- A geometric characterisation of the quadratic min-power centre
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- On the central path problem
- Farthest-polygon Voronoi diagrams
- Polyhedral Voronoi cells
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- Voronoi cells via linear inequality systems
- Farthest points of sets in uniformly convex Banach spaces
- Farthest Voronoi Diagrams under Travel Time Metrics
- Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments
- A Representation Theorem for Bounded Convex Sets
- Über schwache Konvergenz in den Raümen ($L^{p}$)
- Kinetic Red-Blue Minimum Separating Circle
