DOCSLIB.ORG

Space-Filling Curves ---~

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Space-Filling Curves ---~ GENERAL I ARTICLE Space-filling Curves ReMittal In this article some Peano curves are exhibited and some of their recent applications are dis­ cussed. A C++ program to draw the Hilbert curve approximately is given. 1. Introduction R C Mittal is an Associate A 'continuous curve' in the plane is usually defined as Professor at the Univer­ the path traced by a moving point (x (t), Y (t)) as t runs sity of Roorkee, Roorkee. He has been teaching over an interval of the real line, where x(-) and y(.) are mathematics and continuous functions. The impression that goes with computer applications for this notion is that such a curve is an one-dimensional the last 20 years. He has object in the plane. So it was an exciting event in the been a National Science history of mathematics when in 1890, the Italian math­ Talent awardee of NCERT in mathematics. ematician Peano constructed a continuous curve which passed through every point in the unit square. Examples of such 'space-filling' curves were later constructed by Hilbert (in 1891), Moore (in 1900), Lebesgue (in 1904), Sierpinski (in 1912) and Schoenberg (in 1938). These have come to be known as Peano curves. In this note, we exhibit some of these curves, give some recent ap­ plications and also give a C.++ program to draw one of these - the Hilbert curve - approximately. 2. Some Space-filling Curves Recall that two sets A and B have the same cardinality if there is a one-to-one map from A onto B. It is well­ known that when both A and B are infinite sets, A may be a proper subset of B and still have the same cardinality. In 1878, George Cantor exhibited a one-to­ one map from the unit interval I = [0,1] onto the unit square S = [0, 1] x [0, 1], thus proving that I and Shave the same cardinality. --------~-------- 26 RESONANCE I December 2000 GENERAL I ARTICLE Can we find such a map from I onto S which is also Using the triadic continuous? (If so, I and S will be topologically homeo­ expansion of the morphic, by their cOlnpactness.) E Netto answered this numbers in [0,1], question in the negative in 1879 (see [1]). It is not dif­ Peano gave n ficult to see this, using the fact that both I and S are explicit connected sets and the removal of a boulldary point from construction of a S does not make it disconnected whereas the removal of continuous map I I an interior point from makes disconnected. from [0,1] onto The next question that arises is whether a continuous [O,1J x [0,1]. map can be found which is not one-to-one but just onto. This was indeed what Peano achieved. Using the triadic expansion of the real nun1bers in I he gave an explicit construction of a continuous Inap from I onto S. For details, see [1]. An example given later by Lebesgue makes use of the standard Cantor set in I. Recall that any number t in I has a triadic expansion given by t = 00 . L ad3\ where each ai takes one of the values 0,1, or 2. i=1 The Cantor set C can be defined as 00 1 C = {t : t = L ad3 . with ai = °or 2}. i=1 C is now well known as a fractal. Another (geometric) way to arrive at C is the following: from I, first relnove the open middle one-third interval G I = (1/3,2/3) and call what remains as Fl. Thus FI = [0,1/3] U [2/3, 1J. from each of the two intervals in F I , remove their open middle one-third intervals (1/9,2/9) and (7/9,8/9) and call what is left as F2. From each of the four intervals in F2, remove their open middle one-third intervals and call what remains as F3. And so on ad infinitum. What 00 finally remains is the Cantor set C = n Fn. Lebesgue's n=l construction can now be given as follows: for tEe with 00 i t = L ad3 , define i=l x(t) = (~b2;~1) y(t) = (~~i) --------~--------RESONANCE I December 2000 27 GENERAL I ARTICLE The Cantor set and where bi = ai/2. Any t tJ. C is an interior point of one the Hilbert curve of the deleted open intervals. Define x ( .) and y ( .) as are examples of linear functions in such intervals. Lebesgue showed that t -t (x(t), y(t)) defines a Peano curve (see [1]). fractals, a topic of great interest in The Peano curve defined by Schoenberg in 1938 makes modern times. use of a periodic function on the real line. Let for o ::; t ::; 1/3 p(t) = { ~t - 1 for 1/3 ::; t ::; 2/3 for 2/3 ::; t ::; 1 and extend p ( .) to the entire real line by taking p( - t) = p(t) and p(t + 2) = p(t). Define 00 p(32k-2t) 00 p(32k-1t) x(t) = L 2k ' y(t) = L k k=l k=l 2, for each t E [0: 1]. These infinite series are uniformly convergent and hence x(·) and y(.) are continuous func­ tions. For a proof that the range of I under (x (.), yC)) is the' unit square, see [2]. This space-filling curve was shown to be nowhere differentiable by (3]. However, much of the popularity of space-filling curves is due to the geometric construction given by the great German mathematician David Hilbert in 1891. His ba­ sic idea was that if the unit interval should fill the whole of S, then one-fourth of I will fill a corresponding sub­ square of S of area 1/4 with continuity in neighbouring squares. Next, I and S can be replaced by an interval of length 1/4 and a subsquare of area 1/4, respectively, and the process can be repeated. Thus for each n ~ 1, I and S are subdivided into 4n closed subintervals and 4n closed subsquares, respectively. The first four stages are shown in F'igure 1. At each stage, the centres of the subsquares are joined by consecutive straight lines in the manner indicated in Figure 1. This procedure defines a sequence of continuous functions from I into S. Since the lengths of the sides of the subsquares tend to zero, -28---------------------------~---------------------------­ RESONANCE I December 2000 GENERAL I ARTICLE Figure 1. Fourstages of the Hi/bert curve. zero, this sequence converges uniformly to a limit func­ tion which is therefore continuous. This limit function is the Hilbert curve. It is clear that the range of this curve It may seem that is the whole of the unit square. Can you locate some space-filling curves points in the unit which have more than one pre-image are mostly an in the unit interval? academic curiosity or have The idea contained in the above construction has be­ recreational come the basis for the generation of fractals, a topic of applications, as great interest in modern times. The Cantor set as well they produce as the Hilbert curve are fractals - see the Classroom pretty pictures. Article in Resonance, Vol. 2 , No.lO, 1997. For more ex­ However, they amples of space-filling curves using the idea of fractals, became important see [4]. roots in 3. Applications of Space-filling Curves Mandelbrot's development of It may seem that space-filling curves are mostly an acad­ fractals as models emic curiosity or have recreational applications, as they of nature. produce pretty pictures. However, they became impor- -RE-S-O-N-A-N-C-E--I-D-e-ce-m-b-e-r--20-0-0----------~-----------------------------2-9 GENERAL I ARTICLE In 1991, a novel tant roots in Mandelbrot's development of fractals as digital halftoning Inodels of nature (see [5]). technique with the In nature, the organization of space-filling structures is aid of space-filling one of the fundamental building blocks of living beings. curves was An organ must be supplied with the necessary support­ introduced to ing substances such as water and oxygen. In many cases render a grey these substances will be transported through vessel sys­ scale image <?n a tems that must reach every point in the volume of the bilevel graphic organ. For example, the kidney houses three interwoven device such as a tree-like vessel systems, the arterial, the venous and the laser printer. urinary systems. Each one of them has access to every part of the kidney. 110reover (and this may come as a surprise) space-filling curves are found to have technical applications almost 100 years after their discovery. In 1991, Velho and others [6] introduced a novel digital halftoning technique useful to render a grey scale inlage on a bilevel graphic device such as a laser printer. The problem lies in the fact that a printer renders a bitmap, an array of black and white pixels, while shades of grey cannot be represented at the pixel level. To cope with this difficulty, several so called dithering techniques have been used. They are based on scanning a given grey scale image line by line or in small square blocks. A black and white approximation of the inlage is produced with the object of minimizing an overall error. Usually, there are artifacts in the re­ sult, which make it obvious that a dithering process was involved. Here space-filling curves come to our rescue. Imagine a Hilbert curve that passes through all pixels of the given grey scale ilnage.
Load more

Recommended publications
  • 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]
  • 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]
  • 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]
  • 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]
  • Peano Curves in Complex Analysis
    PEANO CURVES IN COMPLEX ANALYSIS MALIK YOUNSI Abstract. A Peano curve is a continuous function from the unit interval into the plane whose image contains a nonempty open set. In this note, we show how such space-filling curves arise naturally from Cauchy transforms in complex analysis. 1. Introduction. A Peano curve (or space-filling curve) is a continuous function f : [0, 1] → C, where C denotes the complex plane, such that f([0, 1]) contains a nonempty open set. The first example of such a curve was constructed by Peano [6] in 1890, motivated by Cantor’s proof of the fact that the unit interval and the unit square have the same cardinality. Indeed, Peano’s construction has the property that f maps [0, 1] continuously onto [0, 1] × [0, 1]. Note, however, that topological considerations prevent such a function f from being injective. One year later, in 1891, Hilbert [3] constructed another example of a space-filling curve, as a limit of piecewise-linear curves. Hilbert’s elegant geometric construction has now become quite classical and is usually taught at the undergraduate level. Figure 1. The first six steps of Hilbert’s iterative construction of a Peano curve. However, much less known is the fact that Peano curves can be obtained by the use of complex-analytic methods, more precisely, from the boundary values of certain power series defined on the unit disk. This was observed by Salem and Zygmund in 1945 in the following theorem: Date: April 6, 2018. The author is supported by NSF Grant DMS-1758295.
    [Show full text]
  • Peano- and Hilbert Curve Historical Comments
    How do they look like Hilbert's motivation - Historical comments Peano- and Hilbert curve Historical comments Jan Zeman, Pilsen, Czech Republic 22nd June 2021 Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano- and Hilbert curve How do they look like Hilbert's motivation - Historical comments Peano curve Jan Zeman,Pilsen, Czech Republic Peano-
    [Show full text]
  • Fractal Dimension and Space Filling Curve
    Fractal Dimension and Space Filling Curve Ana Karina Gomes [email protected] Instituto Superior T´ecnico,Lisboa, Portugal May 2015 Abstract Space-filling curves are computer generated fractals that can be used to index low-dimensional spaces. There are previous studies using them as an access method in these scenarios, although they are very conservative only applying them up to four-dimensional spaces. Additionally, the alternative access methods tend to present worse performance than a linear search when the spaces surpass the ten dimensions. Therefore, in the context of my thesis, I study the space-filling curves and their properties as well as challenges presented by multidimensional data. I propose their use, specifically the Hilbert curve, as an access method for indexing multidimensional points up to thirty dimensions. I start by mapping the points to the Hilbert curve generating their h-values. Then, I develop three heuristics to search for approximate nearest neighbors of a given query point with the aim of testing the performance of the curve. Two of the heuristics use the curve as a direct access method and the other uses the curve as a secondary key retrieval combined with a B-tree variant. These result from an iterative process that basically consists of planning, conceiving and testing the heuristic. According to the test results, the heuristic is adjusted or a new one is created. Experimental results with the three heuristics prove that the Hilbert curve can be used as an access method, and that it can operate at least in spaces up to thirty-six dimensions.
    [Show full text]
  • Examensarbete Fractals and Computer Graphics Meritxell
    Examensarbete Fractals and Computer Graphics Meritxell Joanpere Salvad´o LiTH - MAT - INT - A - - 2011 / 01 - - SE Fractals and Computer Graphics Applied Mathematics, Link¨opingsUniversitet Meritxell Joanpere Salvad´o LiTH - MAT - INT - A - - 2011 / 01 - - SE Examensarbete: 15 hp Level: A Supervisor: Milagros Izquierdo, Applied Mathematics, Link¨opings Universitet Examiner: Milagros Izquierdo, Applied Mathematics, Link¨opings Universitet Link¨opings: June 2011 Abstract Fractal geometry is a new branch of mathematics. This report presents the tools, methods and theory required to describe this geometry. The power of Iterated Function Systems (IFS) is introduced and applied to produce fractal images or approximate complex estructures found in nature. The focus of this thesis is on how fractal geometry can be used in applications to computer graphics or to model natural objects. Keywords: Affine Transformation, M¨obiusTransformation, Metric space, Met- ric Space of Fractals, IFS, Attractor, Collage Theorem, Fractal Dimension and Fractal Tops. Joanpere Salvad´o,2011. v vi Acknowledgements I would like to thank my supervisor and examiner Milagros Izquierdo, at the division of applied mathematics, for giving me the opportunity to write my final degree thesis about Fractals, and for her excellent guidance and her constant feedback. I also have to thank Aitor Villarreal for helping me with the LATEX language and for his support over these months. Finally, I would like to thank my family for their interest and support. Joanpere Salvad´o,2011. vii viii Nomenclature Most of the reoccurring abbreviations and symbols are described here. Symbols d Metric (X; d) Metric space dH Hausdorff metric (H(X); dH) Space of fractals Ω Code space σ Code A Alphabet l Contractivity factor fn Contraction mappings pn Probabilities N Cardinality (of an IFS) F IFS A Attractor of the IFS D Fractal dimension φ, ' Adress function Abbreviations IFS Iterated function system.
    [Show full text]
  • Algorithms for Scientific Computing
    Algorithms for Scientific Computing Space-Filling Curves in 2D and 3D Michael Bader Technical University of Munich Summer 2016 Classification of Space-filling Curves Definition: (recursive space-filling curve) A space-filling curve f : I ! Q ⊂ Rn is called recursive, if both I and Q can be divided in m subintervals and sudomains, such that (µ) (µ) • f∗(I ) = Q for all µ = 1;:::; m, and • all Q(µ) are geometrically similar to Q. Definition: (connected space-filling curve) A recursive space-filling curve is called connected, if for any two neighbouring intervals I(ν) and I(µ) also the corresponding subdomains Q(ν) and Q(µ) are direct neighbours, i.e. share an (n − 1)-dimensional hyperplane. Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves in 2D and 3D j Summer 2016 2 Connected, Recursive Space-filling Curves Examples: • all Hilbert curves (2D, 3D, . ) • all Peano curves Properties: connected, recursive SFC are • continuous (more exact: Holder¨ continuous with exponent 1=n) • neighbourship-preserving • describable by a grammar • describable in an arithmetic form (similar to that of the Hilbert curve) Related terms: • face-connected, edge-connected, node-connected, . • also used for the induced orders on grid cells, etc. Michael Bader j Algorithms for Scientific Computing j Space-Filling Curves in 2D and 3D j Summer 2016 3 Approximating Polygons of the Hilbert Curve Idea: Connect start and end point of iterate on each subcell. Definition: The straight connection of the 4n + 1 points h(0); h(1 · 4−n); h(2 · 4−n);:::; h((4n − 1)
    [Show full text]