• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Polytopes: Abstract, Convex and Computational

Polytopes: Abstract, Convex and Computational

Hardcover

Series: NATO Science Series C:, Book 440

General ComputersGeneral MathematicsGeometry

ISBN10: 0792330161
ISBN13: 9780792330165
Publisher: Springer Nature
Published: Jul 31 1994
Pages: 507
Weight: 2.01
Height: 1.13 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

Geometry