Geometric Modelling of General Sierpinski Fractals using iterated function system in Matlab
نویسندگان
چکیده
Study on properties of general Sierpinski fractals, including dimension, measure, Lipschitz equivalence, etc is very interesting. Like other fractals, general Sierpinski fractals are so complicated and irregular that it is hopeless to model them by simply using classical geometry objects. In [22], the authors the geometric modelling of a class of general Sierpinski fractals and their geometric constructions in Matlab base on iterative algorithm for the purpose of studying fractal theory. In this paper, we continue such investigation by adding certain rotation structure and obtain some results by extending our approaches to three dimensional space. Our results may be used for any graphical goal, not only for mathematical reasons. Key–Words: general Sierpinski carpet, general Sierpinski gasket, general Sierpinski sponge, IFS, deterministic algorithm, random iterated algorithm, Matlab
منابع مشابه
Geometric Modelling of a Class of Sierpinski-type Fractals and Their Geometric Constructions
Study on properties of Sierpinski-type fractals, including dimension, measure, Lipschitz equivalence, etc is very interesting. It is well know that studying fractal theory relies on in-depth observation and analysis to topological structures of fractals and their geometric constructions. But most works of simulating fractals are for graphical goal and often done by non-mathematical researchers....
متن کاملSimulation of Sierpinski-type fractals and their geometric constructions in Matlab environment
Study on properties of Sierpinski-type fractals, including dimension, measure, connectedness, Lipschitz equivalence, etc are very interesting. Although there have been some very nice results were obtained, there is still a long way to go to solve all the problems. In order to facilitate understanding of these results and further study, in this paper, we simulate this kind of fractals and their ...
متن کاملA novel algorithm for computing the 2D split-vector-radix FFT
This paper presents a novel two-dimensional split-vector-radix fast-Fourier-transform (2D svr-FFT) algorithm. The modularizing feature of the 2D svr-FFT structure enables us to explore its characteristics by identifying the local structural property. Each local module is designated as a DFT (non-DFT) block if its output corresponds to DFT (non-DFT) values. The block attribute (DFT or non-DFT) d...
متن کاملAnalysis of Orthogonality and of Orbits in Affine Iterated Function Systems
We introduce a duality for Affine Iterated Function Systems (AIFS) which is naturally motivated by group duality in the context of traditional harmonic analysis. Our affine systems yield fractals defined by iteration of contractive affine mappings. We build a duality for such systems by scaling in two directions: fractals in the small by contractive iterations, and fractals in the large by recu...
متن کاملStochastic Image Compression Using Fractals
Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of such objects, Iterated Function Systems (IFS) {[3] , [1]} are recently being used. The main problem in fractal encoding using IFS is large amount of time taken for the compression of the fractal object. Our endeavor in ...
متن کامل