Faster Generation of Algebraic Fractals

dc.contributor.authorKaur, Lakhwinder
dc.contributor.supervisorKaur, Kanwalinderjit
dc.date.accessioned2007-09-17T12:42:21Z
dc.date.available2007-09-17T12:42:21Z
dc.date.issued2007-09-17T12:42:21Z
dc.description.abstractFractals, its concepts and applications have been widely studied in most of the natural sciences. In this thesis, various aspects related to fractals are discussed, with a special focus on algebraic fractals. The biggest constraint in creating the fractal images is high execution time, to reduce that a new technique for faster generation of connected algebraic fractals have been proposed, analyzed and compared with the conventional technique in terms of execution time required for generation of fractals. The comparison clearly shows that the new technique is more efficient than that of conventional one as it requires much less time. Also three techniques proposed by Rojas (24) for Mandelbrot set have been reviewed and suggested that these techniques can also be applied to all other algebraic fractals.en
dc.description.sponsorshipThapar Institute of Engineering and Technology, Department of Computer Science and Engineeringen
dc.format.extent9785124 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/123456789/426
dc.language.isoenen
dc.subjectFractalsen
dc.subjectAlgebraic fractalsen
dc.subjectComputer scienceen
dc.titleFaster Generation of Algebraic Fractalsen
dc.typeThesisen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
m91536.pdf
Size:
9.33 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.78 KB
Format:
Item-specific license agreed upon to submission
Description: