Searching for Optimal Polygon - Remarks About a General Construction and Application to Heptagon and Nonagon
Dureisseix, David
HAL, hal-01246939 / Harvested from HAL
Text on HAL
Results obtained in a first paper deal with positioning optimal polygons -- i.e. largest regular polygons within a square. Such polygons have two particularities: symmetry with respect to at least one diagonal of the square and the fact that each edge of the square touches one vertex of the polygon. The technique used for pentagon (building the stellated pentagon) can be generalised for any number of edges. Complete construction in this case still remains open. Nevertheless, it seems necessary to begin with the construction of an angle pi/n , which is then enough to build the optimal polygon with the technique proposed herein. With procedures for folding pi/7 and pi/9 that are described herein, examples of heptagon and nonagon are performed.
Publié le : 1997-10-04
Classification:  origami,  polygon containment,  optimally nested polygons,  [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM],  [MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG] 
@article{hal-01246939,
     author = {Dureisseix, David},
     title = {Searching for Optimal Polygon - Remarks About a General Construction and Application to Heptagon and Nonagon},
     journal = {HAL},
     volume = {1997},
     number = {0},
     year = {1997},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01246939}
}

Dureisseix, David. Searching for Optimal Polygon - Remarks About a General Construction and Application to Heptagon and Nonagon. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-01246939/