On certain algorithms in the practice of geometry and the theory of numbers. (English) Zbl 0583.51017
This paper is a continuation of earlier articles of the authors [Math. Mag. 56, 141-155 (1983; Zbl 0523.51019); Coxeter Festschrift II, Mitt. Math. Semin. Giessen 164, 217-244 (1984; Zbl 0538.51018); Math. Intell. 7, No.1, 15-26 (1985; Zbl 0557.51006)]. The authors present an efficient paper folding algorithm to approximate all regular star polygons. The construction cleverly makes use of number theoretic results of an elementary but sophisticated type.
Reviewer: P.Gruber
MSC:
| 51M15 | Geometric constructions in real or complex geometry |
| 51M20 | Polyhedra and polytopes; regular figures, division of spaces |
| 52Bxx | Polytopes and polyhedra |
| 11B39 | Fibonacci and Lucas numbers and polynomials and generalizations |
| 52A10 | Convex sets in \(2\) dimensions (including convex curves) |
