Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm (Q3334982)
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: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm |
scientific article; zbMATH DE number 3868608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm |
scientific article; zbMATH DE number 3868608 |
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
0.8407384753227234
0 references
0.8227251172065735
0 references
0.8093047738075256
0 references
0.8088328838348389
0 references
