A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes |
scientific article; zbMATH DE number 7497530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes |
scientific article; zbMATH DE number 7497530 |
Statements
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (English)
0 references
24 March 2022
0 references
0 references
0 references
