Pith. sign in

REVIEW 5 major objections 5 minor 48 references

Quasi-symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra

T0 review · 5 major / 5 minor · reviewed 2026-08-03 · deepseek-v4-flash

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

Pith's one-line read This paper proves that a simple class of quasi-symmetric nets realizes the equimodular elliptic type of flexible quadrangular Kokotsakis polyhedra, giving the first explicit closed-form examples and showing they are flexible in real 3D spac

desk verdict First explicit realizations of the equimodular elliptic Kokotsakis type, with closed-form flexions; main results are solid, though some key identities are only machine-checked and the numerical exclusivity claims are overconfident. read the letter →

arxiv 2511.19376 v2 pith:IKNBSZBA submitted 2025-11-24 math.MG cs.CG

A. Nurmatov , M. Skopenkov , F. Rist , J. Klein , D. L. Michels This is my paper
classification math.MGcs.CG MSC 52C25
keywords equimodularelliptictypequasi-symmetricnetKokotsakispolyhedronflexibleclosed-formflexiondihedralangleflatpolyhedralmechanism
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

The paper establishes that the equimodular elliptic type—a subclass of flexible quadrangular Kokotsakis polyhedra previously recognized only abstractly—is non-empty and explicitly constructible. It introduces quasi-symmetric nets (QS-nets), whose flat angles obey a simple symmetry pattern, and proves that every elliptic QS-net belongs to the equimodular elliptic type and is flexible in real Euclidean space, with an explicit closed-form one-parameter flexion. Conversely, any angle data satisfying the quasi-symmetry relations, the ellipticity condition, and δ1=π/2 are realized by some flexible QS-net. The paper also provides an algebraic characterization of the type in terms of flat and dihedral angles, enabling automated search and verification. These results deliver the first concrete flexible polyhedra in this class, spanning both M<1 and M>1 regimes and including non-self-intersecting examples that belong exclusively to the equimodular elliptic type even after switching boundary strips.

What carries the argument

The load-bearing object is the quasi-symmetric net (QS-net): a 3×3 polyhedral net whose flat angles obey the symmetry relations α1=α4=δ2=π−δ3, β1=β4=γ2=π−γ3, γ1=γ4=β2=π−β3, and δ1=δ4=α2=π−α3. This symmetry collapses the equimodularity conditions (equal moduli M_i, matched amplitudes r_i and s_i, and the phase-shift period condition) into simple identities, so that only the ellipticity inequality (2) remains as a nontrivial condition. For the converse, the closed-form flexion (12b) expresses the cotangents of half-dihedral angles in terms of a single parameter t and a discriminant D(t), directly satisfying the standard dihedral-angle compatibility equations and thereby establishing real flexi

What would settle it

Sample many random angle sets satisfying the quasi-symmetry relations (1) and the ellipticity condition (2); compute the moduli M_i via equation (4). Any such set with M1≠M2 would immediately refute the claim that every elliptic QS-net has equimodular elliptic type. Alternatively, numerically search for a set of angles satisfying (1), (2), and (12a) for which the discriminant D(t) in the flexion formulas (12b) is negative for all real t, which would disprove the converse construction.

Watch

Extended reading notes

Core claim

The central discovery is that the equimodular elliptic type, a subclass of flexible quadrangular Kokotsakis polyhedra, is non-empty and explicitly constructible. The authors introduce quasi-symmetric nets (QS-nets), defined by four symmetry relations among their flat angles (equal pairs and complements to π), and prove that every elliptic QS-net automatically satisfies the equimodular elliptic conditions: equal vertex moduli, matched amplitudes, and a period condition on phase shifts. Conversely, any angle data satisfying the quasi-symmetry relations, the ellipticity inequality, and δ1=π/2 are the flat angles of a flexible QS-net, with the flexion given by closed-form rational and square-roo

Load-bearing premise

The proof relies on a lemma asserting that the standard dihedral-angle compatibility equations, together with δ1+δ2+δ3+δ4=2π and positivity of the moduli M_i, are sufficient for the existence of a real polyhedron with prescribed flat and dihedral angles; if that sufficiency fails for some edge case (e.g., degenerate or boundary angle values), the converse direction of Theorem 1 and the algebraic characterization would not certify actual polyhedra.

Editorial extensions

If this is right

  • The equimodular elliptic type is no longer an abstract classification entry: it now includes explicitly parameterized flexible polyhedra, both closed-form and numerical, demonstrating that the class is physically realizable.
  • Quasi-symmetric nets provide a straightforward design recipe for single-degree-of-freedom flexible mechanisms with full surface coverage, suitable for architectural and deployable structures.
  • The algebraic characterization reduces the synthesis of equimodular elliptic mechanisms to solving a structured polynomial system, enabling automated search, numerical verification, and inverse design in CAD workflows.
  • Examples in both M<1 and M>1 regimes show that the class accommodates a broad range of shapes, not just degenerate configurations.
  • The numerical examples achieve tolerances of 10^-12 or better, and a physical stainless-steel prototype confirms that the predicted motion can be realized in practice.
  • The explicit flexion formulas (12b) offer a direct basis for kinematic simulation and control of these mechanisms.

Reading between the lines

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

  • The symmetry pattern that defines QS-nets may generalize beyond the equimodular elliptic type: the equal-moduli and matched-amplitude conditions are forced purely by the flat-angle symmetries, so analogous symmetry patterns could yield flexible examples in other classes of the classification, such as the conjugate-modular or linear compound types—and indeed one example already intersects the linea
  • The closed-form flexions (12b) hint at an underlying integrable structure: a single discriminant D(t) governs the motion, possibly admitting a uniformization by elliptic or hyperelliptic functions valid for all real t, not only the intervals where D(t)>0.
  • The exclusivity claims (belonging only to the equimodular elliptic type) are verified to floating-point tolerance; converting this verification into exact algebraic certificates using the explicit system (13) and sign conditions would turn a numerical assertion into a rigorous theorem.
  • A natural testable extension is to seek quasi-symmetric analogies for m×n nets (with m,n>3): the flat-angle symmetry may extend to larger meshes and yield new families of flexible Kokotsakis mechanisms.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

5 major / 5 minor

Summary. The paper introduces a class of 3×3 polyhedral nets called quasi-symmetric nets (QS-nets), characterized by flat-angle relations (1). Theorem 1 claims that every elliptic QS-net has equimodular elliptic type and is flexible in R^3 with a closed-form flexion given by (12b), and conversely that any angle data satisfying (1), (2), and (12a) are realized by some flexible elliptic QS-net. Proposition 1 gives an iff algebraic characterization of polyhedra of equimodular elliptic type with prescribed flat and dihedral angles, in the form of the system (13a)–(13h) plus the period condition (7). The paper also provides closed-form examples (Examples 4.1–4.3), numerical examples (Examples 4.4–4.5) validated to high precision, a numerical search-and-verification pipeline, and a physical prototype. The proofs of the main results depend on several lemmas, some of which are verified only in supplementary Mathematica notebooks.

Significance. If the central results are fully established, this is a substantial contribution to the theory of flexible Kokotsakis polyhedra: it provides the first explicit realizations of the equimodular elliptic type in Izmestiev's classification, with explicit flexions in R^3, non-self-intersecting examples, and an algebraic design criterion of direct practical use. The paper also ships reproducible code, notebooks, and a working prototype, and the derivation is not circular: the QS-net conditions are shown to imply the equimodular elliptic type via the stated angle relations. The main weakness is that several load-bearing algebraic identifications are not proved in the text but only checked in supplementary notebooks, and one key existence step is asserted with 'Clearly'. Thus the current manuscript is not self-contained, and the strength of the claims outruns the proof as written.

major comments (5)
  1. [§3, Lemma 7] Lemma 7 is load-bearing for Proposition 1 and for the converse direction of Theorem 1 (via the sufficiency of Bricard's equations), but its proof contains two significant gaps. First, the first equality in the displayed chain, which identifies (13h) with the Bricard condition, is only 'checked in Section 3 of the supplementary material'. Second, the assertion 'Clearly, there exists a polyhedron with the given dihedral angles θ_i and flat angles α_i, γ_i, δ_i (excluding β_i)' is not a proof: the existence of a net with prescribed flat angles and dihedral angles involves nontrivial edge-length compatibility conditions around the central face. Please provide analytic derivations or a precisely stated and certified computer-assisted proof for both steps.
  2. [§3, Proof of Theorem 1 (converse)] The converse of Theorem 1 is the main existence certificate for QS-nets. The proof states that 'expressions (12b) satisfy Bricard's equations [30, Eq. (20)]; for an automated verification, see Section 0 of the supplementary material'. This is a central verification: if the symbolic identity contains a hidden sign or branch error, the flexion formula would not certify real polyhedra. The paper should include the verification in the text or in an appendix as an exact algebraic proof (or a formal certificate), rather than outsourcing it to an external notebook.
  3. [§3, Lemmas 1 and 6] Lemmas 1 and 6 are used throughout: Lemma 1 underlies the inequalities and positivity arguments in Lemma 4 and the proof of Theorem 1, and Lemma 6 is used to justify (13g) and in the numerical pipeline. Both proofs consist entirely of 'verified in Section 1/2 of the supplementary material'. If these are routine trigonometric identities, they should be proved in the text or appendix; otherwise the paper should explicitly designate the main results as computer-assisted and provide independently verifiable certificates. As written, the proof is not self-contained.
  4. [§2, Definition of equimodular elliptic type] The paper asserts that Izmestiev's original definition [30, §3.3.1] contains a typo, 'first noted by He [40]', and that the corrected conditions (6) are used. This claim is not substantiated in the text. Since the entire paper is about the equimodular elliptic type, a precise comparison of (5)–(7) with Izmestiev's definition is necessary to ensure the corrected conditions really define the same class and that the paper indeed fills the claimed gap in the classification. If the correction is non-equivalent or changes the class, the novelty statement would need to be revised.
  5. [§4.2, Examples 4.4–4.5] The claims that Examples 4.4 and 4.5 'belong exclusively to the equimodular elliptic class' are verified only to floating-point tolerance (e.g., moduli to 10^-14, Bricard equations to 10^-12, period condition to 10^-15). The abstract and introduction state these as examples 'belong exclusively' to the type, which is stronger than a numerical demonstration. The text itself later softens this ('In a sense, this means...'). If these are intended as exact mathematical examples, exact algebraic certificates are needed; if they are numerical candidates, the wording should be adjusted to indicate numerical evidence rather than membership.
minor comments (5)
  1. [§2, Proposition 1 proof] The sentence 'For ui < 1, equations (13g) are automatic by Lemma 6' is misleading in the context of an iff statement. The system (13) is intended to determine parameters from prescribed angles; the converse direction must show that a solution of the system recovers the prescribed flat angles, not merely that (13g) is consistent with Lemma 6. Please clarify the logical role of (13g) in both directions.
  2. [§3, Proof of Theorem 1] Typo: 'supplimenatary material' should be 'supplementary material'.
  3. [Figure 11 caption] The caption refers to 'our fabricated flexible QNS'; the abbreviation should be QS-net for consistency with the rest of the paper.
  4. [§4.2, search algorithm] The list of unknowns is missing a closing parenthesis: 'The unknowns are the parameters (u, x_1, x_3, y_1, y_2, z_1, z_2, z_3, z_4)' should be followed by a closing parenthesis before 'We'. Minor.
  5. [§2, Eq. (12a)] Condition (12a) lists 'δ1 ∈ (0,π)' in addition to δ1 = π/2; the latter implies the former, so the repetition is redundant though harmless.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the equimodular elliptic construction is proven from Bricard/Izmestiev angle relations, not assumed.

full rationale

The paper's central claim, Theorem 1, is a derivation of equimodular elliptic type from the QS-net angle relations (1) plus ellipticity (2), and a converse existence proof via formulas (12b) that are checked against Bricard's equations. The forward direction uses Lemmas 1–3 to compute M_i, r_i, s_i, f_i and verify conditions (5)–(7); these are algebraic consequences of (1) and (2), not restatements of the target class. The converse invokes Lemma 7, which in turn rests on external results of Izmestiev [30] and Bricard's equations; the load-bearing sufficiency claim is a known equivalence, not a self-referential definition. Numerical examples in Section 4 are candidates found by solving the proven system of Proposition 1 and then validated against the same conditions; this is construction/application rather than fitting a parameter and calling it a prediction. Self-citations such as [31], [34]–[36], and the supplementary notebooks [41] are background or computational verification aids; the notebooks are code-reproduced algebraic checks and do not import the theorem's conclusion as an assumption. The main unproven algebraic identity in Lemma 7 (first equality checked in supplementary notebook) and the 'Clearly' assertion about the existence of a polyhedron with partial angle data are correctness risks, but they are not circular: the identity is a computational identity, not an assumption of equimodular ellipticity. Overall, no step in the derivation chain reduces to its own input by construction.

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

The paper introduces a new mathematical class of nets (QS-nets) but no new physical entities or fitted empirical constants. The auxiliary variables u, xi, yi, zi are design degrees of freedom solved from algebraic equations, not free parameters fitted to data; the flexion parameter t is a motion coordinate.

assumptions (4)
  • domain assumption Bricard's equations plus δ1+δ2+δ3+δ4=2π and Mi>0 are necessary and sufficient for the existence of a 3x3 net with prescribed flat and dihedral angles.
    Invoked in the converse of Theorem 1 and in Lemma 7; the paper states this is well-known and partially reproves it, but the full sufficiency rests on Izmestiev [30].
  • domain assumption Izmestiev's classification of flexible quadrangular Kokotsakis polyhedra and the characterization of equimodular elliptic type by conditions (5)-(7).
    The paper builds on [30] and the correction from [40]; claims of exclusive class membership are relative to this classification.
  • domain assumption Ellipticity condition (2): αi±βi±γi±δi ≠ 0 (mod 2π) for all sign choices.
    The paper restricts throughout to elliptic polyhedra; Theorems and Propositions assume this condition.
  • standard math Standard identities for Jacobi elliptic functions dn, sn, and the period lattice, including Table 1 and Lemma 8.
    Used to prove the phase condition (7) in Theorem 1 and in the verification of Example 4.3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quasi-symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra." pith.science (2026). https://pith.science/paper/IKNBSZBA

@misc{pith2026251119376,
  author       = {Pith},
  title        = {Pith review of: Quasi-symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IKNBSZBA}},
  note         = {Machine review of arXiv:2511.19376}
}
read the original abstract

A Kokotsakis polyhedron is a polyhedral mesh in three-dimensional Euclidean space formed by a central n-gonal face (the base), n quadrilateral faces each sharing one edge with the base, and n triangular faces inserted between every two adjacent quadrilaterals; it is called flexible if it admits a continuous deformation that preserves the rigidity of every face. This work investigates flexible Kokotsakis polyhedra with a quadrangular base (n = 4) of equimodular elliptic type, filling a significant gap in the literature by providing the first explicit constructions of this type together with an explicit algebraic characterization in terms of flat and dihedral angles. A straightforwardly constructible class of polyhedra - called quasi-symmetric nets (QS-nets) - is introduced, characterized by a symmetry relation among flat angles. It is shown that every elliptic QS-net has equimodular elliptic type and is flexible in real three-dimensional Euclidean space (rather than only in complex configuration spaces), except for a few exceptional choices of dihedral angles, and that its flexion admits a closed-form parameterization. Examples are constructed that are non-self-intersecting and belong exclusively to the equimodular elliptic type. To support applications in computational geometry, a numerical pipeline is developed that searches for candidate solutions, verifies them using the explicit algebraic characterization, and constructs and visualizes the resulting polyhedra; numerical validations achieve high precision. Taken together, these results provide constructive criteria, algorithms, and validated examples for the equimodular elliptic type, enabling the design of a broad range of flexible Kokotsakis mechanisms.

Figures

Figures reproduced from arXiv: 2511.19376 by the authors.

Figure 1
Figure 1. A QS-net is a particular Kokotsakis polyhedron with quadrangular base. The [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Illustration of a 3 × 3 net. We denote the vertices A2 := V11, B2 := V10, C2 := V01, etc. as shown in [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Notation for the vertices, flat and dihedral angles of a [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: A polyhedron with some of the angles prescribed. [PITH_FULL_IMAGE:figures/full_fig_p016_4.png]
Figure 5
Figure 5. Figure 5: The QS-net in Example 4.1 at different values of parameter [PITH_FULL_IMAGE:figures/full_fig_p018_5.png]
Figure 6
Figure 6. Figure 6: The first polyhedron in Example 4.2 at different values of parameter [PITH_FULL_IMAGE:figures/full_fig_p021_6.png]
Figure 7
Figure 7. Figure 7: The second polyhedron in Example 4.2 for the fixed values of dihedral an [PITH_FULL_IMAGE:figures/full_fig_p021_7.png]
Figure 8
Figure 8. Figure 8: The polyhedron of equimodular elliptic type in Example 4.3 at different values [PITH_FULL_IMAGE:figures/full_fig_p024_8.png]
Figure 9
Figure 9. Figure 9: Numerical example of a polyhedron of equimodular elliptic type at the state [PITH_FULL_IMAGE:figures/full_fig_p026_9.png]
Figure 10
Figure 10. Figure 10: The numerical example of a polyhedron of equimodular elliptic type in Exam [PITH_FULL_IMAGE:figures/full_fig_p028_10.png]
Figure 11
Figure 11. Figure 11: Illustration of several configurations of our fabricated flexible QNS. Photos [PITH_FULL_IMAGE:figures/full_fig_p029_11.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

48 extracted references · 3 linked inside Pith

  1. [40]

    He, On the foldability of rigid origami, Ph.D

    Z. He, On the foldability of rigid origami, Ph.D. thesis, University of Cambridge, Cambridge, UK, supervisor: Simon D. Guest; Advisor: Al- lan McRobie; Department of Engineering (Aug. 2021)

    2021

  2. [1]

    Escrig, J

    F. Escrig, J. P. Valcarcel, Geometry of expandable space structures, International Journal of Space Structures 8 (1-2) (1993) 71–84

    1993

  3. [2]

    Calatrava, Zur faltbarkeit von fachwerken, Ph.D

    S. Calatrava, Zur faltbarkeit von fachwerken, Ph.D. thesis, ETH Zurich (1981)

    1981

  4. [3]

    Z. Li, G. Nawratil, F. Rist, M. Hensel, Invertible paradoxic loop struc- tures for transformable design, in: Computer Graphics Forum, Vol. 39, Wiley Online Library, 2020, pp. 261–275

    2020

  5. [4]

    Demaine, J

    E. Demaine, J. O’Rourke, Geometric Folding Algorithms, Cambridge Univ. Press, 2007

    2007

  6. [5]

    T. A. Evans, R. J. Lang, S. P. Magleby, L. L. Howell, Rigidly foldable origami gadgets and tessellations, Royal Society Open Science 2 (2015) #150067, 2–18

    2015

  7. [6]

    T. A. Evans, R. J. Lang, S. P. Magleby, L. L. Howell, Ridigly foldable origami twists, in: Origami6, Vol. 1, American Math. Soc, 2015, pp. 119–130

    2015

  8. [7]

    C.Jiang, K.Mundilova, F.Rist, J.Wallner, H.Pottmann, Curve-pleated structures, ACM Trans. Graph. 38 (6) (2019) 169:1–13

    2019

Show all 48 references
  1. [8]

    K. Song, X. Zhou, S. Zang, H. Wang, Z. You, Design of rigid-foldable doublycurvedorigamitessellationsbasedontrapezoidalcreasepatterns, Proc. R. Soc. A 473 (2017) #20170016, 1–18

    2017

  2. [9]

    Tachi, Generalization of rigid foldable quadrilateral mesh origami, J

    T. Tachi, Generalization of rigid foldable quadrilateral mesh origami, J. Int. Ass. Shell & Spatial Structures 50 (2009) 173–179

    2009

  3. [10]

    Tachi, Geometric considerations for the design of rigid origami struc- tures, in: Q

    T. Tachi, Geometric considerations for the design of rigid origami struc- tures, in: Q. Zhang, L. Yang, Y. Hu (Eds.), Proceedings of the Interna- tional Association for Shell and Spatial Structures (IASS) Symposium 2010: Spatial Structures—Temporary and Permanent, China Archit...

    2010

  4. [11]

    Tachi, Freeform rigid-foldable structure using bidirectionally flat- foldable planar quadrilateral mesh, in: C

    T. Tachi, Freeform rigid-foldable structure using bidirectionally flat- foldable planar quadrilateral mesh, in: C. Ceccato, et al. (Eds.), Ad- vances in Architectural Geometry 2010, Springer, 2010, pp. 87–102. 32

    2010

  5. [12]

    Tachi, G

    T. Tachi, G. Epps, Designing one-DOF mechanisms for architecture by rationalizing curved folding, in: Y. Ikeda (Ed.), Proc. ALGODE Symposium, Arch. Institute Japan, Tokyo, 2011, p. 14 pp

    2011

  6. [13]

    Tachi, Composite rigid-foldable curved origami structure, in: F

    T. Tachi, Composite rigid-foldable curved origami structure, in: F. Es- crig, J. Sanchez (Eds.), Proc. 1st Transformables Conf., Starbooks, Sevilla, 2013, p. 6 pp

    2013

  7. [14]

    Callens, A

    S. Callens, A. Zadpoor, From flat sheets to curved geometries: Origami and kirigami approaches, Materials Today 21 (3) (2018) 241–264

    2018

  8. [15]

    Dieleman, N

    P. Dieleman, N. Vasmel, S. Waitukaitis, M. van Hecke, Jigsaw puzzle design of pluripotent origami, Nature Physics 16 (1) (2020) 63–68

    2020

  9. [16]

    L.H.Dudte, E.Vouga, T.Tachi, L.Mahadevan, Programmingcurvature using origami tessellations, Nature materials 15 (5) (2016) 583

    2016

  10. [17]

    Jiang, F

    C. Jiang, F. Rist, H. Wang, J. Wallner, H. Pottmann, Shape-morphing mechanical metamaterials, Computer Aided Design 143 (2022)

    2022

  11. [18]

    Konaković, K

    M. Konaković, K. Crane, B. Deng, S. Bouaziz, D. Piker, M. Pauly, Beyond developable: Computational design and fabrication with auxetic materials, ACM Trans. Graph. 35 (4) (2016) 89:1–11

    2016

  12. [19]

    Konaković-Luković, J

    M. Konaković-Luković, J. Panetta, K. Crane, M. Pauly, Rapid deploy- ment of curved surfaces via programmable auxetics, ACM Trans. Graph. 37 (4) (2018) 106:1–13

    2018

  13. [20]

    J. L. Silverberg, A. A. Evans, L. McLeod, R. C. Hayward, T. Hull, C. D. Santangelo, I. Cohen, Using origami design principles to fold reprogrammable mechanical metamaterials, science 345 (6197) (2014) 647–650

    2014

  14. [21]

    Cauchy, Recherche sur les polyédres – premier mémoire, Journal de l’École Polytechnique 9 (1813) 7–25, in French

    A.-L. Cauchy, Recherche sur les polyédres – premier mémoire, Journal de l’École Polytechnique 9 (1813) 7–25, in French

  15. [22]

    Bricard, Mémoire sur la théorie de l’octaèdre articulé, Journal de Mathématiques pures et appliquées 3 (1897) 113–148

    R. Bricard, Mémoire sur la théorie de l’octaèdre articulé, Journal de Mathématiques pures et appliquées 3 (1897) 113–148

  16. [23]

    Kokotsakis, Über bewegliche Polyeder, Math

    A. Kokotsakis, Über bewegliche Polyeder, Math. Ann. 107 (1933) 627– 647. 33

    1933

  17. [24]

    Sauer, H

    R. Sauer, H. Graf, Über Flächenverbiegung in Analogie zur Verknickung offener Facettenflache, Math. Ann. 105 (1931) 499–535

    1931

  18. [25]

    Stachel, A kinematic approach to Kokotsakis meshes, Comp

    H. Stachel, A kinematic approach to Kokotsakis meshes, Comp. Aided Geom. Design 27 (2010) 428–437

    2010

  19. [26]

    Nawratil, Reducible compositions of spherical four-bar linkages with a spherical coupler component, Mechanism and Machine Theory 46 (5) (2011) 725–742

    G. Nawratil, Reducible compositions of spherical four-bar linkages with a spherical coupler component, Mechanism and Machine Theory 46 (5) (2011) 725–742

    2011

  20. [27]

    Nawratil, Reducible compositions of spherical four-bar linkages with- out a spherical coupler component, Mechanism and machine theory 49 (2012) 87–103

    G. Nawratil, Reducible compositions of spherical four-bar linkages with- out a spherical coupler component, Mechanism and machine theory 49 (2012) 87–103

    2012

  21. [28]

    Schief, A

    W. Schief, A. Bobenko, T. Hoffmann, On the integrability of infinitesi- mal and finite deformations of polyhedral surfaces, in: A. Bobenko, et al. (Eds.), Discrete differential geometry, Vol. 38 of Oberwolfach Seminars, Springer, 2008, pp. 67–93

    2008

  22. [29]

    O. N. Karpenkov, On the flexibility of Kokotsakis meshes, Geometriae Dedicata 147 (1) (2010) 15–28

    2010

  23. [30]

    Izmestiev, Classification of flexible Kokotsakis polyhedra with quad- rangular base, Int

    I. Izmestiev, Classification of flexible Kokotsakis polyhedra with quad- rangular base, Int. Math. Res. Not. 2017 (3) (2017) 715–808

    2017

  24. [31]

    Y. Liu, Y. Ouyang, D. L. Michels, On the algebraic classification of non-singular flexible Kokotsakis polyhedra, arXiv (2401.14291) (2024)

    2024 arXiv

  25. [32]

    V. A. Gor’kavyi, A. D. Milka, Birosettes are model flexors, Ukr. Math. J. 70 (7) (2018) 885–904

    2018

  26. [33]

    Jiang, D

    C. Jiang, D. Lyakhov, F. Rist, H. Pottmann, J. Wallner, Quad mesh mechanisms, ACM Trans. Graph. 43 (6) (2024) 243:1–243:17, proc. SIG- GRAPH Asia

    2024

  27. [34]

    O.Pirahmad, H.Pottmann, M.Skopenkov, AreapreservingCombescure transformations, Results Math 80 (27) (2025)

    2025

  28. [35]

    Pirahmad, H

    O. Pirahmad, H. Pottmann, M. Skopenkov, Flexible polyhedral nets in isotropic geometry, arXiv preprint arXiv:2504.15060 (2025). 34

    2025 arXiv

  29. [36]

    Yorov, B

    K. Yorov, B. Wang, M. Skopenkov, H. Pottmann, C. Jiang, Solving Eu- clidean problems by isotropic initialization, arXiv (2506.01726) (2025)

    2025 arXiv

  30. [37]

    Erofeev, G

    I. Erofeev, G. Ivanov, Orthodiagonal anti-involutive Kokotsakis polyhe- dra, Mechanism and Machine Theory 146 (2020) 103713

    2020

  31. [38]

    Aikyn, Y

    A. Aikyn, Y. Liu, D. A. Lyakhov, F. Rist, H. Pottmann, D. L. Michels, Flexible Kokotsakis meshes with skew faces: Generalization of the or- thodiagonal involutive type, Computer-Aided Design 168 (2024) 103669

    2024

  32. [39]

    E. A. Morozov, Symmetries of 3-polytopes with fixed edge lengths, Sib. Electron. Math. Rep. 17 (2020) 1580–1587

    2020

  33. [41]

    Nurmatov, M

    A. Nurmatov, M. Skopenkov, F. Rist, J. Klein, D. L. Michels, Quasi- symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra: Code and notebooks,https://github. com/nurmaton/qs-nets(2025)

    2025

  34. [42]

    Maleczek, K

    R. Maleczek, K. Sharifmoghaddam, G. Nawratil, Rapid prototyping for non-developable discrete and semi-discrete surfaces with an overcon- strained mobility, in: Proceedings of IASS Annual Symposia, Vol. 2022, International Association for Shell and Spatial Structures (IASS), 20...

    2022

  35. [43]

    D. L. Michels, G. A. Sobottka, A. G. Weber, Exponential integrators for stiff elastodynamic problems, ACM Trans. Graph. 33 (1) (Feb. 2014)

    2014

  36. [44]

    D. L. Michels, J. P. T. Mueller, Discrete computational mechanics for stiff phenomena, in: SIGGRAPH ASIA 2016 Courses, SA ’16, Associa- tion for Computing Machinery, New York, NY, USA, 2016

    2016

  37. [45]

    D. L. Michels, J. P. T. Mueller, G. A. Sobottka, A physically based approach to the accurate simulation of stiff fibers and stiff fiber meshes, Computers & Graphics 53 (2015) 136–146

    2015

  38. [46]

    D. L. Michels, V. T. Luan, M. Tokman, A stiffly accurate integrator for elastodynamic problems, ACM Trans. Graph. 36 (4) (Jul. 2017). 35

    2017

  39. [47]

    H. Shao, T. Kugelstadt, T. Hädrich, W. Palubicki, J. Bender, S. Pirk, D. L. Michels, Accurately solving rod dynamics with graph learning, in: M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, J. W. Vaughan (Eds.), Advances in Neural Information Processing Systems, Vol. 34, Cur...

    2021

  40. [48]

    F. Rist, Z. Wang, D. Pellis, M. Palma, D. Liu, E. Grinspun, D. L. Michels, A flexible mold for facade panel fabrication, ACM Trans. Graph. 43 (6) (Nov. 2024). Acknowledgements This research has been supported by the baseline funding of the KAUST Computational Sciences Group. 36

    2024

Pith tools

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