Add to ORKGWe give a set of conditions that is necessary and sufficient for the existence and uniqueness up to translations of a 3-dimensionalpolytope P in R3 having N facets with given unit outward normal vectors n_1,...,n_N and corresponding facet perimeters L_1,...,L_N
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
International audiencePrompted by the development of algorithms for analysing geometric tolerancing,...
AbstractA convex polytope P is projectively unique if every polytope combinatorially isomorphic to P...
We give a necessary and su¢ cient condition for the existence and uniqueness up to translations of a...
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...
AbstractWe prove the inequality Σn≥7 (n−6) pn≤v−12 for any 3-dimensional polytope with v vertices an...
AbstractLet pk(P) denote the number of k-gonal faces of the 3-polytope P. Necessary and sufficient c...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
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...
AbstractLet Rn be the root face valency of a random, rooted n-edged 3-polytope, Xn the valency of a ...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
Kalai's $3^d$-conjecture states that every centrally symmetric $d$-polytope has at least $3^d$ faces...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
International audiencePrompted by the development of algorithms for analysing geometric tolerancing,...
AbstractA convex polytope P is projectively unique if every polytope combinatorially isomorphic to P...
We give a necessary and su¢ cient condition for the existence and uniqueness up to translations of a...
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...
AbstractWe prove the inequality Σn≥7 (n−6) pn≤v−12 for any 3-dimensional polytope with v vertices an...
AbstractLet pk(P) denote the number of k-gonal faces of the 3-polytope P. Necessary and sufficient c...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
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...
AbstractLet Rn be the root face valency of a random, rooted n-edged 3-polytope, Xn the valency of a ...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
Kalai's $3^d$-conjecture states that every centrally symmetric $d$-polytope has at least $3^d$ faces...
Abstract. Two new approaches are presented to establish the existence of polytopal so-lutions to the...
International audiencePrompted by the development of algorithms for analysing geometric tolerancing,...
AbstractA convex polytope P is projectively unique if every polytope combinatorially isomorphic to P...