๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rational bases for convex polyhedra

โœ Scribed by E. Wachspress

Book ID
104008743
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
339 KB
Volume
59
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 (GADJ) for finding the denominator polynomial common to all the basis functions was exposed in Dasgupta and Wachspress (2007) [1] for convex polyhedra with all vertices of order three. This algorithm is applied here for generating bases for general convex polyhedra.

๐Ÿ“œ SIMILAR VOLUMES

An Inequality for Convex Polyhedra
An Inequality for Convex Polyhedra
โœ Aberth, O. ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 59 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