✦ LIBER ✦

Uniform design over a convex polyhedron

✍ Scribed by Kaitai Fang; Guoliang Tian; Minyu Xie

Book ID: 105642032
Publisher: Springer
Year: 1999
Tongue: English
Weight: 143 KB
Volume: 44
Category: Article
ISSN: 1001-6538
DOI: 10.1007/bf02884729

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concave minimization over a convex polyh

Concave minimization over a convex polyhedron

✍ Hamdy A. Taha 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

Degeneracy criterion for a convex polyhe

Degeneracy criterion for a convex polyhedron

✍ Shtogrin, Mikhail I 📂 Article 📅 2012 🏛 Turpion Limited 🌐 English ⚖ 384 KB

Uniform distributions in a class of conv

Uniform distributions in a class of convex polyhedrons with applications to drug combination studies

✍ Guo-Liang Tian; Hong-Bin Fang; Ming Tan; Hong Qin; Man-Lai Tang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 902 KB

Finding all vertices of a convex polyhed

Finding all vertices of a convex polyhedron

✍ Miroslav Maňas; Josef Nedoma 📂 Article 📅 1968 🏛 Springer-Verlag 🌐 English ⚖ 252 KB

On the section of a convex polyhedron

✍ Peter Frankl; Hiroshi Maehara; Junichiro Nakashima 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P. For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths o

The minimum sphere covering a convex pol

The minimum sphere covering a convex polyhedron

✍ Jack Elzinga; Donald Hearn 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB