Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design (Q1818117)
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: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design |
scientific article; zbMATH DE number 1383567
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design |
scientific article; zbMATH DE number 1383567 |
Statements
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design (English)
0 references
4 January 2000
0 references
point-set width
0 references
0.81603086
0 references
0.81579375
0 references
0.81182855
0 references
0.8068539
0 references
