Polyhedral Voronoi cells
From MaRDI portal
Abstract: Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using inversion at a sphere and a theorem of semi-infinite linear programming.
Recommendations
- scientific article; zbMATH DE number 1368681
- Voronoi polygons and polyhedra
- Voronoi cells of varieties
- Voronoi cells of discrete point sets
- scientific article; zbMATH DE number 3930776
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- scientific article; zbMATH DE number 1424293
Cited in
(18)- On metric regularity of Voronoi cells
- Voronoi cells of varieties
- On farthest Voronoi cells
- Voronoi polytopes for polyhedral norms on lattices
- The Voronoi inverse mapping
- scientific article; zbMATH DE number 6164563 (Why is no real title available?)
- Selected applications of linear semi-infinite systems theory
- Voronoi polygons and polyhedra
- Infinite faces of a perfect Voronoi polyhedron
- On farthest Bregman Voronoi cells
- Continuity of the maximum-entropy inference: convex geometry and numerical ranges approach
- Logarithmic Voronoi cells
- On the stability of Voronoi cells
- Voronoi cells via linear inequality systems
- On the basic properties and the structure of power cells
- Voronoi cells of discrete point sets
- Cells in any simple polygon formed by a planar point set
- Continuity of the maximum-entropy inference
This page was built for publication: Polyhedral Voronoi cells
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979706)