Polytopes: Abstract, Convex and Computational by Tibor BisztriczkyPolytopes: Abstract, Convex and Computational by Tibor Bisztriczky

Polytopes: Abstract, Convex and Computational

byTibor BisztriczkyEditorPeter McMullen, Rolf Schneider

Paperback | October 20, 2012

Pricing and Purchase Info

$757.95

Earn 3,790 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

The aim of this volume is to reinforce the interaction between the three main branches (abstract, convex and computational) of the theory of polytopes. The articles include contributions from many of the leading experts in the field, and their topics of concern are expositions of recent results and in-depth analyses of the development (past and future) of the subject.
The subject matter of the book ranges from algorithms for assignment and transportation problems to the introduction of a geometric theory of polyhedra which need not be convex.
With polytopes as the main topic of interest, there are articles on realizations, classifications, Eulerian posets, polyhedral subdivisions, generalized stress, the Brunn--Minkowski theory, asymptotic approximations and the computation of volumes and mixed volumes.
For researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels.
Title:Polytopes: Abstract, Convex and ComputationalFormat:PaperbackDimensions:507 pages, 24 × 16 × 0.01 inPublished:October 20, 2012Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:9401043981

ISBN - 13:9789401043984

Reviews

Table of Contents

Preface. Abstract. Recent results on Coxeter groups; A.M. Cohen. The evolution of Coxeter--Dynkin diagrams; H.S.M. Coxeter. Polyhedra with hollow faces; B. Grünbaum. A hierarchical classification of Euclidean polytopes with regularity properties; H. Martini. Modern developments in regular polytopes; P. McMullen. Classification of locally toroidal regular polytopes; E. Schulte. Convex. Face numbers and subdivisions of convex polytopes; M.M. Bayer. Approximation by convex polytopes; P.M. Gruber. Some aspects of the combinatorial theory of convex polytopes; G. Kalai. On volumes of non--Euclidean polytopes; R. Kellerhals. Manifolds in the skeletons of convex polytopes, tightness, and generalized Heawood inequalities; W. Kühnel. Generalized stress and motions; C.W. Lee. Polytopes and Brunn--Minkowski theory; R. Schneider. A survey of Eulerian posets; R.P. Stanley. Computational. On recent progress in computational synthetic geometry; J. Bokowski. The ridge graph of the metric polytope and some relatives; A. Deza, M. Deza. On the complexity of some basic problems in computational convexity: II. volume and mixed volumes; P. Gritzmann, V. Klee. The diameter of polytopes and related applications; P. Kleinschmidt. Problems. Contributed problems; J. Schaer (editor). Three problems about 4-polytopes; G.M. Zielger. Index.