A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
Article in Discrete Applied Mathematics (June 2024)
Convex Polytopes
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Notation and Prerequisites
-
Altmetric BadgeChapter 2 Convex Sets
-
Altmetric BadgeChapter 3 Polytopes
-
Altmetric BadgeChapter 4 Examples
-
Altmetric BadgeChapter 5 Fundamental Properties and Constructions
-
Altmetric BadgeChapter 6 Polytopes with Few Vertices
-
Altmetric BadgeChapter 7 Neighborly Polytopes
-
Altmetric BadgeChapter 8 Euler’s Relation
-
Altmetric BadgeChapter 9 Analogues of Euler’s Relation
-
Altmetric BadgeChapter 10 Extremal Problems Concerning Numbers of Faces
-
Altmetric BadgeChapter 11 Properties of Boundary Complexes
-
Altmetric BadgeChapter 12 k-Equivalence of Polytopes
-
Altmetric BadgeChapter 13 3-Polytopes
-
Altmetric BadgeChapter 14 Angle-sums Relations; the Steiner Point
-
Altmetric BadgeChapter 15 Addition and Decomposition of Polytopes
-
Altmetric BadgeChapter 16 Diameters of Polytopes
-
Altmetric BadgeChapter 17 Long Paths and Circuits on Polytopes
-
Altmetric BadgeChapter 18 Arrangements of Hyperplanes
-
Altmetric BadgeChapter 19 Concluding Remarks