Introduction ractal structures of nature [1] are similar to themselves on different length-scales of observation. This geometrical property is studied for a great variety of irregular shapes, many of which result from the growth process.

Fractals geometry is introduced by Mandelbrot [l} as" the Geometry of Nature". Clouds are not spheres, mountains are not cones, coastlines are not circles and nor does lightning travel in a straight line, says Dr. Beroit Mandelbrot.

Human expertise is not sufficient to generate Fractals of nature. Fractals need computer assistance. Even Computer programming also requires methods and techniques to generate fractals. In the following, some methods and techniques are proposed for Computer generation of fractals.


# II.


# Fractals and Dimension

Fractal is defined as similar to themselves of geometrical shapes. For instance, coastlines, mountains, rivers, etc. The fractal structures are studied through the fractal dimension and defined by D = logN(h)/log(1/h) Where h is the length of line-segment and N(h) is the number of line-segments. 


# Methods and Techniques a) Iteration

Iteration is the method in which output function value may be taken an input value to the function. This method is proposed to reduce the complexity of Computer generation of fractals. This is given by n = f (n) For instance, N 1 2 4 Here, the number of self similarities can be defined as N = f(N).


# b) Recursion

Recursion is a process that calls itself, directly or indirectly. This method can be applied to simplify the complexity of Computer generation of fractals using programming.

For instance, consider the generation of the Koch curve. The recursion method is applied to call selfsimilarity. The parallel processing technique is divide number of sub-task of the task and each task will processed independently with individual processors in the Multiprocessing computer system. This parallel processing technique is proposed for Computer generation of fractals when the large number of computations and having the number of sub-tasks. The computer generation of fractals, in which the fractal can be divides into the number of sub-tasks, and each subtask will be processed with independent processor and generate the self-similarities.

For instance, consider the Sierpinski gasket in which the triangle is divided into three triangles and each triangle will self-similarly generate with independent processor in Multiprocessing computer system.   


# Conclusion

Fractals are structures which having the property of Scale-invariance or self-similarity. Selfsimilarity of a system implies that features of a structures are lookalike similar structures at different scales of length. Fractal Graphics have the number of applications in designing clothes and crafts. These a pplications are describes as fractals. Fractal dimension will identify the fractal structures or not. For instance, circles are not fractals. Different fractal structures are studied. The methods and techniques are also
1![Figure 1: Fractal scaling Author: Department of Computer Science and Engineering, College of Engineering, Sri Venkateswara University, Tirupati, India. e-mail: pvsreddy@hotmail.co.in](image-2.png "Figure 1 :")
2![Figure 2: Iteration D== log(2/3) = 0.63 09](image-3.png "Figure 2 :")
![Figure 3: Recursion](image-4.png "Figure")
4![Figure 4: Parallel . Sierpinski gasket](image-5.png "Figure 4 :")
![Figure 5: Parallel fractals](image-6.png "Figure")
6![Figure 6: Koch curve V.](image-7.png "Figure 6 :")
			© 2021 Global Journals
		
		
			

				


* 
	
		References Références Referencias