Application of Iteration Function System for Ceramic Tile Design
Total Page:16
File Type:pdf, Size:1020Kb
2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom) Application of Iteration Function System for Ceramic Tile Design Zhiming Chen Department of Visual Communication School of Art, Xi’an Fanyi University Xi’an, China [email protected] Abstract—The fractal art pattern is the product of the implement an IFS system that can change parameters to gen- fusion of computer science and art. This pattern expression erate different fractal graphics; this application can choose is based on many traditional aesthetics, and it breaks the different fractal forms, and can set different parameters for standard of conventional aesthetics in a unique way of display. Although it has extremely irregular characteristics, it has the fractal, so as to reach the user desired results. After that, a special aesthetic perspective. To ensure people a unique we can use the creative fractal graphics to design and apply aesthetic sensory experience, the design and application of them to the design of ceramic tiles. fractal patterns on different carriers according to different The rest of this paper is organized as follows. Section II constitutional ways of fractal patterns not only have practical overviews the basic working principle of Iteration Function value, but also have artistic aesthetic value. This paper investi- gates the design of ceramic tiles by Iteration Function System System for generating fractal graphics. In Section III, we (IFS). First, the working principle of IFS is briefly illustrated. concentrate the production of random fractal landscape with Further, a random fractal landscape is generated via IFS codes IFS. Based on the obtained results, this paper discusses and corresponding algorithm. Finally, based on the generated the artistic aesthetic characteristics of fractal graphics in images, we applied them into the design of ceramic tiles. The Section IV. Section V provides a case study of ceramic tile case study demonstrates that our scheme can better decorate the tiles as well as other relevant industrial design. design with fractal objects generated by IFS codes. Then, we discuss the application form of fractal graphics in ceramic Keywords -fractal graphics; ceramic tile; application; IFS; tiles in Section VI. Finally, Section VII concludes this paper. I. INTRODUCTION II. ITERATION FUNCTION SYSTEM In recent years, a popular nonlinear theory has been Iteration Function System (IFS), one of important branch- developed, which is called fractal. Fractal can be used es in fractal geometry. Due to the powerful ability of IFS to describe regular or irregular objects in nature. Since can describe objects with different shapes, it has been Mandbro started fractal theory, fractal theory has developed widely used to simulate the natural scenes with a small very well, and it has spread in many subjects such as art amount of data [7], [8]. In another words, IFS can be used [1], civil engineering [2], economic management [3], etc. to describe more complex images, thus IFS has a strong At present, there are many kinds of fractals, such as general ability to compress the images data. It is viewed as one fractals and IFS fractals, appearing in front of people. This of the fields with the most vitality and broad application result benefits from the combination of fractals and computer prospects in fractal graphics. The theory of IFS includes graphics. Therefore, fractals attract more and more attention the following aspects: compressed mapping, metric space, [4]. Since the rapid development of fractal graphics, it has existence of invariant compact sets, and measurement theory. become everywhere in our daily life, such as the shape of The corresponding algorithm mainly have two contents: (1) trademarks, packaging style [5], clothing design [6] seen collage rules in the process of acquiring IFS codes; (2) in our daily life; fractal graphics are exquisite, wonderful computer algorithm for displaying geometric objects by IFS and varied, but at present most people only stay in the code, including random iteration algorithm and deterministic stage of appreciating fractal graphics, many people want algorithm. to participate in the dynamic generation process of fractal graphics, and understand how fractal graphics movement A. IFS Iterative Algorithm generation, trying to change the shape of fractal graphics There are two algorithms for generating IFS attractors: by changing the parameters of fractal graphics to create a (1) deterministic iterative algorithm; (2) random iterative more artistic form of graphics process. algorithm. Since deterministic algorithms require large s- In this paper, we first analyze and study the algorithm torage space, thus this type of algorithm is usually not of classical fractal graphics, and compare the classical used for IFS implementations rather than using the random algorithms to study and create new primitives; on the basis iteration algorithms which is characterized by easy computer of classical fractal graphics and creative fractal graphics, we implementation and does not require a large storage space. 978-0-7381-3199-3/20/$31.00 ©2020 IEEE 1475 DOI 10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00222 This algorithm selects transformswi through a random (2) Set up pixel amplifier; pi( =1) process based on the probability pi assigned by (3) Given the loop variable, from (number of points) each transform wi in the IFS system. Intuitively, the bigger (4) Set up a random interval generator pi is, the more chance of being selected. k=random(i)+1; In the IFS iterative algorithm, we firstly determine the (5) x = d[k, 1] ∗ tempx + d[k, 2] ∗ y + d[k, 5]; initial point (x0,y0). Then, we can randomly select a IFS x = d[k, 3] ∗ tempx + d[k, 4] ∗ y + d[k, 6] function from w1,w2, ··· ,wN for transforming, and further x1 = round(x ∗ j)+Δx generating the new point (x1,y1); the selection of the next y1 = round(y ∗ j)+Δy; point can be conducted according to w1,w2, ··· ,wN , the Remark: tempx indicates the temporary storage selected wi makes the transform for (x1,y1) and obtaining information of x; Δx and Δy denote the pan the new point (x2,y2). By repeating the above process, a distances on the display. series of points will be generated and consequently displayed (6) Scan each pixel to draw graphics. on the monitors. According to the known IFS code, using the above algo- B. Affine Transformation rithm, we plotted the number of points as follows. Therefore, the Bernsley fern leaves with N = 1000, N = 10000, In the IFS system, affine transformation mapping con- N = 100000, N = 1000000 are produced as shown in trols the structure and shape of the set of attractors. Each Figure 1. affine transformation corresponds to a probability, which characterizes the probability that the affine transformation is selected. It has no effect on the attraction set, but it is also an important information for drawing graphics. It can be seen that when the probability pi is selected properly, the basic shape of the fractal graphic is relatively complete regardless of the number of iterations, but if the selection is not appropriate, although the shape of the fractal graphic can be restored when the number of iterations is large, the fractal graphic is unrecognizable when the number (a) N = 1000 (b) N = 10000 is small; and it will also affect the imaging speed of the graphics. For example, if the probability should be too small, it will take a long time before enough points fall into the area. C. Algorithm Design In order to elaborate the procedure of fractal algorithm in IFS, this section provide the algorithm design for a simple fern leaf. (c) N = 100000 (d) N = 1000000 For a simple fern leaf, it is composed of 4 affine trans- formation. x ab x e Figure 1. Bernsley Fern Leaves Generated by Random Iteration w = + i y cd y f (1) Clearly, as the number of points increasing, the Bernsley The probabilities for affine transformation, i.e, IFS codes fern leaves is becoming more realistic. are listed in Table I. III. RANDOM FRACTAL LANDSCAPE Table I IFS CODES To pave the design for ceramic tiles, this section inves- tigates the random fractal landscape by designing different abcdefp IFS codes of various objects. w1 0 0 0 0.16 0 0 0.01 Many strangely shaped mountains, rivers, continents and w2 0.85 0.04 -0.04 0.85 0 1.6 0.85 islands in nature are products of nature. They cannot be w 3 0.2 -0.26 0.23 0.22 0 1.6 0.07 described with classic Euclidean geometry. They have sta- w4 -0.15 0.28 0.46 0.24 0 0.44 0.07 tistical self-similarity, i.e, they have the fractal features. This is because they do not have the strict self-similarity like The steps for generating the fern leaf are as follows. Mandelbrot set. For example, the blood vessels missing from (1) Define a two-dimensional array and store the IFS the human body, from large blood vessels to small blood codes in the above Table I into the array; vessels to microvessels, the entire system has self-similarity, 1476 Table VI but micro-vessels cannot branch without limit, so they do not IFS CODESOFASUN have strict self-similarity. Not only that, there are almost two things in the creation of nature that are completely identical, abc defp that is, the branches and buds of the same tree also have W1 0.15596 0.98776 -0.98776 0.15596 -0.779 9.124 0.9866 W2 0.04428 0 0 0.04116 0.641 4.829 0.0032 different shapes, which is randomness. W3 0.05566 0 0 0.04527 0.998 4.779 0.0029 W4 0.1154 0 0 0.05094 1.428 4.761 0.0036 Table II W5 0.27142 0 0 0.04923 2.38 4.781 0.0037 IFS CODES OF A MOUNTAIN abcdefp W1 0.08 -0.031 0.084 0.0306 5.17 7.97 0.03 W2 0.0801 0.0212 -0.08 0.0212 6.62 9.4 0.025 W3 0.75 0 0 0.53 -0.375 1.106 0.22 W4 0.943 0 0 0.474 -1.980 -0.65 0.245 W5 -0.402 0 0 0.402 15.513 4.588 0.21 W6 0.217 -0.052 0.075 0.15 3 5.741 0.07 W7 0.262 -1.105 0.114 0.241 -0.473 3.045 0.1 W8 0.22 0 0 0.43 14.6 4.286 0.1 Table III IFS CODES OF A GREEN TREE ab c defp Figure 2.