Polyhedral and Algebraic Methods in Computational Geometry by Michael JoswigPolyhedral and Algebraic Methods in Computational Geometry by Michael Joswig

Polyhedral and Algebraic Methods in Computational Geometry

byMichael Joswig, Thorsten Theobald

Paperback | January 4, 2013

Pricing and Purchase Info

$103.50

Earn 518 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Polyhedral and Algebraic Methods in Computational Geometryprovides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry.

The first part of the book studies classical problems and techniques that refer to polyhedral structures. The authors include a study on algorithms for computing convex hulls as well as the construction of Voronoi diagrams and Delone triangulations.

The second part of the book develops the primary concepts of (non-linear) computational algebraic geometry. Here, the book looks at Gröbner bases and solving systems of polynomial equations. The theory is illustrated by applications in computer graphics, curve reconstruction and robotics.

Throughout the book, interconnections between computational geometry and other disciplines (such as algebraic geometry, optimization and numerical mathematics) are established.

Polyhedral and Algebraic Methods in Computational Geometryis directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.

Title:Polyhedral and Algebraic Methods in Computational GeometryFormat:PaperbackDimensions:250 pages, 23.5 × 15.5 × 0.01 inPublished:January 4, 2013Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:1447148169

ISBN - 13:9781447148166

Reviews

Table of Contents

Introduction and Overview.- Geometric Fundamentals.- Polytopes and Polyhedra.- Linear Programming.- Computation of Convex Hulls.- Voronoi Diagrams.- Delone Triangulations.- Algebraic and Geometric Foundations.- Gröbner Bases and Buchberger's Algorithm.- Solving Systems of Polynomial Equations Using Gröbner Bases.- Reconstruction of Curves.- Plücker Coordinates and Lines in Space.- Applications of Non-Linear Computational Geometry.- Algebraic Structures.- Separation Theorems.- Algorithms and Complexity.- Software.- Notation.