Related papers: Voronoi Polytopes for Polyhedral Norms on Lattices
In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.
This article presents an algorithm to compute digital images of Voronoi, Johnson-Mehl or Laguerre diagrams of a set of punctual sites, in a domain of a Euclidean space of any dimension. The principle of the algorithm is, in a first step, to…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
A hex sphere is a singular Euclidean sphere with four cones points whose cone angles are (integer) multiples of 2*pi/3 but less than 2*pi. Given a hex sphere M, we consider its Voronoi decomposition centered at the two cone points with…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We have recently developed a mean-field theory to estimate the packing fraction of non-spherical particles [A. Baule et al., Nature Commun. (2013)]. The central quantity in this framework is the Voronoi excluded volume, which generalizes…
The forward and reverse Funk weak metrics are fundamental distance functions on convex bodies that serve as the building blocks for the Hilbert and Thompson metrics. In this paper we study Voronoi diagrams under the forward and reverse Funk…
The Voronoi cell of any atom in a lattice is identical. If atoms are perturbed from their lattice coordinates, then the topologies of the Voronoi cells of the atoms will change. We consider the distribution of Voronoi cell topologies in…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
Polyhedral estimate is a generic efficiently computable nonlinear in observations routine for recovering unknown signal belonging to a given convex compact set from noisy observation of signal's linear image. Risk analysis and optimal…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we show that the vertices of an N-vertex polytope in R^d can be…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
We prove that polynomial valuations on vector lattices correspond to orthosymmetric multilinear maps. As a consequence we obtain a concise proof of the equivalence of orthosymmetry and orthogonal additivity.
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
We study the space of orthogonally additive $n$-homogeneous polynomials on $C(K)$. There are two natural norms on this space. First, there is the usual supremum norm of uniform convergence on the closed unit ball. As every orthogonally…
The dodecahedral conjecture states that the volume of the Voronoi polyhedron of a sphere in a packing of equal spheres is at least the volume of a regular dodecahedron with inradius 1. The authors prove the conjecture following the…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…