Ununfoldable polyhedra with convex faces (Q1869740): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56970670, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Star Unfolding of a Polytope with Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonoverlap of the star unfolding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unsolved problems in geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4343008 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3273709 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerating foldings and unfoldings between polygons and polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5547252 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4401003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Discrete Geodesic Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2728851 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the development of closed convex curves on 3-polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex polytopes with convex nets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4089424 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5627266 / rank | |||
Normal rank |
Revision as of 15:35, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ununfoldable polyhedra with convex faces |
scientific article |
Statements
Ununfoldable polyhedra with convex faces (English)
0 references
28 April 2003
0 references
A classic open question in geometry is whether every convex polyhedron can be cut along its edges and flattened into the plane without any overlap. Such a collection of cuts is called an edge cutting of the polyhedron, and the resulting simple polygon is called an edge unfolding or net. The authors investigate the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. Two examples of polyhedra are given, one with 24 convex faces and one with 36 triangular faces that cannot be unfolded by cutting along edges. This proves, in particular, that the edge-unfolding conjecture does not generalize to topologically convex polyhedra. It is shown that cuts across faces can unfold some convex-faced polyhedra that cannot be unfolded with cuts only along edges. This is the first demonstration that general cuts are more powerful than edge cuts. The problem of constructing a polyhedron that cannot be unfolded even using general cuts is also considered. Finding a ``closed'' ununfoldable polyhedron is an intriguing open problem. As a step towards this goal, the authors present an ``open'' polyhedron with triangular faces that cannot be unfoldable no matter how it is cut.
0 references
convex closed polyhedron
0 references
open convex-faced polyhedron
0 references
topologically convex polyhedra
0 references
edge cutting
0 references
edge unfolding
0 references
vertex unfolding
0 references
convex unfolding
0 references
unfolding polyhedra
0 references
cuts across faces
0 references
general unfolding
0 references
tree
0 references
polyhedron with negative curvature
0 references
middle vertices
0 references
gluing hats together
0 references
spike triangle
0 references
spiked tetrahedron
0 references
nets
0 references
discrete geometry
0 references