Computational convexity

Peter Gritzmann, Victor Klee

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

6 Scopus citations

Abstract

The subject of Computational Convexity draws its methods from discrete mathematics and convex geometry, and many of its problems from operations research, computer science, data analysis, physics, material science, and other applied areas. In essence, it is the study of the computational and algorithmic aspects of high-dimensional convex sets (especially polytopes), with a view to applying the knowledge gained to convex bodies that arise in other mathematical disciplines or in the mathematical modeling of problems from outside mathematics.

Original languageEnglish
Title of host publicationHandbook of Discrete and Computational Geometry, Third Edition
PublisherCRC Press
Pages937-968
Number of pages32
ISBN (Electronic)9781498711425
ISBN (Print)9781498711395
DOIs
StatePublished - 1 Jan 2017

Fingerprint

Dive into the research topics of 'Computational convexity'. Together they form a unique fingerprint.

Cite this