Go backward to 12 VolumeGo up to 2 Coordinate Descriptions |
XHTML 1.0 |

Input: | Polytope P of dimension d, positive integer 1 ≤ j
≤ d |
---|---|

Output: | A j-simplex contained in (containing) P of largest (smallest) volume |

Status (general): | NP-hard |
---|---|

Status (fixed dim.): | Polynomial time |

Among the j-simplices of largest volume contained in P, there
is one whose vertices are vertices of P. Hence, one can restrict
attention to (j+1)-subsets of the vertices of P.
Gritzmann, Klee, and Larman [28] prove If If Packer [51] also proves that the corresponding problem to
find a |

Why are some symbols not displayed correctly? |