Escape-time visualization method for language-restricted iterated function systems
Proceedings of the conference on Graphics interface '92
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
This paper proposes a method to integrate basic origami processes into fractal concepts. The starting point is an area of polygonal shape. It is folded until one or more smaller copies result. The crease pattern is scaled to the reduced copies, and then the process repeats. This is equivalent to maintaining the original crease pattern if the reduced objects are magnified. As will become clear in the paper, the fact that the folded object is enlarged implies that functions are used that are the inverse of contracting functions, as is familiar in inverse techniques for iterated function systems. The method is generalized by allowing cuts before folding. With a well-chosen colorization method, the images obtained reveal complex structures suggestive of depth and light.