Generalization of Chaos Game on Polygon
Kosala D. Purnomo*
Department of Mathematics, University of Jember
*Corresponding author. Email: email@example.com
Kosala D. Purnomo
Available Online 8 February 2022.
- 10.2991/acsr.k.220202.020How to use a DOI?
- Fractals; Chaos game; Attractor points; Convex polygon
The original chaos game has been applied to the triangular attractor points. With the rules for selecting attractor points randomly, the points generated in large iterations will form like a Sierpinski triangle. Several studies have developed it on the attractor points of quadrilaterals, pentagons, and hexagons which are convex in shape. The fractals formed vary depending on the shape of the attractor points. This paper will study the development of chaos game at attractor points in the form of arbitrary convex and non-convex polygons. The results obtained are consistent with previous results. The resulting fractal is in the form of a convex polygon built from the outermost points of its attractor.
- © 2022 The Authors. Published by Atlantis Press International B.V.
- Open Access
- This is an open access article under the CC BY-NC license.
Cite this article
TY - CONF AU - Kosala D. Purnomo PY - 2022 DA - 2022/02/08 TI - Generalization of Chaos Game on Polygon BT - Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021) PB - Atlantis Press SP - 98 EP - 100 SN - 2352-538X UR - https://doi.org/10.2991/acsr.k.220202.020 DO - 10.2991/acsr.k.220202.020 ID - Purnomo2022 ER -