Are all convex polyhedra fully truncable? (Q2827610)
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: Are all convex polyhedra fully truncable? |
scientific article; zbMATH DE number 6641651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are all convex polyhedra fully truncable? |
scientific article; zbMATH DE number 6641651 |
Statements
20 October 2016
0 references
convex polyhedron
0 references
truncable
0 references
Are all convex polyhedra fully truncable? (English)
0 references
The author calls a convex polyhedron in ordinary space fully truncable (\textit{sic}) if each of its vertices can by truncated by a plane in such a way that planes truncating adjacent vertices meet in a common point on the edge that joins them. The author shows by example that not all polyhedra have this property. On the other hand, it is known that for each polyhedron there is an isomorphic one whose edges all touch some sphere, which therefore does have the property.
0 references