Polyhedral and Algebraic Methods in Computational Geometry

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 problem...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Joswig, Michael (Autor), Theobald, Thorsten (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Colección:Universitext,
Temas:
Geometry.
Convex geometry .
Discrete geometry.
Computer science-Mathematics.
Algorithms.
Convex and Discrete Geometry.
Mathematical Applications in Computer Science.
Mathematics of Computing.
Symbolic and Algebraic Manipulation.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares