Minkowski addition of polytopes: computational complexity and applications to Gröbner bases

This paper deals with a problem from computational convexity and its application to computer algebra. This paper determines the complexity of computing the Minkowski sum of $k$ convex polytopes in $\mathbb{R}^d $, which are presented either in terms of vertices or in terms of facets. In particular,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics 1993-05, Vol.6 (2), p.246-269
Hauptverfasser:	GRITZMANN, P, STURMFELS, B
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Applied mathematics Computer science Convex and discrete geometry Exact sciences and technology Geometry Linear programming Mathematical programming Mathematics Polynomials Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!