pith. machine review for the scientific record. sign in

arxiv: 2604.16204 · v1 · submitted 2026-04-17 · 💻 cs.CG

Recognition: unknown

Apple Peel Unfolding of Archimedean and Catalan Solids

Supanut Chaidee, Takashi Yoshino

Pith reviewed 2026-05-10 06:45 UTC · model grok-4.3

classification 💻 cs.CG
keywords apple peel unfoldingpolyhedron netsArchimedean solidsCatalan solidsunfoldingpeelabilitycomputational geometry
0
0 comments X

The pith

Apple peel unfolding classifies Archimedean and Catalan solids into perfect, possible, or impossible categories for complete non-overlapping nets.

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

The paper defines apple peel unfolding as the process of drawing a polyhedron net by sequentially selecting adjacent faces without any overlap, exactly as if peeling an apple skin in one continuous piece. A program enforces this strict definition by generating and checking all valid sequences of face selections for each target solid. The authors apply the program to the thirteen Archimedean solids and their thirteen dual Catalan solids, labeling each as perfect when every possible starting face yields a complete valid unfolding, possible when only some starting faces succeed, or impossible when no sequence works. This classification shows three Archimedean solids and six Catalan solids are perfect while three Archimedean solids and three Catalan solids are possible, supplying a concrete computational test for whether a given symmetric polyhedron admits this constrained style of net.

Core claim

We define apple peel unfolding strictly and implement a program that derives the sequential selection of the polyhedral faces for a target polyhedron in accordance with the definition. Consequently, the program determines whether the polyhedron is peelable (can be peeled completely). We classify Archimedean solids and their duals (Catalan solids) as perfect (always peelable), possible (peelable for restricted cases), or impossible. The results show that three Archimedean and six Catalan solids are perfect, and three Archimedean and three Catalan ones are possible.

What carries the argument

Apple peel unfolding: strict sequential selection of adjacent faces that produces a non-overlapping net when the sequence covers every face, enforced by an exhaustive program that checks peelability.

If this is right

  • Perfect solids generate valid apple peel nets from any starting face.
  • Possible solids require specific starting faces or sequences to succeed.
  • Impossible solids admit no complete apple peel unfolding under the definition.
  • The classification separates the solids into three distinct groups with different unfolding reliability.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same sequential check could be run on Platonic solids to test whether their higher symmetry makes them all perfect.
  • The method supplies one concrete way to generate spanning trees of the face-adjacency graph that remain geometrically non-crossing.
  • Programs of this type might later be extended to count how many distinct peel sequences exist for each solid rather than only existence.

Load-bearing premise

The program's implementation faithfully follows the strict definition of apple peel unfolding without errors in adjacency checks or overlap detection.

What would settle it

An explicit overlapping sequence of adjacent faces starting from one of the solids labeled perfect that still covers all faces.

Figures

Figures reproduced from arXiv: 2604.16204 by Supanut Chaidee, Takashi Yoshino.

Figure 1
Figure 1. Figure 1: (a) Truncated icosahedron {5, 6, 6}, (b) net of truncated icosahedron, (c) polyhe￾dral graph of truncated icosahedron, (d) pentakis dodecahedron [5, 6, 6] (dual of truncated icosahedron), (e) net of pentakis dodecahedron, (f) polyhedral graph of pentakis dodecahe￾dron. Polytope unfolding appears widely in discrete and computational geometry problems. In the present study, we are interested in the unfolding… view at source ↗
Figure 2
Figure 2. Figure 2: Definition of coordinates in three-dimensional space. The [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Example of intermediate state of apple peel unfolding of a t [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of consideration of the left side of a point [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Polyhedron nets of Platonic solids obtained from apple peel [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Examples of polyhedron nets of all polyhedra for which the [PITH_FULL_IMAGE:figures/full_fig_p012_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Results of apple peel unfolding of truncated icosahedron [PITH_FULL_IMAGE:figures/full_fig_p013_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Comparison between a polyhedron net and a planar graph o [PITH_FULL_IMAGE:figures/full_fig_p014_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Summary of peelings of truncated dodecahedron [PITH_FULL_IMAGE:figures/full_fig_p015_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Facets of Catalan solids and their peelability. [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Summary of cases for pentakis dodecahedron [5 [PITH_FULL_IMAGE:figures/full_fig_p017_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Summary of cases for tetrakis hexahedron [4 [PITH_FULL_IMAGE:figures/full_fig_p018_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Summary of cases for small triakis octahedron [3 [PITH_FULL_IMAGE:figures/full_fig_p018_13.png] view at source ↗
read the original abstract

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfolding strictly and implement a program that derives the sequential selection of the polyhedral faces for a target polyhedron in accordance with the definition. Consequently, the program determines whether the polyhedron is peelable (can be peeled completely). We classify Archimedean solids and their duals (Catalan solids) as perfect (always peelable), possible (peelable for restricted cases), or impossible. The results show that three Archimedean and six Catalan solids are perfect, and three Archimedean and three Catalan ones are possible.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces 'apple peel unfolding' as a strict sequential process of selecting adjacent faces of a polyhedron without overlap (modeled after peeling an apple skin). It describes implementing a program to enumerate valid face sequences for the 13 Archimedean solids and their 13 dual Catalan solids, then classifies each solid as perfect (always peelable), possible (peelable only in restricted cases), or impossible. The reported results state that three Archimedean solids and six Catalan solids are perfect, while three Archimedean and three Catalan solids are possible.

Significance. If the computational classification is shown to be correct, the work supplies a new, constraint-specific categorization of unfoldability for these highly symmetric polyhedra. This could inform net-generation algorithms in computational geometry and applications such as sequential manufacturing or packaging design where adjacency order matters. The finite enumeration over the Archimedean/Catalan families is a natural scope for the method.

major comments (2)
  1. [Abstract / implementation section] Abstract and implementation description: The paper states that a program was implemented to derive face sequences and produce the reported counts, but supplies no pseudocode, adjacency-matrix handling details, overlap-check procedure, or validation against known nets (e.g., cube or dodecahedron). This single point of failure directly affects the central classification (three Archimedean and six Catalan perfect; three of each possible), as any error in boundary maintenance or completeness checking would alter the counts.
  2. [Results] Results section: The perfect/possible/impossible labels rest exclusively on the program's output with no cross-validation, manual verification for small cases, or discussion of edge-case handling (e.g., non-convex faces or multiple possible starting faces). Without these, the numerical claims cannot be independently confirmed from the given definition.
minor comments (2)
  1. [Abstract] The phrase 'restricted cases' for the 'possible' category is used in the abstract but never defined explicitly; a precise characterization (e.g., number of valid starting faces or allowed face types) should be added.
  2. [Preliminaries] Notation for face sequences and adjacency should be introduced formally before the program description to improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful comments on our manuscript. The feedback highlights important aspects for improving the clarity and verifiability of our computational results on apple peel unfoldings. We address each major comment below.

read point-by-point responses

  1. Referee: [Abstract / implementation section] Abstract and implementation description: The paper states that a program was implemented to derive face sequences and produce the reported counts, but supplies no pseudocode, adjacency-matrix handling details, overlap-check procedure, or validation against known nets (e.g., cube or dodecahedron). This single point of failure directly affects the central classification (three Archimedean and six Catalan perfect; three of each possible), as any error in boundary maintenance or completeness checking would alter the counts.

    Authors: We agree that additional implementation details are necessary for reproducibility and to substantiate the reported classifications. In the revised version, we will expand the implementation section to include pseudocode outlining the sequential face selection process, details on constructing and using the adjacency matrix for the dual graph of faces, the procedure for checking overlaps via maintained boundary edges, and explicit validation against standard unfoldings for the cube and regular dodecahedron. These additions will directly support the correctness of the counts for perfect, possible, and impossible cases. revision: yes

  2. Referee: [Results] Results section: The perfect/possible/impossible labels rest exclusively on the program's output with no cross-validation, manual verification for small cases, or discussion of edge-case handling (e.g., non-convex faces or multiple possible starting faces). Without these, the numerical claims cannot be independently confirmed from the given definition.

    Authors: We acknowledge that the results section would benefit from more verification details. We will revise it to include cross-validation by manually enumerating sequences for smaller solids such as the truncated tetrahedron, a discussion of edge-case handling (noting that all considered solids have convex faces, and we test multiple starting faces to classify as perfect or possible), and the total number of valid peel sequences found for each solid. This will allow readers to confirm the classifications independently based on the provided definition. revision: yes

Circularity Check

0 steps flagged

No circularity: classification follows from explicit program enumeration of a well-defined combinatorial property

full rationale

The paper supplies an explicit definition of apple peel unfolding as sequential adjacent-face selection without overlap, then describes a program that enumerates valid sequences on the fixed face-adjacency structure of each solid and reports which solids admit at least one complete sequence. The resulting trichotomy (perfect/possible/impossible) is therefore the direct output of that enumeration rather than a fitted parameter, a renamed empirical pattern, or a claim resting on self-citation. No step in the provided derivation reduces to its own input by construction, and the central result remains an independent computational verification of the stated definition.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on the correctness of the newly introduced definition of apple peel unfolding and on the assumption that the implemented program exhaustively and accurately tests all possible sequences on the standard face graphs of the solids.

axioms (2)
  • standard math Archimedean solids are vertex-transitive polyhedra with regular polygonal faces meeting in the same way at every vertex
    Standard definition used to identify the input solids.
  • standard math Catalan solids are the duals of Archimedean solids, obtained by replacing vertices with faces and vice versa
    Standard duality relation invoked to include the dual family.
invented entities (1)
  • Apple peel unfolding no independent evidence
    purpose: A strict sequential selection rule for ordering faces of a polyhedron so they can be unfolded flat without overlap
    Newly defined procedure that the program follows; no independent evidence outside the paper is provided.

pith-pipeline@v0.9.0 · 5413 in / 1620 out tokens · 37262 ms · 2026-05-10T06:45:19.052584+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 1 canonical work pages

  1. [1]

    E. D. Demaine, M. L. Demaine, A. Lubiw, A. Shallit, and J. L. Shallit, Z ipper unfoldings of polyhedral complexes, in Proc. 22nd Canadian Conf. Comput. Geom. (CCCG 2010) , Winnipeg, August 2010

    2010

  2. [2]

    O’Rourke, Spiral unfoldings of convex polyhedra, arXiv preprint arXiv:1509.00321 , 2015

    J. O’Rourke, Spiral unfoldings of convex polyhedra, arXiv preprint arXiv:1509.00321 , 2015

    work page arXiv 2015

  3. [3]

    Kaino, Apple-peel foldouts of four-dimensional regular polyt opes: 24, 120 and 600- cells, Symmetry: Art and Science , pp

    K. Kaino, Apple-peel foldouts of four-dimensional regular polyt opes: 24, 120 and 600- cells, Symmetry: Art and Science , pp. 25–30, 2019

    2019

  4. [4]

    W. T. Tutte, How to draw a graph, Proc. London Math. Soc. , 3(1) (1963), 743–767

    1963

  5. [5]

    D. E. Manolopoulos, J. C. May, and S. E. Down, Theoretical stud ies of the fullerenes: C34 to C 70, Chemical Physics Letters , 181(2–3) (1991), 105–111

    1991

  6. [6]

    D. E. Manolopoulos and P. W. Fowler, A fullerene without a spiral, Chemical Physics Letters, 204(1–2) (1993), 1–7. 16 Figure 11: Summary of cases for pentakis dodecahedron [5 , 6, 6]

    1993

  7. [7]

    L. N. Wirz, P. Schwerdtfeger, and J. E. Avery, Naming polyhedr a by general face-spirals— theory and applications to fullerenes and other polyhedral molecule s, Fullerenes, Nan- otubes and Carbon Nanostructures , 26(10) (2018), 607–630

    2018

  8. [8]

    Bartholdi and A

    L. Bartholdi and A. Henriques, Orange peels and Fresnel integr als, Mathematical Intel- ligencer, 34 (2012), 1–3

    2012

  9. [9]

    Uehara, Introduction to Computational Origami , Springer Singapore, 2020

    R. Uehara, Introduction to Computational Origami , Springer Singapore, 2020. 17 a) b) c) d) e) Figure 12: Summary of cases for tetrakis hexahedron [4 , 6, 6]. a) b) c) Figure 13: Summary of cases for small triakis octahedron [3 , 8, 8]. 18

    2020