We give a necessary and su¢ cient condition for the existence and uniqueness up to translations of a 3-dimensional polytope P in R 3 having N facets with given unit outward normal vectors n 1 ; : : : ; n N and corresponding facet perimeters L 1 ; : : : ; L N. In this paper, a polytope of R 3 is the convex hull of …nitely many points in R 3. The classical Minkowski problem for polytopes in R 3 concerns the following question: Given a collection n 1 ; : : : ; n N of N pairwise distinct unit vectors in R 3 and F 1 ; : : : ; F N a collection of N positive real numbers, is there a polytope P in R 3 having the n i as its facet unit outward normals and the F i as the corresponding facet areas (1 i N), and, if so, is P unique up to translations? H....
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
AbstractA characterization theorem is given for 3-dimensional convex polytopes Q having the followin...
We show that the number of lattice directions in which a d- dimensional convex body in Rd has minimu...
We give a set of conditions that is necessary and sufficient for the existence and uniqueness up to ...
We give a set of conditions that is necessary and sufficient for the existence and uniqueness up to ...
Abstract The Minkowski existence Theorem for polytopes follows from Cramer’s Rule when attention is ...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
AbstractNon-tiles are convex polytopes, of which isomorphic copies will not tile the space locally f...
AbstractNon-tiles are convex polytopes, of which isomorphic copies will not tile the space locally f...
AbstractIf P is a simple 3-dimesional polytope and pi is the number of i sided faces of P then(p+t−1...
<p>We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkow...
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski...
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
AbstractA characterization theorem is given for 3-dimensional convex polytopes Q having the followin...
We show that the number of lattice directions in which a d- dimensional convex body in Rd has minimu...
We give a set of conditions that is necessary and sufficient for the existence and uniqueness up to ...
We give a set of conditions that is necessary and sufficient for the existence and uniqueness up to ...
Abstract The Minkowski existence Theorem for polytopes follows from Cramer’s Rule when attention is ...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
AbstractNon-tiles are convex polytopes, of which isomorphic copies will not tile the space locally f...
AbstractNon-tiles are convex polytopes, of which isomorphic copies will not tile the space locally f...
AbstractIf P is a simple 3-dimesional polytope and pi is the number of i sided faces of P then(p+t−1...
<p>We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkow...
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski...
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
AbstractA characterization theorem is given for 3-dimensional convex polytopes Q having the followin...
We show that the number of lattice directions in which a d- dimensional convex body in Rd has minimu...