Polytopes: Abstract, Convex and Computational

封面
Tibor Bisztriczky, Peter McMullen, Rolf Schneider, Asia Ivic Weiss
Springer Science & Business Media, 2012年12月6日 - 507 頁
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.
 

內容

H S M Coxeter The evolution of CoxeterDynkin diagrams 21
43
H Martini A hierarchical classification of Euclidean polytopes
71
P McMullen Modern developments in regular polytopes
97
E Schulte Classification of locally toroidal regular polytopes
125
Gruber Approximation by convex polytopes
173
G Kalai Some aspects of the combinatorial theory of convex polytopes 205
231
W Kühnel Manifolds in the skeletons of convex polytopes
240
W Lee Generalized stress and motions
249
R Schneider Polytopes and BrunnMinkowski theory 273
301
J Bokowski On recent progress in computational synthetic geometry 335
359
P Gritzmann and V Klee On the complexity of some basic problems
373
P Kleinschmidt The diameter of polytopes and related applications
467
J Schaer editor Contributed problems
493
Index
503
著作權所有

其他版本 - 查看全部

常見字詞

書目資訊