✦ LIBER ✦

A convex polytope of diameter one

✍ Scribed by Arun K. Pujari; Ashok K. Mittal; S.K. Gupta

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 94 KB
Volume: 5
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90044-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the diameter of convex polytopes

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

Computing farthest neighbors on a convex

Computing farthest neighbors on a convex polytope

✍ Otfried Cheong; Chan-Su Shin; Antoine Vigneron 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Let N be a set of n points in convex position in R 3 . The farthest point Voronoi diagram of N partitions R 3 into n convex cells. We consider the intersection G(N ) of the diagram with the boundary of the convex hull of N . We give an algorithm that computes an implicit representation of G(N ) in e

Heights of convex polytopes

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

A property of graphs of convex polytopes

✍ Micha A Perles; Nagabhushana Prabhu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Random polytopes in a convex body

✍ Rolf Schneider; John André Wieacker 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 197 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,