✦ LIBER ✦

Preassigning the shape of projections of convex polytopes

✍ Scribed by D.W Barnette

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 123 KB
Volume: 42
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90099-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heights of convex polytopes

✍ Victor Klee 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 663 KB

On the diameter of convex polytopes

✍ Peter Kleinschmidt; Shmuel Onn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Inner Diagonals of Convex Polytopes

✍ David Bremner; Victor Klee 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 249 KB

to branko gru nbaum in honor of his seventieth birthday An inner diagonal of a polytope P is a segment that joins two vertices of P and that lies, except for its ends, in P's relative interior. The paper's main results are as follows: (a) Among all d-polytopes P having a given number v of vertices,

Central and parallel projections of poly

Central and parallel projections of polytopes

✍ Bernd Sturmfels 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Using the technique of Gale diagrams we give a characterization of point sets in (k -1)-dimensional Euclidean space that are obtained by projection of the vertex set of a convex k-polyt0pe of given combinatorial type. This result is also a first step in finding an intrinsic geometric criterion to de

Complete subgraphs of the graphs of conv

Complete subgraphs of the graphs of convex polytopes

✍ S. Gallivan; E.R. Lockeberg; P. McMullen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 631 KB

It is shown that if three vertices of the graph c?(l)) of a convex 3-polytope P are chosen, then G(P) contains a refinement of the complete graph C,, on four vertices, for which the three chosen vertices are principal (that is, correspond to vertices of C, in the refinement.. In general, all four ve

Convex combinations of projections

✍ Man-Duen Choi; Pei Yuan Wu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 864 KB