Add to ORKGThis paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap’s faces are quadrilaterals, with vertices over an underlying integer lattice, and such that the cap convexity is radially monotone, a type of smoothness constraint. Extensions of Cauchy’s arm lemma are used in the proof of non-overlap
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3...
A notion of radially monotone cut paths is introduced as an effective choice for finding a non-ove...
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the...
We construct a sequence of convex polyhedra on n vertices with the property that, as n -\u3e infinit...
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...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prisma...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3...
A notion of radially monotone cut paths is introduced as an effective choice for finding a non-ove...
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the...
We construct a sequence of convex polyhedra on n vertices with the property that, as n -\u3e infinit...
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...
It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proo...
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected ...
We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prisma...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, alwa...
We address the unsolved problem of unfolding prisma-toids in a new context, viewing a “topless prism...