DOCSLIB.ORG

Redalyc.Self-Similarity of Space Filling Curves

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. We found that SFCs like Moore’s based on recursive structure are actually not self- similar, highlighting the need to establish a formal definition of the concept for SFCs. Keywords: Fractals, self-similarity, Space-Filling Curves. Resumen El propósito de este artículo es desarrollar un test que permita determinar la auto-similaridad de una Space Filling Curve (SFC), estudiándolas desde el punto de vista de la teoría fractal y concentrándonos en la propiedad de auto-similaridad. El test consiste de dos fases, en la primera se identifica una partición especial de la curva denominada partición CM y luego se muestra que la curva es auto-similar si y sólo si es auto-similar bajo dicha partición. Adicionalmente, el test es aplicado a cuatro famosas SFC (Peano, Moore, Meander y Lebesgue) para determinar su auto-similaridad. Se encuentra que algunas SFC como la de Moore con estructura recursiva y aparente auto-similaridad son en realidad no auto-similares, resaltando la necesidad de formalizar el concepto. Palabras Clave: Auto-similaridad, fractales, Space Filling Curves. 113 Ingeniería y Competitividad, Volumen 18, No. 2, p. 113 - 124 (2016) 1. Introduction pattern recognition in several contexts (Rosenthal & Kouri, 1973; Lam & Liu, 1996). In 1878, Cantor established the equipotency between R and any n-dimensional euclidean In the literature of Space Filling Curves, space Rn (Sagan, 1994a). In the plane, it implies mathematicians have stated a close relation the existence of a bijective mapping from R to between SFCs and fractals. SFCs have patrons and R2 (an interval can be mapped into the plane). regularities that also are commonly found in fractals A year later, Netto proved that such mapping and that relation has been linked to the self-similarity cannot be continuous (Bader, 2013). A decade property of fractals (Plaza et al., 2005; Haverkort & later, Peano proved the existence of a continuous Walderveen, 2010; Skubalska-Rafajowicz, 2005). surjective mapping from R to R2 (Sagan, 1994c). Wunderlich (1954) linked fractals and SFCs by He proposed a continuous curve that goes through introducing Iterated Functions System (IFS) in every point of the plane (Figure 1), and those the generation of discrete approximation of Space curves were called Space Filling Curves (SFCs). Filling Curves. IFS is a method to generate discrete SFCs has fascinated mathematicians since then, approximation of fractals by means of their self- and brilliant mathematicians as Hilbert, Moore, similarity property and recursive algorithms. In Lebesgue, Meander, Poyla and Sierpinski has this way, a discrete approximation of a fractal of proposed their own SFCs exploring different nth order is composed of a finite number of copies properties and perspectives (Sagan, 1994a). of itself that can only differ from the original in size and orientation and are integrated under a regular patron consistent through iterations. McClure (2003) studied the self-similarity of the Hilbert curve, and lays out the advantages derived from this property by utilizing Iterated Functions System (IFS) as Wunderlich (Hutchinson, 1981). But, since not all SFCs are exact self-similar, in this paper, we propose a method to determine whether a discrete approximation of Space Filling Curve is exact self-similar. Figure 1. A discrete approximation of the Despite the extensive attention that SFCs have Peano Space Filling Curve. received in the literature and their evident link with fractals, there is no formal definition But mathematicians are not the only ones who for their self-similarity. This paper presents a have been fascinated with SFCs, they also formal conceptualization of the self-similarity are extensively used in engineering (Bader, adapted to the context SFCs and an efficient 2013). SFCs are used to solve combinatorial computational test to determine whether a optimization problems in industrial contexts specific SFC is self-similar. (Hu & Wang, 2004; Hua & Zhou, 2008). They also have been used as a scanning technique for The paper is organized as follows: Section 2 image processing and compression (Dafner et al., presents an introduction to the theory of self- 2000). Anotaipaiboom & Makhanov (2005) used similarity and to SFCs theory, also a definition of SFCs to plan movement paths of robotic arms exact self-similarity of discrete approximations with numeric control. Additionally, Valle & Ortiz of SFC. Section 3 presents the test that determine (2011), Bahi et al. (2008), and Chen & Chang whether a discrete approximation of a Space (2005) have explored applications of SFCs for Filling Curve on the plane is exact self-similar. In clustering. Furthermore, SFCs have been used for Section 4, we determine self-similarity of four 114 Ingeniería y Competitividad, Volumen 18, No. 2, p. 113 - 124 (2016) of the most representative SFCs using our test. Finally, as in geometry a triangle is represented by three Section 5 provides conclusions and future research. non-collinear points, we represent a SFC by means of an ordered finite list of points, SFC = 2. Context {p1,p2,……,pn}. Figure 3a shows the Hilbert curve and the circles indicate the set of points by By definition, every fractal has the property of self- which it is represented. In this case, the Hilbert similarity (Barnsley, 1993). A set is self-similar if curve is found in the 4x4 lattice, hence 16 points when we examine small portions of it, we only see are used to represent it. The order in which these reproductions of our initial set (Rubiano, 2002), as points are found in the list, is the same order in shown in Figure 2. which these points are found in the curve. Figures 3b, 3c, 3d and 3e show partitions of the curve of Figure 3a. Figure 3b is a partition with four equivalence classes, and each equivalence class has four points. Note that the union of the four equivalence classes equals the 16 points in Figure 3a and no point belongs to more than one equivalence class. Figure 2. Sierpinski triangle. Ferrari (2007) establishes a formal definition of self-similarity, as follows: Definition 1: 2 A compact set X ∩ R is self-similar if there is a finite Figure 3. Different cardinality partitions of Hilbert curve. set of contractive∩ similarities FN ={F1,F2,…Fn} such n that X= i=1 Fi (X) and the subsets of X of the form Fi (X) overlap only in the boundaries. 3. Self-Similarity Test Contractive similarities are affine transformations It is seen in Figure 2 that the largest triangle is of the form F = r D x+b , where r is a scalar such i i i i i made up of three smaller triangles which in turn that 0< r < 1, D is the matrix of rotations ∩ and b is i i i are made up of three smaller ones. To prove self- a vector in R2 (Barnsley 1993). Note that n F (X) i=1 i similarity of this set, it is sufficient to show itsIFS , is a cover of X. In addition, the intersection of which is easily found by inspection. However, it is subsets F (X) is only allowed on the borders, a i not always evident to prove self-similarity of a set. property which makes it a quasi-partition. In SFCs context, the latter restriction is even stronger, According to the definition of self-similarity, in since these curves go through every point ∩ of the order to prove that a set is not self-similar, it is plane exactly once. Thus, in SFCs context, n F (X) i=1 i necessary to show the non-existence of a partition is a partition of X and every Fi (X) is an such that all equivalence classes p of be equivalence class. i contractive similarities of X, that is, In this paper, we analyze SFCs from a combinatorial point of view, just as Dai & Su (2003) do. As well 115 Ingeniería y Competitividad, Volumen 18, No. 2, p. 113 - 124 (2016) Thus the formula may be written as, of partitions included in H until the only one left is CM. The basic foundations for the process are the following two propositions: This would imply that to prove the self-similarity Proposition 1: It is necessary that all equivalence of a compact set X, it is necessary to evaluate classes pi of be affine transformations of X, all partitions of X and find in everyone of them for X to be self-similar under .
Load more

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]
  • Fractal-Based Magnetic Resonance Imaging Coils for 3T Xenon Imaging Fractal-Based Magnetic Resonance Imaging Coils for 3T Xenon Imaging
    Fractal-based magnetic resonance imaging coils for 3T Xenon imaging Fractal-based magnetic resonance imaging coils for 3T Xenon imaging By Jimmy Nguyen A Thesis Submitted to the School of Graduate Studies in thePartial Fulfillment of the Requirements for the Degree Master of Applied Science McMaster University © Copyright by Jimmy Nguyen 10 July 2020 McMaster University Master of Applied Science (2020) Hamilton, Ontario (Department of Electrical & Computer Engineering) TITLE: Fractal-based magnetic resonance imaging coils for 3T Xenon imaging AUTHOR: Jimmy Nguyen, B.Eng., (McMaster University) SUPERVISOR: Dr. Michael D. Noseworthy NUMBER OF PAGES: ix, 77 ii Abstract Traditional 1H lung imaging using MRI faces numerous challenges and difficulties due to low proton density and air-tissue susceptibility artifacts. New imaging techniques using inhaled xenon gas can overcome these challenges at the cost of lower signal to noise ratio. The signal to noise ratio determines reconstructed image quality andis an essential parameter in ensuring reliable results in MR imaging. The traditional RF surface coils used in MR imaging exhibit an inhomogeneous field, leading to reduced image quality. For the last few decades, fractal-shaped antennas have been used to optimize the performance of antennas for radiofrequency systems. Although widely used in radiofrequency identification systems, mobile phones, and other applications, fractal designs have yet to be fully researched in the MRI application space. The use of fractal geometries for RF coils may prove to be fruitful and thus prompts an investiga- tion as the main goal of this thesis. Preliminary simulation results and experimental validation results show that RF coils created using the Gosper and pentaflake offer improved signal to noise ratio and exhibit a more homogeneous field than that ofa traditional circular surface coil.
    [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]
  • Mathematics As “Gate-Keeper” (?): Three Theoretical Perspectives That Aim Toward Empowering All Children with a Key to the Gate DAVID W
    ____ THE _____ MATHEMATICS ___ ________ EDUCATOR _____ Volume 14 Number 1 Spring 2004 MATHEMATICS EDUCATION STUDENT ASSOCIATION THE UNIVERSITY OF GEORGIA Editorial Staff A Note from the Editor Editor Dear TME readers, Holly Garrett Anthony Along with the editorial team, I present the first of two issues to be produced during my brief tenure as editor of Volume 14 of The Mathematics Educator. This issue showcases the work of both Associate Editors veteran and budding scholars in mathematics education. The articles range in topic and thus invite all Ginger Rhodes those vested in mathematics education to read on. Margaret Sloan Both David Stinson and Amy Hackenberg direct our attention toward equity and social justice in Erik Tillema mathematics education. Stinson discusses the “gatekeeping” status of mathematics, offers theoretical perspectives he believes can change this, and motivates mathematics educators at all levels to rethink Publication their roles in empowering students. Hackenberg’s review of Burton’s edited book, Which Way Social Stephen Bismarck Justice in Mathematics Education? is both critical and engaging. She artfully draws connections across Laurel Bleich chapters and applauds the picture of social justice painted by the diversity of voices therein. Dennis Hembree Two invited pieces, one by Chandra Orrill and the other by Sybilla Beckmann, ask mathematics Advisors educators to step outside themselves and reexamine features of PhD programs and elementary Denise S. Mewborn textbooks. Orrill’s title question invites mathematics educators to consider what we value in classroom Nicholas Oppong teaching, how we engage in and write about research on or with teachers, and what features of a PhD program can inform teacher education.
    [Show full text]
  • Spatial Accessibility to Amenities in Fractal and Non Fractal Urban Patterns Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser
    Spatial accessibility to amenities in fractal and non fractal urban patterns Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser To cite this version: Cécile Tannier, Gilles Vuidel, Hélène Houot, Pierre Frankhauser. Spatial accessibility to amenities in fractal and non fractal urban patterns. Environment and Planning B: Planning and Design, SAGE Publications, 2012, 39 (5), pp.801-819. 10.1068/b37132. hal-00804263 HAL Id: hal-00804263 https://hal.archives-ouvertes.fr/hal-00804263 Submitted on 14 Jun 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. TANNIER C., VUIDEL G., HOUOT H., FRANKHAUSER P. (2012), Spatial accessibility to amenities in fractal and non fractal urban patterns, Environment and Planning B: Planning and Design, vol. 39, n°5, pp. 801-819. EPB 137-132: Spatial accessibility to amenities in fractal and non fractal urban patterns Cécile TANNIER* ([email protected]) - corresponding author Gilles VUIDEL* ([email protected]) Hélène HOUOT* ([email protected]) Pierre FRANKHAUSER* ([email protected]) * ThéMA, CNRS - University of Franche-Comté 32 rue Mégevand F-25 030 Besançon Cedex, France Tel: +33 381 66 54 81 Fax: +33 381 66 53 55 1 Spatial accessibility to amenities in fractal and non fractal urban patterns Abstract One of the challenges of urban planning and design is to come up with an optimal urban form that meets all of the environmental, social and economic expectations of sustainable urban development.
    [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]
  • 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]
  • Current Practices in Quantitative Literacy © 2006 by the Mathematical Association of America (Incorporated)
    Current Practices in Quantitative Literacy © 2006 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2005937262 Print edition ISBN: 978-0-88385-180-7 Electronic edition ISBN: 978-0-88385-978-0 Printed in the United States of America Current Printing (last digit): 10 9 8 7 6 5 4 3 2 1 Current Practices in Quantitative Literacy edited by Rick Gillman Valparaiso University Published and Distributed by The Mathematical Association of America The MAA Notes Series, started in 1982, addresses a broad range of topics and themes of interest to all who are in- volved with undergraduate mathematics. The volumes in this series are readable, informative, and useful, and help the mathematical community keep up with developments of importance to mathematics. Council on Publications Roger Nelsen, Chair Notes Editorial Board Sr. Barbara E. Reynolds, Editor Stephen B Maurer, Editor-Elect Paul E. Fishback, Associate Editor Jack Bookman Annalisa Crannell Rosalie Dance William E. Fenton Michael K. May Mark Parker Susan F. Pustejovsky Sharon C. Ross David J. Sprows Andrius Tamulis MAA Notes 14. Mathematical Writing, by Donald E. Knuth, Tracy Larrabee, and Paul M. Roberts. 16. Using Writing to Teach Mathematics, Andrew Sterrett, Editor. 17. Priming the Calculus Pump: Innovations and Resources, Committee on Calculus Reform and the First Two Years, a subcomit- tee of the Committee on the Undergraduate Program in Mathematics, Thomas W. Tucker, Editor. 18. Models for Undergraduate Research in Mathematics, Lester Senechal, Editor. 19. Visualization in Teaching and Learning Mathematics, Committee on Computers in Mathematics Education, Steve Cunningham and Walter S.
    [Show full text]
  • Fractal Image Compression, AK Peters, Wellesley, 1992
    FRACTAL STRUCTURES: IMAGE ENCODING AND COMPRESSION TECHNIQUES V. Drakopoulos Department of Computer Science and Biomedical Informatics 2 Applications • Biology • Botany • Chemistry • Computer Science (Graphics, Vision, Image Processing and Synthesis) • Geology • Mathematics • Medicine • Physics 3 Bibliography • Barnsley M. F., Fractals everywhere, 2nd ed., Academic Press Professional, San Diego, CA, 1993. • Barnsley M. F., SuperFractals, Cambridge University Press, New York, 2006. • Barnsley M. F. and Anson, L. F., The fractal transform, Jones and Bartlett Publishers, Inc, 1993. • Barnsley M. F. and Hurd L. P., Fractal image compression, AK Peters, Wellesley, 1992. • Barnsley M. F., Saupe D. and Vrscay E. R. (eds.), Fractals in multimedia, Springer- Verlag, New York, 2002. • Falconer K. J., Fractal geometry: Mathematical foundations and applications, Wiley, Chichester, 1990. • Fisher Y., Fractal image compression (ed.), Springer-Verlag, New York, 1995. • Hoggar S. G., Mathematics for computer graphics, Cambridge University Press, Cambridge, 1992. • Lu N., Fractal imaging, Academic Press, San Diego, CA, 1997. • Mandelbrot B. B., Fractals: Form, chance and dimension, W. H. Freeman, San Francisco, 1977. • Mandelbrot B. B., The fractal geometry of nature, W. H. Freeman, New York, 1982. • Massopust P. R., Fractal functions, fractal surfaces and wavelets, Academic Press, San Diego, CA, 1994. • Nikiel S., Iterated function systems for real-time image synthesis, Springer-Verlag, London, 2007. • Peitgen H.--O. and Saupe D. (eds.), The science
    [Show full text]
  • Math Morphing Proximate and Evolutionary Mechanisms
    Curriculum Units by Fellows of the Yale-New Haven Teachers Institute 2009 Volume V: Evolutionary Medicine Math Morphing Proximate and Evolutionary Mechanisms Curriculum Unit 09.05.09 by Kenneth William Spinka Introduction Background Essential Questions Lesson Plans Website Student Resources Glossary Of Terms Bibliography Appendix Introduction An important theoretical development was Nikolaas Tinbergen's distinction made originally in ethology between evolutionary and proximate mechanisms; Randolph M. Nesse and George C. Williams summarize its relevance to medicine: All biological traits need two kinds of explanation: proximate and evolutionary. The proximate explanation for a disease describes what is wrong in the bodily mechanism of individuals affected Curriculum Unit 09.05.09 1 of 27 by it. An evolutionary explanation is completely different. Instead of explaining why people are different, it explains why we are all the same in ways that leave us vulnerable to disease. Why do we all have wisdom teeth, an appendix, and cells that if triggered can rampantly multiply out of control? [1] A fractal is generally "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," a property called self-similarity. The term was coined by Beno?t Mandelbrot in 1975 and was derived from the Latin fractus meaning "broken" or "fractured." A mathematical fractal is based on an equation that undergoes iteration, a form of feedback based on recursion. http://www.kwsi.com/ynhti2009/image01.html A fractal often has the following features: 1. It has a fine structure at arbitrarily small scales.
    [Show full text]
  • Algorithms for Scientific Computing
    Algorithms for Scientific Computing Space-Filling Curves Michael Bader Technical University of Munich Summer 2017 Start: Morton Order / Cantor’s Mapping 00 01 0000 0001 0100 0101 0010 0011 0110 0111 1000 1001 1100 1101 10 11 1010 1011 1110 1111 Questions: • Can this mapping lead to a contiguous “curve”? • i.e.: Can we find a continuous mapping? • and: Can this continuous mapping fill the entire square? Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves j Summer 2017 2 Morton Order and Cantor’s Mapping Georg Cantor (1877): 0:0110 ::: 0:01111001 ::: ! 0:1101 ::: • bijective mapping [0; 1] ! [0; 1]2 • proved identical cardinality of [0; 1] and [0; 1]2 • provoked the question: is there a continuous mapping? (i.e. a curve) Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves j Summer 2017 3 History of Space-Filling Curves 1877: Georg Cantor finds a bijective mapping from the unit interval [0; 1] into the unit square [0; 1]2. 1879: Eugen Netto proves that a bijective mapping f : I ! Q ⊂ Rn can not be continuous (i.e., a curve) at the same time (as long as Q has a smooth boundary). 1886: rigorous definition of curves introduced by Camille Jordan 1890: Giuseppe Peano constructs the first space-filling curves. 1890: Hilbert gives a geometric construction of Peano’s curve; and introduces a new example – the Hilbert curve 1904: Lebesgue curve 1912: Sierpinski curve Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves j Summer 2017 4 Part I Space-Filling Curves Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves j Summer 2017 5 What is a Curve? Definition (Curve) n As a curve, we define the image f∗(I) of a continuous mapping f : I! R .
    [Show full text]