rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Polyhedral and Algebraic Methods in Computational Geometry
  name:
    name part: Joswig, Michael.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Theobald, Thorsten.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxk
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 250 p. 67 illus., 17 illus. in color. online resource.
  abstract: 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. 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 Geometry is directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.
  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.
  note: by Michael Joswig, Thorsten Theobald.
  subject:
    topic: Mathematics
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer mathematics
  subject:
    topic: Algorithms
  subject:
    topic: Geometry
  subject:
    topic: Convex geometry
  subject:
    topic: Discrete geometry
  subject:
    topic: Mathematics
  subject:
    topic: Geometry
  subject:
    topic: Convex and Discrete Geometry
  subject:
    topic: Mathematical Applications in Computer Science
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Symbolic and Algebraic Manipulation
  subject:
    topic: Algorithms
  classification: QA440-699
  classification: 516
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Universitext
  identifier: 9781447148173
  identifier: http://dx.doi.org/10.1007/978-1-4471-4817-3
  record info:
    record creation date: 130107
    record change date: 20151103121607.0
    record identifier: 978-1-4471-4817-3