DeepAI AI Chat
Log In Sign Up

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra

by   Erik D. Demaine, et al.
University of California, Irvine

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap. One family of examples is acutely triangulated, i.e., every face is an acute triangle. Another family of examples is stacked, i.e., the result of face-to-face gluings of tetrahedra. Both families achieve another natural property, which we call very ununfoldable: for every k, there is an example such that every nonoverlapping multipiece edge unfolding has at least k pieces.


Some Polycubes Have No Edge-Unzipping

It is unknown whether or not every polycube has an edge-unfolding. A pol...

Guarding Quadrangulations and Stacked Triangulations with Edges

Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈...

An Edge Extrusion-Approach to Generate Extruded Miura-Ori and Its Double Tiling Origami Patterns

This paper proposes a family of origami tessellations called extruded Mi...

Edge-Unfolding Prismatoids: Tall or Rectangular Base

We show how to edge-unfold a new class of convex polyhedra, specifically...

Multicommodity Flows in Planar Graphs with Demands on Faces

We consider the problem of multicommodity flows in planar graphs. Seymou...

On Polyhedral Realization with Isosceles Triangles

Answering a question posed by Joseph Malkevitch, we prove that there exi...

Every Combinatorial Polyhedron Can Unfold with Overlap

Ghomi proved that every convex polyhedron could be stretched via an affi...