✦ LIBER ✦

An Inequality for Convex Polyhedra

✍ Scribed by Aberth, O.

Book ID: 120097700
Publisher: Oxford University Press
Year: 1973
Tongue: English
Weight: 59 KB
Volume: s2-6
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-6.2.382

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for determining redundant i

An algorithm for determining redundant inequalities and all solutions to convex polyhedra

✍ Harold Greenberg 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

An existence theorem for simple convex p

An existence theorem for simple convex polyhedra

✍ J.C. Fisher 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 753 KB

Euler's relation when apphed to simple convex polyhedra leads to an equation that involves the number of k-gonal faces that are not hexagons. Below we develop sufficient condlttons, revolving the number of hexagons, under which a gwen set of k-gons which satisfy that equation can be the faces of a s

An Inequality for Convex Functions

✍ C.E.M. Pearce; J.E. Pecaric 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 95 KB

An Accurate Distance-Calculation Algorit

An Accurate Distance-Calculation Algorithm for Convex Polyhedra

✍ Eva Dyllong; Wolfram Luther; Werner Otten 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 460 KB

An algorithm for deciding similarities o

An algorithm for deciding similarities of convex polyhedra

✍ Shinji Mukai; Susumu Furukawa; Makoto Obi; Fumihiko Kimura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Rational bases for convex polyhedra

✍ E. Wachspress 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 339 KB

## a b s t r a c t In Wachspress (1975) [2] rational bases were constructed for convex polyhedra whose vertices were all of order three. The restriction to order three was first removed by Warren (1996) [3] and his analysis was refined subsequently by Warren and Schaefer (2004) [4]. A new algorithm