DOCSLIB.ORG

A Relative Superior Julia Set and Relative Superior Tricorn and Multicorns of Fractals

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Relative Superior Julia Set and Relative Superior Tricorn and Multicorns of Fractals International Journal of Computer Applications (0975 – 8887) Volume 43– No.6, April 2012 A Relative Superior Julia Set and Relative Superior Tricorn and Multicorns of Fractals Priti Dimri Shashank Lingwal Ashish Negi Head Dept. of Computer Science and Associate Professor Dept. of Computer Science and Engineering Dept. of Computer Science and Engineering G.B.Pant Engineering College Engineering G.B.Pant Engineering College Ghurdauri, Pauri G.B.Pant Engineering College Ghurdauri, Pauri Ghurdauri, Pauri ABSTRACT 2. ELABORATION OF CONCEPT In this paper we investigate the new Julia set and a new INVOLVED Tricorn and Multicorns of fractals. The beautiful and useful fractal images are generated using Ishikawa iteration to study 2.1 Mandelbrot Set many of their properties. The paper mainly emphasizes on Definition 1. [17] The Mandelbrot set M for the quadratic 2 is defined as the collection of all reviewing the detailed study and generation of Relative QzC ( ) = z + c Superior Tricorn and Multicorns along with Relative Superior cC for which the orbit of point 0 is bounded, that is, Julia Set. n M{ c C :{ Qc (0)}; n 0,1,2,3... is bounded} Keywords Complex dynamics, relative superior Julia set, Ishikawa An equivalent formulation is n iteration, Relative superior Tricorn, Relative superior M{ c C :{ Qc (0) does not tends to as n }} Multicorns. We choose the initial point 0, as 0 is the only critical point of 1. INTRODUCTION Qc. The term „Fractal‟ was coined by Benoit B Mandelbrot, in 1975 to denote his generalisation of complex shapes. Fractal 2.2 Julia Set Definition 2. [17] The set of points K whose orbits are is derived from Latin word „fractus‟ which describes the bounded under the iteration function of Qc(z) is called the appearance of broken stone : irregular and fragmented. The Julia set. We choose the initial point 0, as 0 is the only critical object Mandelbrot set, given by Mandelbrot 1979 and its point of Qc(z) . relative object Julia set due to their beauty and complexity of their nature have become elite area of research nowadays. The 2.3 Tricorn and Multicorns fractal graphics are generally obtained by “colouring” the Please The study of connectedness locus for antiholomorphic 2 escape speed of the seed points within the certain regions of polynomials zc defined as Tricorn, coined by Milnor complex plane that give rise to the unbounded orbits. [14], plays intermediate role between quadratic and cubic polynomials. Many authors have presented the papers on several “orbit Definition 3. [5] The Multicorns Ac , for the quadratic n is defined as the collection of all traps” rendering methods to create the artistic fractal images. Ac ()' z z c cC An orbit trap is a bounded area in complex plane into which for which the orbit of the point 0 is bounded, that is, an orbiting point may fall. Motivated by this idea of “orbit A{ c C : A (0) is bounded}. An traps”, Chauhan [4] introduces the different type of orbit traps c c n0,1,2,3... for Ishikawa iteration procedure. They have considered Julia equivalent formulation is 2 A{ c C : A (0) not tends to as n } . sets of z az c , as orbit traps to explore their cc nn1 The Tricorn are special Multicorns when n=2. As quoted by relevant fractal images, since, it is connected and bounded for Devany [7][8], iteration of function A z'2 c , using the a and c. c Escape Time Algorithm, results in many strange and Recently Shizuo [15] has quoted the Multicorns as the surprising structures. Devany [7][8] has named it Tricorns and generalized Tricorns or the Tricorns of higher order and observed that f(z‟), the conjugate function of f(z), is presented various properties of them. Tricorn are being used antipolynomial. Further, its second iterates is a polynomial of for commercial purpose, e.g. Tricorn Mugs and Tricorn T degree 4. The function zc'2 is conjugate of zd'2 , shirts. Multicorns are symmetrical objects. Their symmetry where 2i /3 , which shows that the Tricorn is has been studied by Lau and Schleicher [11]. Negi [16] have de introduced a new class of Relative Superior Multicorns using symmetric under rotations through angle 2 / 3 . The critical Ishikawa iterates and also studied their corresponding point for A is 0, since has only one preimage c cA c (0) Relative Superior Julia sets. whereas any other wC , has two preimages. 29 International Journal of Computer Applications (0975 – 8887) Volume 43– No.6, April 2012 2.4 Picard’s Orbit function z zn c,2 n and z() zn c 1 for Definition 4. Let X be a nonempty set and f: X X . generating fractal images with respect to Ishikawa iterates, For any point , the Picard‟s orbit is defined as the where z and c are the complex quantities and n is a real xX0 number. Each of these fractal images is constructed as two- set of iterates of a point x0 , that is; dimensional array of pixel. Each pixel is represented by a pair . of (x,y) coordinates. The complex quantities z and c can be O( f , x ) { xn ; x n f ( x n1 ), n 1,2,3...} represented as: In functional dynamics, we have existence of two different z zxy iz types of points. Points that leave the interval after a finite c cxy ic number are in stable set of infinity. Points that never leave the interval after any number of iterations have bounded orbits. where i ( 1) and zx , cx are the real parts and zy , cy are So, an orbit is bounded if there exists a positive real number, the imaginary parts of z and c respectively. The pixel such that the modulus of every point in the orbit is less than coordinates (x,y) may be associated with (cx,cy) or (zx,zy) . this number. The collection of points that are bounded, i.e. n there exists M, such that Q() z M , for all n, is called Based on this concept, the fractal images can be classified as as a prisoner set while the collection of points that are in the follows: stable set of infinity is called the escape set. Hence the boundary of a prisoner set is simultaneously the boundary of (a) z-Plane fractals, wherein (x,y) is a function of escape set and that is Julia set for Q. (zx,zy). 2.5 Ishikawa Iteration (b) c-Plane fractals, wherein (x,y) is a function of Definition 5. Ishikawa Iterates [17]: Let X be a subset of real (cx,cy). or complex number and f: X X for all xX , we 0 In the literature, the fractals for n=2 in z plane are termed as have the sequence {xn} and {yn} in X in the following the Mandelbrot set while the fractals for n=2 in c plane are manner: known as Julia sets [4, 5] yn S' n f ( x n ) (1 S ' n ) x n xn1 S n f( y n ) (1 S n ) x n 4. ESCAPE CRITERIA FOR RELATIVE where and & are both 0S 'n 1, 01Sn S 'n Sn SUPERIOR MANDELBROT AND JULIA convergent to non-zero number. SET 2.6 Relative Superior Mandelbrot Set 4.1 Escape Criterion for Quadratics Now we define Mandelbrot set for the function with respect to [13] Suppose that z max{ c ,2 / s ,2 / s '} , then Ishikawa iterates. We call them as Relative Superior zz(1 )n and z as n . So, Mandelbrot sets. n Definition 6. [17] Relative Superior Mandelbrot set RSM for zc and zs 2/ as well as zs 2 / ' shows the the function of the form n , where n = Qc () z z c escape criteria for quadratics. 1,2,3,… is defined as the collection of cC for which the orbit of 0 is bounded i.e. 4.2 Escape Criterion for Cubics k is bounded. [13] Suppose zmax{ b ,( a 2/) s1/2 ,( a 2/ s ') 1/2 } RSM{ c C : Qc (0): k 0,1,2,3...} then as n . This gives the escape criterion In functional dynamics, we have existence of two different zn types of points. Points that leave the interval after a finite for cubic polynomials. number are in stable set of infinity. Points that never leave the interval after any number of iterations have bounded orbits. 4.3 General Escape Criterion So, an orbit is bounded if there exist a positive real number. [13] Consider z max{ c ,(2/ s )1/2 ,(2/ s ') 1/2 } then as n is the escape criterion. 2.7 Relative Superior Julia Set zn Definition 7. [17] The set of points RSK whose orbits are bounded under relative superior iteration of function Q(z) is Note that the initial value z0 should be infinity, since infinity called Relative Superior Julia sets. Relative Superior Julia set is the critical point of z() zn c 1 . However, instead of Q is boundary of Julia set RSK. of starting with z0 = infinity, it is simpler to start with z1 = c, which yields the same result. A critical point of 3. GENERATING PROCESS z F() z c is a point where Fz'( ) 0 . The basic principle of generating fractals employs the iterative formula: z f() z where z0 = the initial valueof z, nn1 th and zi = the value of complex quantity z at the i iteration [17]. For example, the Mandelbrot‟s self-squared function for generating fractal is: f(z) = z2+c , where z and c are both complex quantities. We propose the use of transformation 30 International Journal of Computer Applications (0975 – 8887) Volume 43– No.6, April 2012 5.
Load more

Recommended publications
  • Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity
    Journal of Computer Science 4 (5): 408-414, 2008 ISSN 1549-3636 © 2008 Science Publications Fractal (Mandelbrot and Julia) Zero-Knowledge Proof of Identity Mohammad Ahmad Alia and Azman Bin Samsudin School of Computer Sciences, University Sains Malaysia, 11800 Penang, Malaysia Abstract: We proposed a new zero-knowledge proof of identity protocol based on Mandelbrot and Julia Fractal sets. The Fractal based zero-knowledge protocol was possible because of the intrinsic connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, the private key was used as an input parameter for Mandelbrot Fractal function to generate the corresponding public key. Julia Fractal function was then used to calculate the verified value based on the existing private key and the received public key. The proposed protocol was designed to be resistant against attacks. Fractal based zero-knowledge protocol was an attractive alternative to the traditional number theory zero-knowledge protocol. Key words: Zero-knowledge, cryptography, fractal, mandelbrot fractal set and julia fractal set INTRODUCTION Zero-knowledge proof of identity system is a cryptographic protocol between two parties. Whereby, the first party wants to prove that he/she has the identity (secret word) to the second party, without revealing anything about his/her secret to the second party. Following are the three main properties of zero- knowledge proof of identity[1]: Completeness: The honest prover convinces the honest verifier that the secret statement is true. Soundness: Cheating prover can’t convince the honest verifier that a statement is true (if the statement is really false). Fig. 1: Zero-knowledge cave Zero-knowledge: Cheating verifier can’t get anything Zero-knowledge cave: Zero-Knowledge Cave is a other than prover’s public data sent from the honest well-known scenario used to describe the idea of zero- prover.
    [Show full text]
  • Fractals Generated by Various Iterative Procedures – a Survey
    DOI: 10.15415/mjis.2014.22016 Fractals Generated by Various Iterative Procedures – A Survey Renu Chugh* and Ashish† Department of Mathematics, Maharishi Dayanand University, Rohtak *Email: [email protected]; †Email: [email protected] Abstract These days fractals and the study of their dynamics is one of the emerging and interesting area for mathematicians. New fractals for various equations have been created using one-step iterative procedure, two-step iterative procedure, three-step iterative procedure and four-step iterative procedure in the literature. Fractals are geometric shapes that have symmetry of scale. In this paper, a detailed survey of fractals existing in the literature such as Julia sets, Mandelbrot sets, Cantor sets etc have been given. Keywords: Julia Sets, Mandelbrot Sets, Cantor Sets, Sierpinski’s Triangle, Koch Curve 1. INTRODUCTION n the past, mathematics has been concerned largely with sets and functions to which the methods of classical calculus be applied. Sets or functions Ithat are not sufficiently smooth or regular have tended to be ignored as ‘pathological’ and not worthy of study. Certainly, they were regarded as individual curiosities and only rarely were thought of as a class to which a general theory might be applicable. In recent years this attitude has changed. It has been realized that a great deal can be said and is worth saying, about the mathematics of non-smooth objects. Moreover, irregular sets provide a much better representation of many natural phenomena than do the figures of classical geometry. Fractal geometry provides a general framework for the Mathematical Journal of Interdisciplinary Sciences study of such irregular sets (Falconer (1990)).
    [Show full text]
  • Rendering Hypercomplex Fractals Anthony Atella [email protected]
    Rhode Island College Digital Commons @ RIC Honors Projects Overview Honors Projects 2018 Rendering Hypercomplex Fractals Anthony Atella [email protected] Follow this and additional works at: https://digitalcommons.ric.edu/honors_projects Part of the Computer Sciences Commons, and the Other Mathematics Commons Recommended Citation Atella, Anthony, "Rendering Hypercomplex Fractals" (2018). Honors Projects Overview. 136. https://digitalcommons.ric.edu/honors_projects/136 This Honors is brought to you for free and open access by the Honors Projects at Digital Commons @ RIC. It has been accepted for inclusion in Honors Projects Overview by an authorized administrator of Digital Commons @ RIC. For more information, please contact [email protected]. Rendering Hypercomplex Fractals by Anthony Atella An Honors Project Submitted in Partial Fulfillment of the Requirements for Honors in The Department of Mathematics and Computer Science The School of Arts and Sciences Rhode Island College 2018 Abstract Fractal mathematics and geometry are useful for applications in science, engineering, and art, but acquiring the tools to explore and graph fractals can be frustrating. Tools available online have limited fractals, rendering methods, and shaders. They often fail to abstract these concepts in a reusable way. This means that multiple programs and interfaces must be learned and used to fully explore the topic. Chaos is an abstract fractal geometry rendering program created to solve this problem. This application builds off previous work done by myself and others [1] to create an extensible, abstract solution to rendering fractals. This paper covers what fractals are, how they are rendered and colored, implementation, issues that were encountered, and finally planned future improvements.
    [Show full text]
  • Generating Fractals Using Complex Functions
    Generating Fractals Using Complex Functions Avery Wengler and Eric Wasser What is a Fractal? ● Fractals are infinitely complex patterns that are self-similar across different scales. ● Created by repeating simple processes over and over in a feedback loop. ● Often represented on the complex plane as 2-dimensional images Where do we find fractals? Fractals in Nature Lungs Neurons from the Oak Tree human cortex Regardless of scale, these patterns are all formed by repeating a simple branching process. Geometric Fractals “A rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole.” Mandelbrot (1983) The Sierpinski Triangle Algebraic Fractals ● Fractals created by repeatedly calculating a simple equation over and over. ● Were discovered later because computers were needed to explore them ● Examples: ○ Mandelbrot Set ○ Julia Set ○ Burning Ship Fractal Mandelbrot Set ● Benoit Mandelbrot discovered this set in 1980, shortly after the invention of the personal computer 2 ● zn+1=zn + c ● That is, a complex number c is part of the Mandelbrot set if, when starting with z0 = 0 and applying the iteration repeatedly, the absolute value of zn remains bounded however large n gets. Animation based on a static number of iterations per pixel. The Mandelbrot set is the complex numbers c for which the sequence ( c, c² + c, (c²+c)² + c, ((c²+c)²+c)² + c, (((c²+c)²+c)²+c)² + c, ...) does not approach infinity. Julia Set ● Closely related to the Mandelbrot fractal ● Complementary to the Fatou Set Featherino Fractal Newton’s method for the roots of a real valued function Burning Ship Fractal z2 Mandelbrot Render Generic Mandelbrot set.
    [Show full text]
  • Iterated Function Systems, Ruelle Operators, and Invariant Projective Measures
    MATHEMATICS OF COMPUTATION Volume 75, Number 256, October 2006, Pages 1931–1970 S 0025-5718(06)01861-8 Article electronically published on May 31, 2006 ITERATED FUNCTION SYSTEMS, RUELLE OPERATORS, AND INVARIANT PROJECTIVE MEASURES DORIN ERVIN DUTKAY AND PALLE E. T. JORGENSEN Abstract. We introduce a Fourier-based harmonic analysis for a class of dis- crete dynamical systems which arise from Iterated Function Systems. Our starting point is the following pair of special features of these systems. (1) We assume that a measurable space X comes with a finite-to-one endomorphism r : X → X which is onto but not one-to-one. (2) In the case of affine Iterated Function Systems (IFSs) in Rd, this harmonic analysis arises naturally as a spectral duality defined from a given pair of finite subsets B,L in Rd of the same cardinality which generate complex Hadamard matrices. Our harmonic analysis for these iterated function systems (IFS) (X, µ)is based on a Markov process on certain paths. The probabilities are determined by a weight function W on X. From W we define a transition operator RW acting on functions on X, and a corresponding class H of continuous RW - harmonic functions. The properties of the functions in H are analyzed, and they determine the spectral theory of L2(µ).ForaffineIFSsweestablish orthogonal bases in L2(µ). These bases are generated by paths with infinite repetition of finite words. We use this in the last section to analyze tiles in Rd. 1. Introduction One of the reasons wavelets have found so many uses and applications is that they are especially attractive from the computational point of view.
    [Show full text]
  • Self-Similarity for the Tricorn
    SELF-SIMILARITY FOR THE TRICORN HIROYUKI INOU Abstract. We discuss self-similar property of the tricorn, the connectedness locus of the anti-holomorphic quadratic family. As a direct consequence of the study on straightening maps by Kiwi and the author [IK12], we show that there are many homeomorphic copies of the Mandelbrot sets. With help of rigorous numerical computation, we also prove that the straightening map is not continuous for the candidate of a \baby tricorn" centered at the airplane, hence not a homeomorphism. 1. Introduction 2 In the study of dynamics of quadratic polynomials Qc(z) = z + c, the most important object is the Mandelbrot set: M = fc 2 C; K(Qc) is connectedg; n where K(Qc) = fz 2 C; fQc (z)gn≥0 is boundedg is the filled Julia set of Qc. It is well-known that \baby Mandelbrot sets", which are homeomorphic to the Mandelbrot set itself, are dense in the boundary of the Mandelbrot set [DH85] [Ha¨ı00]. Analogously, one may consider the anti-holomorphic family of quadratic polyno- mials: 2 fc(z) =z ¯ + c: The connectedness locus of this family is called the tricorn and we denote it by M∗ 2 (Figure 1): Since the second iterate fc is a (real-analytic) family of holomorphic polynomials, one may regard the family as a special family of holomorphic dynam- ics. In fact, Milnor [Mil92] numerically observed a \little tricorn" in the real cubic family, and presented the tricorn as a prototype of such objects. The tricorn was first named the Mandelbar set and studied by Crowe et al.
    [Show full text]
  • Fundamental Theorems in Mathematics
    SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL Abstract. An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 243 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful and whether it could serve as a guide [6] without leading to panic. The order is not a ranking but ordered along a time-line when things were writ- ten down. Since [556] stated “a mathematical theorem only becomes beautiful if presented as a crown jewel within a context" we try sometimes to give some context. Of course, any such list of theorems is a matter of personal preferences, taste and limitations. The num- ber of theorems is arbitrary, the initial obvious goal was 42 but that number got eventually surpassed as it is hard to stop, once started. As a compensation, there are 42 “tweetable" theorems with included proofs. More comments on the choice of the theorems is included in an epilogue. For literature on general mathematics, see [193, 189, 29, 235, 254, 619, 412, 138], for history [217, 625, 376, 73, 46, 208, 379, 365, 690, 113, 618, 79, 259, 341], for popular, beautiful or elegant things [12, 529, 201, 182, 17, 672, 673, 44, 204, 190, 245, 446, 616, 303, 201, 2, 127, 146, 128, 502, 261, 172]. For comprehensive overviews in large parts of math- ematics, [74, 165, 166, 51, 593] or predictions on developments [47]. For reflections about mathematics in general [145, 455, 45, 306, 439, 99, 561]. Encyclopedic source examples are [188, 705, 670, 102, 192, 152, 221, 191, 111, 635].
    [Show full text]
  • Bachelorarbeit Im Studiengang Audiovisuelle Medien Die
    Bachelorarbeit im Studiengang Audiovisuelle Medien Die Nutzbarkeit von Fraktalen in VFX Produktionen vorgelegt von Denise Hauck an der Hochschule der Medien Stuttgart am 29.03.2019 zur Erlangung des akademischen Grades eines Bachelor of Engineering Erst-Prüferin: Prof. Katja Schmid Zweit-Prüfer: Prof. Jan Adamczyk Eidesstattliche Erklärung Name: Vorname: Hauck Denise Matrikel-Nr.: 30394 Studiengang: Audiovisuelle Medien Hiermit versichere ich, Denise Hauck, ehrenwörtlich, dass ich die vorliegende Bachelorarbeit mit dem Titel: „Die Nutzbarkeit von Fraktalen in VFX Produktionen“ selbstständig und ohne fremde Hilfe verfasst und keine anderen als die angegebenen Hilfsmittel benutzt habe. Die Stellen der Arbeit, die dem Wortlaut oder dem Sinn nach anderen Werken entnommen wurden, sind in jedem Fall unter Angabe der Quelle kenntlich gemacht. Die Arbeit ist noch nicht veröffentlicht oder in anderer Form als Prüfungsleistung vorgelegt worden. Ich habe die Bedeutung der ehrenwörtlichen Versicherung und die prüfungsrechtlichen Folgen (§26 Abs. 2 Bachelor-SPO (6 Semester), § 24 Abs. 2 Bachelor-SPO (7 Semester), § 23 Abs. 2 Master-SPO (3 Semester) bzw. § 19 Abs. 2 Master-SPO (4 Semester und berufsbegleitend) der HdM) einer unrichtigen oder unvollständigen ehrenwörtlichen Versicherung zur Kenntnis genommen. Stuttgart, den 29.03.2019 2 Kurzfassung Das Ziel dieser Bachelorarbeit ist es, ein Verständnis für die Generierung und Verwendung von Fraktalen in VFX Produktionen, zu vermitteln. Dabei bildet der Einblick in die Arten und Entstehung der Fraktale
    [Show full text]
  • Understanding the Mandelbrot and Julia Set
    Understanding the Mandelbrot and Julia Set Jake Zyons Wood August 31, 2015 Introduction Fractals infiltrate the disciplinary spectra of set theory, complex algebra, generative art, computer science, chaos theory, and more. Fractals visually embody recursive structures endowing them with the ability of nigh infinite complexity. The Sierpinski Triangle, Koch Snowflake, and Dragon Curve comprise a few of the more widely recognized iterated function fractals. These recursive structures possess an intuitive geometric simplicity which makes their creation, at least at a shallow recursive depth, easy to do by hand with pencil and paper. The Mandelbrot and Julia set, on the other hand, allow no such convenience. These fractals are part of the class: escape-time fractals, and have only really entered mathematicians’ consciousness in the late 1970’s[1]. The purpose of this paper is to clearly explain the logical procedures of creating escape-time fractals. This will include reviewing the necessary math for this type of fractal, then specifically explaining the algorithms commonly used in the Mandelbrot Set as well as its variations. By the end, the careful reader should, without too much effort, feel totally at ease with the underlying principles of these fractals. What Makes The Mandelbrot Set a set? 1 Figure 1: Black and white Mandelbrot visualization The Mandelbrot Set truly is a set in the mathematica sense of the word. A set is a collection of anything with a specific property, the Mandelbrot Set, for instance, is a collection of complex numbers which all share a common property (explained in Part II). All complex numbers can in fact be labeled as either a member of the Mandelbrot set, or not.
    [Show full text]
  • Fractal Art Using Variations on Escape Time Algorithms in the Complex Plane
    Fractal art using variations on escape time algorithms in the complex plane P. D. SISSON Louisiana State University in Shreveport, USA One University Place Shreveport LA 71115 USA Email: [email protected] The creation of fractal art is easily accomplished through the use of widely- available software, and little mathematical knowledge is required for its use. But such an approach is inherently limiting and obscures many possible avenues of investigation. This paper explores the use of orbit traps together with a simple escape time algorithm for creating fractal art based on nontrivial complex-valued functions. The purpose is to promote a more direct hands-on approach to exploring fractal artistic expressions. The article includes a gallery of images illustrating the visual effects of function, colour palette, and orbit trap choices, and concludes with suggestions for further experimentation. Keywords: Escape time algorithm; fractal; fractal art; dynamical system; orbit trap AMS Subject Classification: 28A80; 37F10; 37F45 1 Introduction The variety of work currently being created and classified as fractal art is pleasantly immense, and the mathematical knowledge required by artists to participate in the creative process is now essentially nil. Many software packages have been written that allow artists to explore fractal creations on purely aesthetic terms, and the beauty of much of the resulting work is undeniable (see http://en.wikipedia.org/wiki/Fractal for an up-to-date collection of fractal software, and http://www.fractalartcontests.com/2006/ for a nice collection of recent fractal art). But a reliance on existing software and a reluctance to delve into the mathematics of fractal art is inherently limiting and holds the threat of stagnation.
    [Show full text]
  • New Key Exchange Protocol Based on Mandelbrot and Julia Fractal Sets Mohammad Ahmad Alia and Azman Bin Samsudin
    302 IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.2, February 2007 New Key Exchange Protocol Based on Mandelbrot and Julia Fractal Sets Mohammad Ahmad Alia and Azman Bin Samsudin, School of Computer Sciences, Universiti Sains Malaysia. Summary by using two keys, a private and a public key. In most In this paper, we propose a new cryptographic key exchange cases, by exchanging the public keys, both parties can protocol based on Mandelbrot and Julia Fractal sets. The Fractal calculate a unique shared key, known only to both of them based key exchange protocol is possible because of the intrinsic [2, 3, 4]. connection between the Mandelbrot and Julia Fractal sets. In the proposed protocol, Mandelbrot Fractal function takes the chosen This paper proposed a new Fractal (Mandelbrot and private key as the input parameter and generates the corresponding public key. Julia Fractal function is then used to Julia Fractal sets) key exchange protocol as a method to calculate the shared key based on the existing private key and the securely agree on a shared key. The proposed method received public key. The proposed protocol is designed to be achieved the secure exchange protocol by creating a resistant against attacks, utilizes small key size and shared secret through the use of the Mandelbrot and Julia comparatively performs faster then the existing Diffie-Hellman Fractal sets. key exchange protocol. The proposed Fractal key exchange protocol is therefore an attractive alternative to traditional 2.1. Fractals number theory based key exchange protocols. A complex number consists of a real and an imaginary Key words: Fractals Cryptography, Key- exchange protocol, Mandelbrot component.
    [Show full text]
  • New Escape Time Koch Curve in Complex Plane
    International Journal of Computer Applications (0975 – 8887) Volume 58– No.8, November 2012 New Escape Time Koch Curve in Complex Plane Priti Dimri Dharmendra Kumar Ashish Negi Associate Professor, Associate Professor, Associate Professor, Department of Computer Department of Computer Department of Computer Science and Engineering Science Science and Engineering G.B Pant Engineering College Institute of Management G.B Pant Engineering College Pauri Garhwal, 246001 Studies Dehradun Pauri Garhwal, 246001 ABSTRACT that of f(x) = |x| at x = 0, where no tangent is defined.[15] Von Koch curves allow numerous variations and have Because of its unique construction the Koch curve has a inspired many researchers and fractal artists to produce noninteger dimensionality. In the Koch curve, a fractal pattern amazing pieces of art. In this paper we present a new of 60-degree-to-base line segments one-third the length of the algorithm for plotting the Koch curve using complex previous line is repeated. The portion of the base line under a variables. Further we have applied various coloring newly formed triangle is deleted. Such geometric algorithms to generate complex Koch fractals. manipulation continued indefinitely, forms the Koch Curve. [23] Keywords The Von Koch Curve shows the self-similar property of a Koch curves, Fractal Coloring, Escape Time Algorithm. fractal. The same pattern appears everywhere along the curve 1. INTRODUCTION in different scale, from visible to infinitesimal. The Koch curve has a Hausdorff dimension of log(4)/log(3), i.e. A fractal is an object or quantity that displays self-similarity approximately 1.2619 and is enclosed in a finite area [8].
    [Show full text]