Polytopes: Abstract, Convex and Computational

October 20, 2012|
Polytopes: Abstract, Convex and Computational by Tibor Bisztriczky
Earn 3,900 plum® points
Ships free on orders over $35

In stock online

Not available in stores

Prices and offers may vary in store


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:PaperbackProduct dimensions:507 pages, 9.45 X 6.3 X 0 inShipping dimensions:507 pages, 9.45 X 6.3 X 0 inPublished:October 20, 2012Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:9401043981

ISBN - 13:9789401043984

Appropriate for ages: All ages

Look for similar items by category: