Polyhedral and algebraic methods in computational geometry
General Material Designation
[Book]
First Statement of Responsibility
Michael Joswig, Thorsten Theobald
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
London :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
2013
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (250 p.)
SERIES
Series Title
Universitext
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and index
CONTENTS NOTE
Text of Note
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
0
SUMMARY OR ABSTRACT
Text of Note
Polyhedral and Algebraic Methods in Computational Geometry provides 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
OTHER EDITION IN ANOTHER MEDIUM
Title
Polyhedral and Algebraic Methods in Computational Geometry