Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm (Q3334982): 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.1137/0213031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045155153 / rank | |||
Normal rank | |||
Latest revision as of 23:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm |
scientific article |
Statements
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm (English)
0 references
1984
0 references
partitions of polyhedra
0 references
computational geometry
0 references
convex decompositions
0 references
data structures
0 references
quadratic lower bound
0 references
