Folding optimal polygons by David DureisseixI have looked at various ways of folding the "optimal" pentagon & hexagon (the largest regular hexagon within a square of paper). Additive constraints are a mathematically exact construction, a finite number of operations (no iterative method) and, of course, a folding sequence as simple as possible. Hexagon
Pentagon The goal is now to fold a regular pentagon, as large as possible, within a square of paper. In origami geometry, there exists a lot of techniques to fold an approximate pentagon. Much less are concerned with exact pentagon, and only one about optimal pentagon: R. Morassi, The elusive pentagon, in the proceedings of the First International Meeting of Origami Science and Technology, H. Huzita, editor, Ferrara, pp. 27 37, 1989. The one proposed herein is much simple.


All contents are © BOS and/or individual contributors. The BOS is a registered charity (293039). Site copyright & disclaimer. Site design courtesy of 12testing. No part of this website may be reproduced in any form (including ebooks) without specific permission. 