Descript 
x, 250 p. : ill. ; 24 cm 
Series 
Universitext 

Universitext

Note 
Originally published in the German language by Vieweg+Teubner, 65189 Wiesbaden, Germany as "Joswig, M.; Theobald, T.; Algorithmische Geometrie, © Vieweg+Teubner 

Includes bibliographical references and index 

1. Introduction and overview  2. Geometric fundamentals  3. Polytopes and polyhedra  4. Linear programming  5. Computation of convex hulls  6. Voronoi diagrams  7. Delone triangulations  8. Algebraic and geometric foundations  9. Gröbner bases and Buchberger's algorithm  10. Solving systems of polynomial equations using Gröbner bases  11. Reconstruction of curves  12. Plücker coordinates and lines in space  13. Applications of nonlinear computational geometry  Appendix A. Algebraic structures  Appendix B. Separation theorems  Appendix C. Algorithms and complexity  Appendix D. Software  Appendix E. Notation 

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 (nonlinear) computational algebraic geometry 
Link 
Print version: Joswig, Michael Polyhedral and Algebraic Methods in Computational Geometry
Dordrecht : Springer, c2012 9781447148166

Subject 
Geometry, Algebraic


Geometry  Data processing


Polyhedral functions


Polyhedra

Alt Author 
Theobald, Thorsten, 1971

