| Description |
1 online resource (250 pages) |
| Series |
Universitext |
|
Universitext.
|
| 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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references and index |
| Notes |
English |
|
Print version record |
| In |
Springer eBooks |
| Subject |
Geometry -- Data processing
|
|
Geometría -- Datos-Tratamiento
|
|
Geometry -- Data processing
|
| Form |
Electronic book
|
| Author |
Theobald, Thorsten, 1971-
|
| ISBN |
9781447148173 |
|
1447148177 |
|
1447148169 |
|
9781447148166 |
|
