Polytopes: Abstract, Convex and Computational
T. Bisztriczky · 1994
Where to buy
Amazon’s price changes daily, so the most accurate place to see it is there, at the moment you buy.
View on AmazonThis is an affiliate link: if you buy through it, the site earns a small commission at no extra cost to you, which helps us bring quality content and maintain the site. As an Amazon Associate we earn from qualifying purchases.
About the book
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. <br/> 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. <br/> 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. <br/> For researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels. <br/>
Book details
- Year
- 1994
- Language
- English
- Series
- NATO ASI Series, Series C: Mathematical and Physical Sciences, 1389-2185 -- 440
- Publisher
- Springer Netherlands
- Editions
- 1
- Pages
- 528
- ISBN
- 9789401109246
Data source: Wikidata