Add to ORKGAbstract. We show that every convex polyhedron admits a simple edge unfold-ing after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Dürer’s unfoldability problem, which an-swers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topological characterization for embeddings among the planar immer
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3...
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triang...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
A well-known problem in geometry, which may be traced back to the Renaissance artist Albrecht Durer,...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper,...
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper,...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quas...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a dif...
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3...
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triang...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
A well-known problem in geometry, which may be traced back to the Renaissance artist Albrecht Durer,...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper,...
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper,...
AbstractUnfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In thi...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quas...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a dif...
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3...
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triang...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...