A decision procedure for optimal polyhedron partitioning (Q794166)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3858410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decision procedure for optimal polyhedron partitioning |
scientific article; zbMATH DE number 3858410 |
Statements
A decision procedure for optimal polyhedron partitioning (English)
0 references
1983
0 references
The paper addresses the problem of subdividing a polyhedron into the smallest set of non-overlapping convex polyhedra. It is proved that the problem is decidable. (No algorithm is given, however, for the partitioning.)
0 references
computational geometry
0 references
decidability
0 references
convex polyhedron partitioning
0 references
0.9025604
0 references
0 references
0.89296836
0 references
0.8889533
0 references
0.8880522
0 references
0.88176274
0 references
0.88033587
0 references
