Pith. sign in

REVIEW 2 major objections 4 minor 13 references

Unfolding Polyhedra

T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Unfolding polyhedra: of the 20 combinations of cut type and polyhedron shape, 14 are proven settled and 6 remain open.

desk verdict A useful survey-style map of unfolding problems, but the central table's solved/open cells are asserted by citation and at least one orthogonal-polyhedra cell appears over-claimed. read the letter →

arxiv 1908.07152 v1 pith:4ABL6UVK submitted 2019-08-13 cs.CG

Joseph O'Rourke This is my paper · ORCID
classification cs.CG MSC 52B1005C4568U05
keywords edge-unfoldingpolyhedralnetsunzippingconvexpolyhedraorthogonalpolycubesspanning-treecutscomputationalgeometry
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper surveys the question of when a polyhedron can be cut open and flattened into one non-overlapping piece. It organizes that question into twenty cases: four ways to choose the cuts (edges only, any spanning-tree curve, an edge path, or any curve through all vertices) and five families of polyhedra (convex, spherical, nonconvex, orthogonal, and polycubes). The paper's claim is that fourteen of those twenty cases are currently settled by proof or counterexample, and six are open. Its purpose is to make the boundary of current knowledge explicit, so future work can target exactly the unresolved cells.

What carries the argument

The load-bearing object is the status table itself. The four cut types form a ladder: 'edge-unfold' permits only polyhedron edges, 'anycut-unfold' permits any curve forming a vertex-spanning tree, 'edge-unzip' requires the cut edges to form a Hamiltonian path through the vertices, and 'anycut-unzip' relaxes that to any simple curve touching every vertex. The five shape classes range from the restrictive convex and spherical polyhedra to the broad nonconvex class and the right-angled orthogonal and polycube families. By placing each prior result in one cell, the table turns scattered knowledge into a single assertion: exactly these fourteen cells are settled and exactly these six are open.

What would settle it

Locate the original proof behind any single check entry and test whether it covers every polyhedron in the stated class; for example, a convex polyhedron whose every spanning-tree cut yields an overlapping net would overturn the convex anycut-unfold cell, and likewise for any other check.

Watch

Extended reading notes

Core claim

The central claim is the correctness of a 4-by-5 table that classifies every combination of cut type and polyhedron class. In the table, a check means every polyhedron in that class can be unfolded with cuts of that type; a cross means at least one polyhedron in the class cannot; a question mark means the case is unresolved. The paper assigns checks to anycut-unfolding for convex, spherical, orthogonal, and polycube polyhedra, and to anycut-unzipping for orthogonal and polycube polyhedra. It assigns crosses to the edge-unzipping row across all five classes and to edge-unfolding for nonconvex and orthogonal polyhedra. The six remaining question marks sit in the edge-unfolding column for convex, spherical, and polycube polyhedra, in the anycut-unfolding cell for nonconvex polyhedra, and in the anycut-unzipping cells for convex and spherical polyhedra.

Load-bearing premise

The table is only as reliable as the cited results it transcribes, and the paper neither proves nor checks the assumptions behind those citations; if one cited theorem applies to a slightly different class of polyhedra or a different cut definition, the corresponding cell is mislabelled.

Editorial extensions

If this is right

  • Any future proof or counterexample in one of the six open cells will change the table, giving researchers a clear target.
  • The crosses show that searching for universal edge-unzippings is pointless across all five classes, since counterexamples already exist.
  • The successful anycut-unfold proofs for orthogonal and polycube families suggest that freeing the cuts from edges is what makes those classes tractable.
  • The table gives a compact way to test claims: a new result that contradicts a check or a cross must be reconciled with the cited counterexample or proof.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the table is accurate, the classical edge-unfolding problem is not isolated: its three open cells (convex, spherical, polycubes) all sit in the same column, so a breakthrough for any one shape family may transfer to the others by the same cut method.
  • The open anycut-unzip cells for convex and spherical polyhedra look like the nearest targets, since the analogous cells for orthogonal and polycube polyhedra already have positive proofs.
  • A reader could extend the taxonomy by adding a sixth shape class or a fifth cut type; the table's axes are modular and the new open/closed pattern would immediately expose whether the current boundary is an artifact of the chosen categories.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper is a short survey that organizes the known status of a 4-by-5 family of questions about unfolding polyhedra: four cut types (edge-unfold, anycut-unfold, edge-unzip, anycut-unzip) versus five polyhedron classes (convex, spherical, nonconvex, orthogonal, polycubes). Its central output is Table 1, which assigns to each of the 20 combinations a status of 'proven true,' 'false (counterexample exists),' or 'open,' reporting that only 6 combinations are unresolved. The paper provides no proofs or proof sketches; it relies entirely on the cited literature.

Significance. If Table 1 is accurate, the paper provides a compact and useful map of a fragmented literature, highlighting which specializations and generalizations of Dürer's problem are settled and which remain open. The categorization of cut types (especially the distinction between 'unfold' and 'unzip') is clear and helpful. However, because the entries are asserted without any per-cell derivation or citation attribution, the paper's value is entirely dependent on the correctness and scope matching of the citations.

major comments (2)
  1. [Table 1, row Orthogonal/Polycubes, column Anycut-Unf] The ✓ entries for 'Anycut-Unf' in the Orthogonal and Polycubes rows are not supported by the cited sources. [BDD+98] claims only 'some classes' of orthogonal polyhedra; [DDFO17] treats only genus-2 polyhedra and requires linear refinement; and [DFO07] establishes only an epsilon-version of unfolding. None of these proves that every orthogonal polyhedron (or every polycube) admits a cut along arbitrary curves that yields a single non-overlapping net. Since the table's ✓ is a universal claim, the author must either provide a reference that states the unrestricted theorem or mark the cell as open. This issue is load-bearing because the paper's central claim is that Table 1 accurately summarizes the state of knowledge.
  2. [Table 1, rows Convex/Spherical, column Edge-Unzip] The ✗ entries for edge-unzipping of convex and spherical polyhedra are not backed by the only unzipping counterexample citation in the paper, [DDEO19], which concerns polycubes. An edge-unzipping is a Hamiltonian path in the 1-skeleton, so the claim that not all convex (or spherical) polyhedra can be edge-unzipped requires a separate source constructing a convex polyhedron with no such path. Without that citation or a proof, the negative entries cannot be verified.
minor comments (4)
  1. [Section 1, definition of anycut-unfold] The phrase 'any curve on the surface that form a spanning tree of the vertices' is imprecise: the cut set in a general unfolding is a tree on the surface (a cut graph), not literally a spanning tree of the vertex set. Please reword to avoid confusion.
  2. [Table 1, caption] The abbreviations 'Anycut-Unf' and 'Anycut-Unzip' should be expanded in the caption or in a footnote to the table for clarity.
  3. [Table 1, row Nonconvex, column Edge-Unf] The ✗ entry for edge-unfolding of nonconvex polyhedra is plausible, but no specific counterexample is cited; please add a reference (e.g., to a known nonconvex polyhedron with no edge unfolding).
  4. [Reference list, [O'R18]] There is a typo: 'Prod. Symp. Comput. Geom.' should be 'Proc. Symp. Comput. Geom.'

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; Table 1 is a survey compilation of independent external results, with any sourcing concerns falling under correctness rather than circularity.

full rationale

This paper is a survey whose central artifact is Table 1, a 4x5 status matrix of open and settled problems. It makes no new derivations, fits no parameters, and introduces no mathematical claim that is then justified by that same claim. Each table entry is a compilation of previously published results (e.g., [DDEO19], [RALSZ19], [O'R18]); even where the author is a coauthor of the cited work, those cited results are independent, published, and peer-reviewed, with their own stated assumptions. The new terminology 'anycut' and 'unzip' is explicitly introduced as classification language, not as a hidden redefinition of a known result. A skeptic could question whether particular citations fully support particular table cells, such as the 'Orthogonal—Anycut-Unf' entry, but that is a correctness or sourcing concern, not a circularity: the paper does not define its categories in terms of the outcomes it reports. No equation, definition, or theorem in this text reduces to its own input, and no self-citation is used as the sole load-bearing justification for a prediction. Therefore the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities appear. The central table depends on the correctness of external references and on the taxonomy itself, which are listed as axioms.

assumptions (3)
  • domain assumption The cited prior results are correct and applicable to the stated shape classes.
    Table 1's true and false entries are asserted without proof; they rest on external references such as [DDEO19], [RALSZ19], and [O'R18].
  • domain assumption The four cut types and five shape classes are sensibly defined and exhaustive for the survey's purpose.
    The paper introduces 'anycut' and organizes shapes into families, but does not justify that this partition captures the important variants.
  • standard math A net requires cuts forming a spanning tree of the vertices.
    Stated in Section 1 as a prerequisite for unfolding to a single flat piece.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Unfolding Polyhedra." pith.science (2026). https://pith.science/paper/4ABL6UVK

@misc{pith2026190807152,
  author       = {Pith},
  title        = {Pith review of: Unfolding Polyhedra},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4ABL6UVK}},
  note         = {Machine review of arXiv:1908.07152}
}
read the original abstract

Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which problems remain open.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

13 extracted references · 12 canonical work pages

  1. [1]

    Demaine, Martin L

    Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, and Sue Whitesides. Unfolding some classes of orthogonal polyhedra. In Proc. 10th Canad. Conf. Comput. Geom. , pages 70--71, 1998. Full version in Elec. Proc. : http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-unfolding.ps.gz

    work page 1998

  2. [2]

    Some Polycubes Have No Edge Zipper Unfolding

    Erik D. Demaine, Martin L. Demaine, David Eppstein, and Joseph O'Rourke. Some polycubes have no edge-unzipping. http://arxiv.org/abs/1907.08433, July 2019

    work page Pith review arXiv 1907

  3. [3]

    Unfolding genus-2 orthogonal polyhedra with linear refinement

    Mirela Damian, Erik Demaine, Robin Flatland, and Joseph O'Rourke. Unfolding genus-2 orthogonal polyhedra with linear refinement. Graphs and Combinatorics , 33(5):1357--1379, 2017

    work page 2017

  4. [4]

    Zipper unfoldings of polyhedral complexes

    Erik Demaine, Martin Demaine, Anna Lubiw, Arlo Shallit, and Jonah Shallit. Zipper unfoldings of polyhedral complexes. In Proc. 22nd Canad. Conf. Comput. Geom. , pages 219--222, August 2010

    work page 2010

  5. [5]

    Epsilon-unfolding orthogonal polyhedra

    Mirela Damian, Robin Flatland, and Joseph O'Rourke. Epsilon-unfolding orthogonal polyhedra. Graphs and Combinatorics , 23(1):179--194, 2007

    work page 2007

  6. [6]

    Demaine and Joseph O'Rourke

    Erik D. Demaine and Joseph O'Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra . Cambridge University Press, 2007. http://www.gfalop.org

    work page 2007

  7. [7]

    Unfolding orthogonal polyhedra

    Joseph O'Rourke. Unfolding orthogonal polyhedra. In J.E. Goodman, J. Pach, and R. Pollack, editors, Proc. Snowbird Conf. Discrete Comput. Geom.: Twenty Years Later , pages 307--317. American Mathematical Society, 2008

    work page 2008

  8. [8]

    D \"u rer's problem

    Joseph O'Rourke. D \"u rer's problem. In Marjorie Senechal, editor, Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination , pages 77--86. Springer, 2013

    work page 2013

Show all 13 references
  1. [9]

    Spiral unfoldings of convex polyhedra

    Joseph O'Rourke. Spiral unfoldings of convex polyhedra. arXiv:1509.00321 , 2015. https://arxiv.org/abs/1509.00321

    2015 arXiv

  2. [10]

    Addendum to: Edge-unfolding nearly flat convex caps

    Joseph O'Rourke. Addendum to: Edge-unfolding nearly flat convex caps. arXiv:1709.02433 , 2017. https://arxiv.org/abs/1709.02433

    2017 arXiv

  3. [11]

    Edge-unfolding nearly flat convex caps

    Joseph O'Rourke. Edge-unfolding nearly flat convex caps. In Prod. Symp. Comput. Geom. , volume 99, pages 64:1--64:14. Leibniz Internat. Proc. Informatics, June 2018. Full version: http://arxiv.org/abs/1707.01006

    2018 arXiv

  4. [12]

    Unfolding level-1 Menger polycubes of arbitrary size with help of outer faces

    Lydie Richaume, Eric Andres, Ga \"e lle Largeteau-Skapin, and Rita Zrour. Unfolding level-1 Menger polycubes of arbitrary size with help of outer faces. In Proc. 21st IAPR Internat. Conf., DGCI 2019 , March 2019

    2019

  5. [13]

    Shephard

    Geoffrey C. Shephard. Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc. , 78:389--403, 1975

    1975

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.