References in periodicals archive ?
For n = 3 and 0 [less than or equal to] [k.sub.1] [less than or equal to] [[??].sub.1] [less than or equal to] 1 the following formula can be obtained via triangulation method by decoupling polytopes of the two RV sets [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] into simplexes with origin as the common vertex:
[15.] Grunbaum, Branko (2003), Convex Polytopes, Graduate Texts in Mathematics (2nd ed.), Springer, ISBN 9780387004242
Several other convex approximations of the stability region such as boxes [3,4], ellipsoids [5,6], polytopes [7,8], or other convex sets [9,10] are widely used in robust control.
The cells are called Dirichlet regions, Thiessen polytopes, or Voronoi polygons.
KRIZEK, Gradient superconvergence on uniform simplicial partitions of polytopes, IMA J.
The volume is divided into four sections, dealing in turn with Xenakis's tutelage in the Le Corbusier studio, his writings on architecture, projects undertaken as an independent architect following his acrimonious split from Le Corbusier, and his various Polytopes, which perhaps represent Xenakis's most, comprehensive and coherent synthesis of music and architecture.
For example, there are six regular polytopes in four-dimensions that are the analogues of the Platonic Solids.
Other topics include metric graph theory and geometry, extremal problems for convex lattice polytopes, expansive motions, unfolding orthogonal polyhedra, the discharging method in combinatorial geometry, and line transversals to families of translated ovals.
A generalization to Polytopes and a reduction of any Dirichlet problem on compacta is mapped into a unit cube in more dimensions.
Coxeter's work, especially his treatise entitled Regular Polytopes, went on to influence various people, including Buckminster Fuller, who credits Coxeter's vision in developing his famous geodesic domes.
POLYTOPES" IS THE COLLECTIVE NAME of a series of multimedia installations, including sound, light and architecture, conceived by IANNIS XENAKIS during the 1960s and 1970s.
The mathematics necessary for a sweep-plane algorithm to generate uniform random variates over simple polytopes in high dimensions was collected in Leydold and Hormann [1998].