## 4.24 polytope

In order to use convex objects in Singular, Singular has to be build from sources together with gfanlib, a C++ library for convex geometry by Anders N. Jensen. Please check the readme file for installation instructions.

In R^n, a rational convex polytope (in short "polytope") is a set of points satisfying a system rational, and hence integer, linear inequalities and equations. It is internally realised as a cone in R^(n+1) intersected with the hyperplane, in which the first coordinate equals 1.

> 4.24.1 polytopeViaPoints |  |
> 4.24.2 polytopeViaInequalities |  |
> 4.24.3 polytope related functions |  |

User manual for Singular version 4-0-3, 2016, generated by texi2html.