Geometry: A Gateway to Understanding
From MaRDI portal
This article starts with the problem for which \(n\) an arbitrary good approximation of a regular \(n\)-gon can be obtained by paper folding. For all \(n\) there is a simple algorithm. The mathematics lead to analytical and number theoretical considerations.
Recommendations
Cited in
(7)- A note on Haga's theorems in paper folding
- Dynamics of simple folds in the plane
- scientific article; zbMATH DE number 3855874 (Why is no real title available?)
- The Greek cross and paper folding squares
- Hidden in the shape of a regular hexagon
- Paper folding and trigonometric ratios
- Analytic, geometric, and numeric analysis of the shrinking circle and sphere problems
This page was built for publication: Geometry: A Gateway to Understanding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716310)