Fractal Geometry and Its Analysis

Total Page:16

File Type:pdf, Size:1020Kb

Fractal Geometry and Its Analysis Fractal geometry and its analysis By Muhammad Ajmal M. Phil. Thesis Session 2013-2015 DEPARTMENT OF MATHEMATICS The Islamia University of Bahawalpur Bahawalpur, Pakistan 2015 Fractal geometry and its analysis By Muhammad Ajmal Supervised by Dr. Muhammad Mustahsan DEPARTMENT OF MATHEMATICS The Islamia University of Bahawalpur Bahawalpur, Pakistan 2015 Abstract In this thesis, we used the two quaternary interpolating subdivision schemes which are modified using the rotation matrix in which the points are translated along the vector that rotates with the angle(0, ) . Using these modified schemes, we generate the fractal curves which are based on rotating vector. Moreover, we studied the convergence of the schemes. The resulting curves are non-rectifiable and curves are continuous but nowhere differentiable. Contents 1 Introduction 4 1.1 History of Fractals . 4 1.2 Definition of Fractal . 5 1.2.1 Fractal Properties . 6 1.3 Some Fractals in Nature . 6 1.3.1 The Sierpinski Triangle . 6 1.3.2 VonKochCurve ......................... 9 1.3.3 Other Example of Koch-Curve . 11 1.3.4 The Hilbert Curve . 14 1.3.5 TheL-System........................... 15 1.4 Applications of Fractals . 16 1.4.1 Tessellation by Von Koch Curves . 16 1.4.2 Space-Filling Fractal . 18 1.4.3 Reproduction of Realistic Images . 19 1.5 Generation of Fractals . 23 2 Literature Survey 24 1 2 2.1 Introduction................................ 24 2.2 A General p-ary Interpolatory Subdivision Scheme . 25 2.3 Different Fractal Curves Generate By Subdivision Scheme . 27 2.3.1 Generation of Fractal Curves by Binary Interpolatory Subdivi- sionScheme............................ 27 2.3.2 A Ternary Interpolatory Subdivision Scheme to Generate Frac- talCurves............................. 28 2.3.3 A Quaternary Subdivision Scheme to Generate Fractal Curves 30 2.3.4 Generation of Fractal Curves by Using the 6-ary Interpolatory Subdivision Scheme . 32 2.3.5 Generation of Curves by Using the 7-ary Interpolatory Subdi- visionScheme........................... 35 2.4 Fractal Properties . 37 2.4.1 Convergent Property . 37 2.4.2 Non-Rectifiable Property . 37 2.4.3 Continuous but Nowhere Differentiable Property . 37 3 Subdivision Scheme to Generate Fractal-Type Curves Based on Ro- tating Vector 38 3.1 Introduction................................ 38 3.2 Quaternary Interpolatory Subdivision Schemes Based On Rotating Vec- tor..................................... 39 3 3.2.1 A Quaternary Interpolatory Subdivision Scheme with Single Parameter............................. 39 3.2.2 A Quaternary Interpolatory Subdivision Scheme with More Than One Parameters Based on Arbitrary Rotating Vector at Angle (0, ) ............................. 44 2 3.3 Convergence Property . 46 3.4 Fractal Properties . 49 3.4.1 Non-Rectifiable Property . 49 3.4.2 Continuous but Nowhere Differentiable Property . 50 3.5 Conclusion................................. 50 Chapter 1 Introduction 1.1 History of Fractals When future a new ground, we investigate its history. The history of field give much information about the field, and specially right in mathematics field, in which all new consequences are elaborated in terms of previous form. The name fractal was invented by Mandelbrot [Barnsley, M. F. 1985] and derived from the Latin word fractus, which means broken in pieces. In the early years of nineteen century and twentieth century, the concentration on this field was extended and a large amount of literature was printed about the fractal geometry. The work of Benoît Mandelbrot’s so much in 1970s, in the starting the figures of fractal never possible to draw. As the progression of computers in science, generation of fractal figures are possible by computers. In 1904, Helge Von Koch who was the Swedish mathematician printed an article on continuous curve, at any point of this continuous curve tangent cannot be draw. 4 5 These continuous curve constructed by very simple geometry. [H. Koch. 1904] Cesàro instantaneously accepted this geometrical curve as being self-similar, and did a lot effort on the self-similar curves. The effort of Cesàro was taken further in a 1938 printed by Paul Lévy, he introduces innovative, more universal and self-similar curves. The fractal set’sproperties results proved by different authors in 1940’sand 1950’s. The work of Benoît Mandelbrot on theory of self-similar sets in 1960’s. Benoît Mandel- brot also says self similarity and fractional dimensions not used only in mathematics field, it also used in the further branches of science. In 1975, Mandelbrot introduced the word Fractal, [Benoît B. Mandelbrot 1975]. He also said that self similar things rarely found in nature, but that a numerical form of self-similarity is everywhere. By the use of computers complete it to probable to do remarkable bright image of the sets, in starting this theory existed only in articles or papers. In 1980’s and 1990’sstudy of self-similar in fractal geometry became major discipline of study. The field of geometry of fractal is young and flourishing, and we can safely spec- ulate that the field will keep on growing up for a lot of years, with new sub-field and discoveries 1.2 Definition of Fractal "Describe a fractal as a irregular or fragmented geometric figure that can be subdi- vided in parts, each of which is ( approximately same) a reduced size duplicate of the whole. Fractals are usually self-similar and free of scale". 6 1.2.1 Fractal Properties Fractal curves have the following properties. a) Its parts have the same form or construction as the entire, except that they are at a several scale and may be a little deformed. b) Its form is tremendously rough or fragmented, and remains so, whatever the scale of inspection. c) It contains "distinct elements" whose scales are very various and cover a huge range. d) Formation by iteration, the fractals are formed by the iterative means. From each progressive iterative, the fractals become more dense with multiple coppices of a single stencil. 1.3 Some Fractals in Nature In this section, we discuss about the some fractals in nature and their properties. 1.3.1 The Sierpinski Triangle The Polish mathematician Waclaw Sierpinski introduce the Sierpinski’sTriangle and also described some properties in 1916. By joining the center points of each side of triangle, generate new four triangles and vanish triangle which place at the cen- ter, these triangles are equilateral triangles. Sierpinski’striangle can be generate by repeating the same procedure infinite number of time. 7 Construction of Sierpinski Triangle Consider a equilateral triangle as an example, join the middle points of the sides of triangle and removing at the center. In this way there leave three triangles, again join the midpoints of the edges of the triangles and removing the middle one. We get the Sierpinski triangle. The procedure can elaborated in Fig. 1.1, Fig. 1.2, Fig. 1.3, Fig. 1.4 and Fig. 1.5. Fig. 1.1 A black equilateral triangle Fig. 1.2 At first level Fig. 1.3 At second level Fig. 1.4 After repeating the same procedure on three black triangles 8 Fig. 1.5 After certain number of iterations Area of Sierpinski Triangle As, removed the one quarter area of triangle at each iteration. After first iteration, three quarters area of the actual triangle is left.Thus the area of triangle after n iteration steps will be (0.75)n times the area of the actual triangle. Number of Triangles at Different Level After observing the number of triangles generated for different iterations level are tabulated as follows: Level of iteration Generated Triangles 1 1 2 4 3 13 4 40 5 121 From the above table, we can drive the general formula to calculate the number 9 of triangles being removed for any iteration. n 1 At nth iteration, the number of triangles being removed, N = 3i i=0 P 1.3.2 Von Koch Curve A very simple geometric method is used to generate the Von Koch curve. Von Koch curve generated by intersecting the line-segment into three equal size pieces and replace the center piece with two the equal size of line segment at angle 60 and 120. Very simple example of fractal curve is Von Koch curve, it follows the following construction rules. Construction of Koch Curve Taking a line-segment shows in Fig. 1.6, the line segment is divided into 3 equal parts, and the intermediate part is substitute by two linear edges at angles 60o and 120o Fig 1.7 shows the Von Koch curve after one iteration. The Von Koch curve after two, three and four iterations are shown in Fig. 1.8, Fig. 1.9 and Fig. 1.10 respectively. Fig. 1.6 A line-segment at zeroth level Fig. 1.7 Koch curve after one iteration 10 Fig. Koch curve after two iterations Fig. 1.9 Koch curve after three iterations Fig. 1.10 Koch curve after after four iterations Properties of Koch-Curve The Von Koch Curve shows the self-similarity of fractal. The similar pattern shows all over the place along the curve in different size, from visible to insignificant. In an ideal world the iteration method should go on indefinitely; On the other hand, in performance, the curve displayed on the screen no longer changes when the elementary part becomes less than the pitch. And the iteration can be stopped as well. Total Length of the Koch-Curve In each iteration each line segment would be divided into three equal edges of same 4 length. In each iteration the length of the size is multiplied by 3 times. By the rule 11 of iteration, at the nth iteration we can deduce a formula for the total length of the Koch Edges 4 n At nth iteration, the total length of Koch edges L = ( 3 ) Total Number of the Koch Edge After each iteration, we observed that every edge divided into four equal segments 1 with length 3 of its original length.
Recommended publications
  • Review Article Survey Report on Space Filling Curves
    International Journal of Modern Science and Technology Vol. 1, No. 8, November 2016. Page 264-268. http://www.ijmst.co/ ISSN: 2456-0235. Review Article Survey Report on Space Filling Curves R. Prethee, A. R. Rishivarman Department of Mathematics, Theivanai Ammal College for Women (Autonomous) Villupuram - 605 401. Tamilnadu, India. *Corresponding author’s e-mail: [email protected] Abstract Space-filling Curves have been extensively used as a mapping from the multi-dimensional space into the one-dimensional space. Space filling curve represent one of the oldest areas of fractal geometry. Mapping the multi-dimensional space into one-dimensional domain plays an important role in every application that involves multidimensional data. We describe the notion of space filling curves and describe some of the popularly used curves. There are numerous kinds of space filling curves. The difference between such curves is in their way of mapping to the one dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space filling curve. Space filling curves are the basis for scheduling has numerous advantages like scalability in terms of the number of scheduling parameters, ease of code development and maintenance. The present paper report on various space filling curves, classifications, and its applications. It elaborates the space filling curves and their applicability in scheduling, especially in transaction. Keywords: Space filling curve, Holder Continuity, Bi-Measure-Preserving Property, Transaction Scheduling. Introduction these other curves, sometimes space-filling In mathematical analysis, a space-filling curves are still referred to as Peano curves. curve is a curve whose range contains the entire Mathematical tools 2-dimensional unit square or more generally an The Euclidean Vector Norm n-dimensional unit hypercube.
    [Show full text]
  • Using Fractal Dimension for Target Detection in Clutter
    KIM T. CONSTANTIKES USING FRACTAL DIMENSION FOR TARGET DETECTION IN CLUTTER The detection of targets in natural backgrounds requires that we be able to compute some characteristic of target that is distinct from background clutter. We assume that natural objects are fractals and that the irregularity or roughness of the natural objects can be characterized with fractal dimension estimates. Since man-made objects such as aircraft or ships are comparatively regular and smooth in shape, fractal dimension estimates may be used to distinguish natural from man-made objects. INTRODUCTION Image processing associated with weapons systems is fractal. Falconer1 defines fractals as objects with some or often concerned with methods to distinguish natural ob­ all of the following properties: fine structure (i.e., detail jects from man-made objects. Infrared seekers in clut­ on arbitrarily small scales) too irregular to be described tered environments need to distinguish the clutter of with Euclidean geometry; self-similar structure, with clouds or solar sea glint from the signature of the intend­ fractal dimension greater than its topological dimension; ed target of the weapon. The discrimination of target and recursively defined. This definition extends fractal from clutter falls into a category of methods generally into a more physical and intuitive domain than the orig­ called segmentation, which derives localized parameters inal Mandelbrot definition whereby a fractal was a set (e.g.,texture) from the observed image intensity in order whose "Hausdorff-Besicovitch dimension strictly exceeds to discriminate objects from background. Essentially, one its topological dimension.,,2 The fine, irregular, and self­ wants these parameters to be insensitive, or invariant, to similar structure of fractals can be experienced firsthand the kinds of variation that the objects and background by looking at the Mandelbrot set at several locations and might naturally undergo because of changes in how they magnifications.
    [Show full text]
  • Harmonious Hilbert Curves and Other Extradimensional Space-Filling Curves
    Harmonious Hilbert curves and other extradimensional space-filling curves∗ Herman Haverkorty November 2, 2012 Abstract This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arbitrary dimensions. The new curves, called harmonious Hilbert curves, have the unique property that for any d0 < d, the d-dimensional curve is compatible with the d0-dimensional curve with respect to the order in which the curves visit the points of any d0-dimensional axis-parallel space that contains the origin. Similar generalizations to arbitrary dimensions are described for several variants of Peano's curve (the original Peano curve, the coil curve, the half-coil curve, and the Meurthe curve). The d-dimensional harmonious Hilbert curves and the Meurthe curves have neutral orientation: as compared to the curve as a whole, arbitrary pieces of the curve have each of d! possible rotations with equal probability. Thus one could say these curves are `statistically invariant' under rotation|unlike the Peano curves, the coil curves, the half-coil curves, and the familiar generalization of Hilbert curves by Butz and Moore. In addition, prompted by an application in the construction of R-trees, this paper shows how to construct a 2d-dimensional generalized Hilbert or Peano curve that traverses the points of a certain d-dimensional diagonally placed subspace in the order of a given d-dimensional generalized Hilbert or Peano curve. Pseudocode is provided for comparison operators based on the curves presented in this paper. 1 Introduction Space-filling curves A space-filling curve in d dimensions is a continuous, surjective mapping from R to Rd.
    [Show full text]
  • Measuring the Fractal Dimensions of Empirical Cartographic Curves
    MEASURING THE FRACTAL DIMENSIONS OF EMPIRICAL CARTOGRAPHIC CURVES Mark C. Shelberg Cartographer, Techniques Office Aerospace Cartography Department Defense Mapping Agency Aerospace Center St. Louis, AFS, Missouri 63118 Harold Moellering Associate Professor Department of Geography Ohio State University Columbus, Ohio 43210 Nina Lam Assistant Professor Department of Geography Ohio State University Columbus, Ohio 43210 Abstract The fractal dimension of a curve is a measure of its geometric complexity and can be any non-integer value between 1 and 2 depending upon the curve's level of complexity. This paper discusses an algorithm, which simulates walking a pair of dividers along a curve, used to calculate the fractal dimensions of curves. It also discusses the choice of chord length and the number of solution steps used in computing fracticality. Results demonstrate the algorithm to be stable and that a curve's fractal dimension can be closely approximated. Potential applications for this technique include a new means for curvilinear data compression, description of planimetric feature boundary texture for improved realism in scene generation and possible two-dimensional extension for description of surface feature textures. INTRODUCTION The problem of describing the forms of curves has vexed researchers over the years. For example, a coastline is neither straight, nor circular, nor elliptic and therefore Euclidean lines cannot adquately describe most real world linear features. Imagine attempting to describe the boundaries of clouds or outlines of complicated coastlines in terms of classical geometry. An intriguing concept proposed by Mandelbrot (1967, 1977) is to use fractals to fill the void caused by the absence of suitable geometric representations.
    [Show full text]
  • Redalyc.Self-Similarity of Space Filling Curves
    Ingeniería y Competitividad ISSN: 0123-3033 [email protected] Universidad del Valle Colombia Cardona, Luis F.; Múnera, Luis E. Self-Similarity of Space Filling Curves Ingeniería y Competitividad, vol. 18, núm. 2, 2016, pp. 113-124 Universidad del Valle Cali, Colombia Available in: http://www.redalyc.org/articulo.oa?id=291346311010 How to cite Complete issue Scientific Information System More information about this article Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Journal's homepage in redalyc.org Non-profit academic project, developed under the open access initiative Ingeniería y Competitividad, Volumen 18, No. 2, p. 113 - 124 (2016) COMPUTATIONAL SCIENCE AND ENGINEERING Self-Similarity of Space Filling Curves INGENIERÍA DE SISTEMAS Y COMPUTACIÓN Auto-similaridad de las Space Filling Curves Luis F. Cardona*, Luis E. Múnera** *Industrial Engineering, University of Louisville. KY, USA. ** ICT Department, School of Engineering, Department of Information and Telecommunication Technologies, Faculty of Engineering, Universidad Icesi. Cali, Colombia. [email protected]*, [email protected]** (Recibido: Noviembre 04 de 2015 – Aceptado: Abril 05 de 2016) Abstract We define exact self-similarity of Space Filling Curves on the plane. For that purpose, we adapt the general definition of exact self-similarity on sets, a typical property of fractals, to the specific characteristics of discrete approximations of Space Filling Curves. We also develop an algorithm to test exact self- similarity of discrete approximations of Space Filling Curves on the plane. In addition, we use our algorithm to determine exact self-similarity of discrete approximations of four of the most representative Space Filling Curves.
    [Show full text]
  • Fractals, Self-Similarity & Structures
    © Landesmuseum für Kärnten; download www.landesmuseum.ktn.gv.at/wulfenia; www.biologiezentrum.at Wulfenia 9 (2002): 1–7 Mitteilungen des Kärntner Botanikzentrums Klagenfurt Fractals, self-similarity & structures Dmitry D. Sokoloff Summary: We present a critical discussion of a quite new mathematical theory, namely fractal geometry, to isolate its possible applications to plant morphology and plant systematics. In particular, fractal geometry deals with sets with ill-defined numbers of elements. We believe that this concept could be useful to describe biodiversity in some groups that have a complicated taxonomical structure. Zusammenfassung: In dieser Arbeit präsentieren wir eine kritische Diskussion einer völlig neuen mathematischen Theorie, der fraktalen Geometrie, um mögliche Anwendungen in der Pflanzen- morphologie und Planzensystematik aufzuzeigen. Fraktale Geometrie behandelt insbesondere Reihen mit ungenügend definierten Anzahlen von Elementen. Wir meinen, dass dieses Konzept in einigen Gruppen mit komplizierter taxonomischer Struktur zur Beschreibung der Biodiversität verwendbar ist. Keywords: mathematical theory, fractal geometry, self-similarity, plant morphology, plant systematics Critical editions of Dean Swift’s Gulliver’s Travels (see e.g. SWIFT 1926) recognize a precise scale invariance with a factor 12 between the world of Lilliputians, our world and that one of Brobdingnag’s giants. Swift sarcastically followed the development of contemporary science and possibly knew that even in the previous century GALILEO (1953) noted that the physical laws are not scale invariant. In fact, the mass of a body is proportional to L3, where L is the size of the body, whilst its skeletal rigidity is proportional to L2. Correspondingly, giant’s skeleton would be 122=144 times less rigid than that of a Lilliputian and would be destroyed by its own weight if L were large enough (cf.
    [Show full text]
  • Fractal Texture and Structure of Central Place Systems
    Fractal Texture and Structure of Central Place Systems Yanguang Chen (Department of Geography, College of Urban and Environmental Sciences, Peking University, Beijing 100871, P.R. China. Email: [email protected]) Abstract: The boundaries of central place models proved to be fractal lines, which compose fractal texture of central place networks. A textural fractal can be employed to explain the scale-free property of regional boundaries such as border lines, but it cannot be directly applied to spatial structure of real human settlement systems. To solve this problem, this paper is devoted to deriving structural fractals of central place models from the textural fractals. The method is theoretical deduction based on the dimension rules of fractal sets. The textural fractals of central place models are reconstructed, the structural dimensions are derived from the textural dimensions, and the central place fractals are formulated by the k numbers and g numbers. Three structural fractal models are constructed for central place systems according to the corresponding fractal dimensions. A theoretical finding is that the classic central place models comprise Koch snowflake curve and Sierpinski space filling curve, and an inference is that the traffic principle plays a leading role in urban and rural evolution. The conclusion can be reached that the textural fractal dimensions can be converted into the structural fractal dimensions. The latter dimensions can be directly used to appraise urban and rural settlement distributions in the real world. Thus, the textural fractals can be indirectly utilized to explain the development of the systems of human settlements. Key words: Central place fractals; Systems of human settlement; Fractal dimension; Koch snowflake; Sierpinski space-filling curve; Gosper island 1.
    [Show full text]
  • Fractal Initialization for High-Quality Mapping with Self-Organizing Maps
    Neural Comput & Applic DOI 10.1007/s00521-010-0413-5 ORIGINAL ARTICLE Fractal initialization for high-quality mapping with self-organizing maps Iren Valova • Derek Beaton • Alexandre Buer • Daniel MacLean Received: 15 July 2008 / Accepted: 4 June 2010 Ó Springer-Verlag London Limited 2010 Abstract Initialization of self-organizing maps is typi- 1.1 Biological foundations cally based on random vectors within the given input space. The implicit problem with random initialization is Progress in neurophysiology and the understanding of brain the overlap (entanglement) of connections between neu- mechanisms prompted an argument by Changeux [5], that rons. In this paper, we present a new method of initiali- man and his thought process can be reduced to the physics zation based on a set of self-similar curves known as and chemistry of the brain. One logical consequence is that Hilbert curves. Hilbert curves can be scaled in network size a replication of the functions of neurons in silicon would for the number of neurons based on a simple recursive allow for a replication of man’s intelligence. Artificial (fractal) technique, implicit in the properties of Hilbert neural networks (ANN) form a class of computation sys- curves. We have shown that when using Hilbert curve tems that were inspired by early simplified model of vector (HCV) initialization in both classical SOM algo- neurons. rithm and in a parallel-growing algorithm (ParaSOM), Neurons are the basic biological cells that make up the the neural network reaches better coverage and faster brain. They form highly interconnected communication organization. networks that are the seat of thought, memory, con- sciousness, and learning [4, 6, 15].
    [Show full text]
  • FRACTAL CURVES 1. Introduction “Hike Into a Forest and You Are Surrounded by Fractals. the In- Exhaustible Detail of the Livin
    FRACTAL CURVES CHELLE RITZENTHALER Abstract. Fractal curves are employed in many different disci- plines to describe anything from the growth of a tree to measuring the length of a coastline. We define a fractal curve, and as a con- sequence a rectifiable curve. We explore two well known fractals: the Koch Snowflake and the space-filling Peano Curve. Addition- ally we describe a modified version of the Snowflake that is not a fractal itself. 1. Introduction \Hike into a forest and you are surrounded by fractals. The in- exhaustible detail of the living world (with its worlds within worlds) provides inspiration for photographers, painters, and seekers of spiri- tual solace; the rugged whorls of bark, the recurring branching of trees, the erratic path of a rabbit bursting from the underfoot into the brush, and the fractal pattern in the cacophonous call of peepers on a spring night." Figure 1. The Koch Snowflake, a fractal curve, taken to the 3rd iteration. 1 2 CHELLE RITZENTHALER In his book \Fractals," John Briggs gives a wonderful introduction to fractals as they are found in nature. Figure 1 shows the first three iterations of the Koch Snowflake. When the number of iterations ap- proaches infinity this figure becomes a fractal curve. It is named for its creator Helge von Koch (1904) and the interior is also known as the Koch Island. This is just one of thousands of fractal curves studied by mathematicians today. This project explores curves in the context of the definition of a fractal. In Section 3 we define what is meant when a curve is fractal.
    [Show full text]
  • Turtlefractalsl2 Old
    Lecture 2: Fractals from Recursive Turtle Programs use not vain repetitions... Matthew 6: 7 1. Fractals Pictured in Figure 1 are four fractal curves. What makes these shapes different from most of the curves we encountered in the previous lecture is their amazing amount of fine detail. In fact, if we were to magnify a small region of a fractal curve, what we would typically see is the entire fractal in the large. In Lecture 1, we showed how to generate complex shapes like the rosette by applying iteration to repeat over and over again a simple sequence of turtle commands. Fractals, however, by their very nature cannot be generated simply by repeating even an arbitrarily complicated sequence of turtle commands. This observation is a consequence of the Looping Lemmas for Turtle Graphics. Sierpinski Triangle Fractal Swiss Flag Koch Snowflake C-Curve Figure 1: Four fractal curves. 2. The Looping Lemmas Two of the simplest, most basic turtle programs are the iterative procedures in Table 1 for generating polygons and spirals. The looping lemmas assert that all iterative turtle programs, no matter how many turtle commands appear inside the loop, generate shapes with the same general symmetries as these basic programs. (There is one caveat here, that the iterating index is not used inside the loop; otherwise any turtle program can be simulated by iteration.) POLY (Length, Angle) SPIRAL (Length, Angle, Scalefactor) Repeat Forever Repeat Forever FORWARD Length FORWARD Length TURN Angle TURN Angle RESIZE Scalefactor Table 1: Basic procedures for generating polygons and spirals via iteration. Circle Looping Lemma Any procedure that is a repetition of the same collection of FORWARD and TURN commands has the structure of POLY(Length, Angle), where Angle = Total Turtle Turning within the Loop Length = Distance from Turtle’s Initial Position to Turtle’s Final Position within the Loop That is, the two programs have the same boundedness, closing, and symmetry.
    [Show full text]
  • Introduction to Fractal Geometry: Definition, Concept, and Applications
    University of Northern Iowa UNI ScholarWorks Presidential Scholars Theses (1990 – 2006) Honors Program 1992 Introduction to fractal geometry: Definition, concept, and applications Mary Bond University of Northern Iowa Let us know how access to this document benefits ouy Copyright ©1992 - Mary Bond Follow this and additional works at: https://scholarworks.uni.edu/pst Part of the Geometry and Topology Commons Recommended Citation Bond, Mary, "Introduction to fractal geometry: Definition, concept, and applications" (1992). Presidential Scholars Theses (1990 – 2006). 42. https://scholarworks.uni.edu/pst/42 This Open Access Presidential Scholars Thesis is brought to you for free and open access by the Honors Program at UNI ScholarWorks. It has been accepted for inclusion in Presidential Scholars Theses (1990 – 2006) by an authorized administrator of UNI ScholarWorks. For more information, please contact [email protected]. INTRODUCTION TO FRACTAL GEOMETRY: DEFINITI0N7 CONCEPT 7 AND APP LI CA TIO NS MAY 1992 BY MARY BOND UNIVERSITY OF NORTHERN IOWA CEDAR F ALLS7 IOWA • . clouds are not spheres, mountains are not cones~ coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line, . • Benoit B. Mandelbrot For centuries, geometers have utilized Euclidean geometry to describe, measure, and study the world around them. The quote from Mandelbrot poses an interesting problem when one tries to apply Euclidean geometry to the natural world. In 1975, Mandelbrot coined the term ·tractal. • He had been studying several individual ·mathematical monsters.· At a young age, Mandelbrot had read famous papers by G. Julia and P . Fatou concerning some examples of these monsters. When Mandelbrot was a student at Polytechnique, Julia happened to be one of his teachers.
    [Show full text]
  • Efficient Neighbor-Finding on Space-Filling Curves
    Universitat¨ Stuttgart Efficient Neighbor-Finding on Space-Filling Curves Bachelor Thesis Author: David Holzm¨uller* Degree: B. Sc. Mathematik Examiner: Prof. Dr. Dominik G¨oddeke, IANS Supervisor: Prof. Dr. Miriam Mehl, IPVS October 18, 2017 arXiv:1710.06384v3 [cs.CG] 2 Nov 2019 *E-Mail: [email protected], where the ¨uin the last name has to be replaced by ue. Abstract Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While the array indices of neighbors can be stored in a cell, they still have to be computed for initialization or when the grid is adaptively refined. A fast neighbor- finding algorithm can thus significantly improve the runtime of computations on multidimensional grids. In this thesis, we show how neighbors on many regular grids ordered by space-filling curves can be found in an average-case time complexity of (1). In 풪 general, this assumes that the local orientation (i.e. a variable of a describing grammar) of the SFC inside the grid cell is known in advance, which can be efficiently realized during traversals. Supported SFCs include Hilbert, Peano and Sierpinski curves in arbitrary dimensions. We assume that integer arithmetic operations can be performed in (1), i.e. independent of the size of the integer.
    [Show full text]