Folding optimal polygons from squares
Abstract
What is the largest regular n-gon that fits in a unit square? Can it be folded from a square piece of paper using standard moves from origami? Answering the first question is relatively easy, using simple ideas from geometry. The second is more interesting; our answer illustrates the difference between origami and the standard compass-and-straightedge constructions of the Greeks, where, for instance, the 7-gon cannot be constructed. Not only can we fold a 7-gon, but we can fold the largest one possible from a given square piece of paper.
The rotating caliper to design optimal bounding boxes:
The rotating caliper to design optimal bounding boxes:

Fichier principal
preprint.pdf (278.22 Ko)
Télécharger le fichier
animation.gif (811.72 Ko)
Télécharger le fichier
AdditionalComments.pdf (91.74 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Origin : Files produced by the author(s)
Comment : Principe de la recherche de l'enveloppe optimale dans le cas du pentagone.
Origin : Files produced by the author(s)
Comment : Principe de la recherche de l'enveloppe optimale dans le cas du pentagone.
Format : Other
Origin : Files produced by the author(s)
Comment : Additional comments to the original paper
Origin : Files produced by the author(s)
Comment : Additional comments to the original paper
Loading...