A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3128098595 / rank | |||
Normal rank | |||
Revision as of 18:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes |
scientific article |
Statements
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (English)
0 references
24 March 2022
0 references
