Papers › Lagrangian approach to origami vertex analysis: Kinematics
Lagrangian approach to origami vertex analysis: Kinematics
Matthew Grasinger, Andrew Gillman, Philip Buskohl
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The use of origami in engineering has significantly expanded in recent years, spanning deployable structures across scales, folding robotics, and mechanical metamaterials. However, finding foldable paths can be a formidable task as the kinematics are determined by a nonlinear system of equations, often with several degrees of freedom. In this work, we leverage a Lagrangian approach to derive reduced-order compatibility conditions for rigid-facet origami vertices with reflection and rotational symmetries. Then, using the reduced-order conditions, we derive exact, multi-degree of freedom solutions for degree 6 and degree 8 vertices with prescribed symmetries. The exact kinematic solutions allow us to efficiently investigate the topology of allowable kinematics, including the consideration of a self-contact constraint, and then visually interpret the role of geometric design parameters on these admissible fold paths by monitoring the change in the kinematic topology. We then introduce a procedure to construct lower symmetry kinematic solutions by breaking symmetry of higher order kinematic solutions in a systematic way that preserves compatibility. The multi-degree of freedom solutions discovered here should assist with building intuition of the kinematic feasibility of higher degree origami vertices and also facilitate the development of new algorithmic procedures for origami-engineering design.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections