Box Counting Dimensions of Generalised Fractal Nests

Total Page:16

File Type:pdf, Size:1020Kb

Box Counting Dimensions of Generalised Fractal Nests Box counting dimensions of generalised fractal nests Siniˇsa Miliˇci´c∗ Juraj Dobrila University of Pula Faculty of Informatics 52 100 Pula, Croatia September 15, 2018 Abstract spect to the appropriate exponents. There are two general types of behaviour of fractal nests. The Fractal nests are sets defined as unions of unit n- well understood type of behaviour of fractal nests − spheres scaled by a sequence of k α for some α> 0. concerns sets that locally resemble Cartesian prod- In this article we generalise the concept to sub- ucts of fractals [LRZ17ˇ , pg. 227], [ZˇZ05ˇ , Remark sets of such spheres and find the formulas for their 6.]. In such sets, the dimension behaves naturally box counting dimensions. We introduce some novel as the sum of the dimensions of “base” sets. What classes of parameterised fractal nests and apply remains less understood are dimensions of fractal these results to compute the dimensions with re- nests of centre type. In this case, the dimension is spect to these parameters. We also show that these product-like in terms of dimensions of underlying dimensions can be seen numerically. These results elements, lacking an intuitive geometric interpreta- motivate further research that may explain the un- tion. intuitive behaviour of box counting dimensions for This article focuses on a more classical approach nest-type fractals, and in general the class of sets to the box-counting dimension, giving examples where the box-counting dimension differs from the that may further the understanding of how the box Hausdorff dimension. counting dimension behaves with respect to count- able unions of similar sets. Whereas in [LRZ17ˇ ] and [ZˇZ05ˇ ] the fractal nests studied are based on (n 1)- − 1 Introduction spheres (hyper-spheres), we study fractal nests Sα based on fractal subsets of box counting dimension Research into rectifiability (eg. [Tri93]) has given δ of such spheres under similar scaling. Our results some unexpected results in the differences between are compatible with the cited ones, having them as the Hausdorff dimension [Fed69, pg. 171] and the limit cases of full dimension, δ = (n 1); notably, box counting dimension of some countable unions the dimension are − of sets and their smooth generalisations [Tri93, pg. δ +1 arXiv:1802.00870v1 [math.MG] 2 Feb 2018 121-122], such as unrectifiable spirals. Recently, dimB Sα = progress has been made in the application of the α +1 box counting dimension in the analysis of complex for the centre type and zeta functions, [LRZ17ˇ ]. We note especially the dis- covery of various interesting properties, including 1 dim S = δ + a relationship of Lapidus-style zeta functions with B α α +1 the Riemann zeta function and the generalisation of the concept of the box dimension to complex di- for the outer type. The proofs of these results hint mensions. Fractal nests, as presented and analysed at some more general geometric and topological in [LRZ17ˇ ], behave in an unexpected way with re- properties. This paper is divided into five sections. After ∗[email protected] this introduction we present the main concepts and 1 results of this paper – a dimensional analysis of in the ambient space and constructs a natural “con- generalised fractal nests, followed by applications tents” function at every dimension, in that regard of these results to novel fractal sets with numerical similar to the Hausdorff dimension and measure. examples. After that, we provide the proofs of our As ǫ-balls used here and in other literature cor- main results and in the final section we remark on respond to the Euclidean metric, we need to com- some issues and problems that naturally arise from pensate for the coefficient for volume of the ball these investigations. characteristic to this metric and dimension, x π 2 γx = x . 2 Generalised fractal nests Γ( 2 + 1) 2.1 Box counting dimension For further discussion of this coefficient and its use in the Minkowski-Bouligand dimension, see [Res13] We start with the definition of the box counting di- and [KP99, Chapter 3.3]. mension as stated in [Fal14, pg. 28] as the alterna- tive definition. By an ǫ-mesh in Rn we understand Definition 2. Let S Rn. For ǫ > 0, we define ⊆ the partition of Rn into disjoint (except possibly at the ǫ-Minkowski sausage of S as the set the border) n-cubes of side ǫ. n (S)ǫ = x R d(x, S) ǫ . Definition 1. Let S Rn be a bounded Borel set. { ∈ | ≤ } ⊆ Rn By Nǫ(S) we denote the number of such n-cubes of Let λ be the Lebesgue measure on and denote n n,d the ǫ-mesh of R that intersect S. We define the by Aǫ (S) the ratio upper (lower) box counting dimension of S by n,δ λ(S)ǫ Aǫ (S) := n−δ . γn−δǫ dim S = inf δ ǫδN (S) 0 . B ǫ → We say that d is the upper (lower) Min- n o δ kowski-Bouligand dimension of S, dimMB S dimBS = sup δ ǫ Nǫ(S) + . → ∞ (dimMB S) if n o m n,δ Example 1. The unit m-cube Km = [0, 1] d = inf δ lim Aǫ (S)=+ 0 n−m in Rn with m n has × ǫ→0 ∞ n o { } ≤ n,δ d = sup δ lim Aǫ (S)=0 . ǫ→0 dimBKm = dimBKm = m n o m because it intersects ǫ−1 n-cubes of side ǫ. A classical result (eg. [Pes97, Ch. I.2], [Fal14, Hence, for various δ we have, as ǫ 0, Prop. 2.4]) is that both upper and lower Minkow- → ski-Bouligand dimensions are exactly equal to the 0, for δ > m, corresponding upper and lower box counting di- − m ǫδ ǫ 1 1, for δ = m, mensions, so we will only use the box-dimension → notation for the discussed dimension. + , for δ < m. ∞ Rn Definition 3. For S , if dimBS = dimBS = The box counting dimension of a set S can be de- d, we say that S is of⊆ box counting dimension d, fined in terms of other counting functions, such as denoting the maximum number of disjoint ǫ-balls centred on dimB S = d. points of S, the minimal number of ǫ-balls needed to cover S, similar constructions in equivalent met- For S of box-dimension d, we define the nor- rics, etc. [Fal14, pg. 30]. malised upper (lower) Minkowski content of One important reformulation of the box counting S as dimension is the Minkowski-Bouligand dimension. ∗ n,d d(S) = lim sup Aǫ (S), It is formulated in terms of the Lebesgue measure M ǫ→0 2 Figure 1: The Minkowski sausage of the unit square in R2. n,d ∗d(S) = lim inf Aǫ (S)) . M ǫ→0 We say that the set S Rn of box-dimension d is Minkowski-non-degenerate⊆ if ∗(S) < + Md ∞ and ∗ (S) > 0 and denote M d Figure 2: Sets Eα of unit normalised Minkowski dimB S d. ≡ contents for α 0.2, 0.4,..., 5.0 . ∈{ } Example 2. As per the earlier discussion in Ex- ample 1, it is easy to show that K Rn is of nor- m ⊆ 2.2 Fractal analysis of α-regular gen- malised Minkowski content (both upper and lower) eralised fractal nests equal to 1 because Intuitively, an inner α-regular fractal nest is the −1 −α m m−k subset of the union of circles of radii n where λ(Km)ǫ ǫ (k) = γ − + γ − E , ǫn−m n m n k 2 m subsets per individual circle are homothetic to each kX=0 other. The outer α-regular fractal nest has radii of form 1 (k + 1)−α. (k) − where Em is the number of k-edges of the m-cube. For a set S Rn and x 0 we denote by (x)S (0) (1) ⊆ ≥ In Figure 1, we have E2 =4 and E2 =4 and the scaling of the set S by x. γ0 = 1, γ1 = 2 and γ2 = π, so we have λ(K2)ǫ = n−1 2 Definition 4. Let S S be a Borel subset of ǫ (1) ǫ (0) 2 ⊆ γ0 + 2 γ1E2 + 4 γ2E2 =1+4ǫ + πǫ . the unit sphere in Rn. We define the α-regular −α fractal nest of centre (outer) type as Example 3. The set of points Eα = k k N for α > 0 is of box counting dimension{ 1| ,∈ with} ∞ 1+α S = (k−α)S normalised Minkowski contents (both upper and Fα k=1 lower) equal to [∞ −α α αS = (1 k )S . 2 α+1 α O − S = (α +1)Γ +1 . k=1 Md α√π 2(α + 1) [ Note that α 1 = Eα Figure 2 shows sets Eα of unit normalised Min- F { } kowski contents in dimensions ranging from 5/6 at and the bottom to 1/6 in the top row. 1 =1 E , Oα{ } − α 3 where for a set S the expression 1 S is defined as sin x sin x sin x − ) − 1 2 ··· n 1 1 x x S , with Eα defined in Example 3. { − | ∈ } is bi-Lipschitz. Theorem 1. Let S Sn−1 be a Borel subset of Thus, any subset of the unit hyper-cube can be ⊆ the unit hyper-sphere in Rn such that mapped to a corresponding set of equal dimension on the hyper-sphere. If we identify Km with its dimB S δ 0. Sn−1 ≡ ≥ embedding into , applying Theorem 1 we have that For every α> 0 the α-regular fractal nest of centre m +1 type generated by S has dimB αKm = . F α +1 δ+1 , for αδ < 1, We note that this formula also applies to m = 0.
Recommended publications
  • Review On: Fractal Antenna Design Geometries and Its Applications
    www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume - 3 Issue -9 September, 2014 Page No. 8270-8275 Review On: Fractal Antenna Design Geometries and Its Applications Ankita Tiwari1, Dr. Munish Rattan2, Isha Gupta3 1GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] 2GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] 3GNDEC University, Department of Electronics and Communication Engineering, Gill Road, Ludhiana 141001, India [email protected] Abstract: In this review paper, we provide a comprehensive review of developments in the field of fractal antenna engineering. First we give brief introduction about fractal antennas and then proceed with its design geometries along with its applications in different fields. It will be shown how to quantify the space filling abilities of fractal geometries, and how this correlates with miniaturization of fractal antennas. Keywords – Fractals, self -similar, space filling, multiband 1. Introduction Modern telecommunication systems require antennas with irrespective of various extremely irregular curves or shapes wider bandwidths and smaller dimensions as compared to the that repeat themselves at any scale on which they are conventional antennas. This was beginning of antenna research examined. in various directions; use of fractal shaped antenna elements was one of them. Some of these geometries have been The term “Fractal” means linguistically “broken” or particularly useful in reducing the size of the antenna, while “fractured” from the Latin “fractus.” The term was coined by others exhibit multi-band characteristics. Several antenna Benoit Mandelbrot, a French mathematician about 20 years configurations based on fractal geometries have been reported ago in his book “The fractal geometry of Nature” [5].
    [Show full text]
  • Turbulence, Fractals, and Mixing
    Turbulence, fractals, and mixing Paul E. Dimotakis and Haris J. Catrakis GALCIT Report FM97-1 17 January 1997 Firestone Flight Sciences Laboratory Guggenheim Aeronautical Laboratory Karman Laboratory of Fluid Mechanics and Jet Propulsion Pasadena Turbulence, fractals, and mixing* Paul E. Dimotakis and Haris J. Catrakis Graduate Aeronautical Laboratories California Institute of Technology Pasadena, California 91125 Abstract Proposals and experimenta1 evidence, from both numerical simulations and laboratory experiments, regarding the behavior of level sets in turbulent flows are reviewed. Isoscalar surfaces in turbulent flows, at least in liquid-phase turbulent jets, where extensive experiments have been undertaken, appear to have a geom- etry that is more complex than (constant-D) fractal. Their description requires an extension of the original, scale-invariant, fractal framework that can be cast in terms of a variable (scale-dependent) coverage dimension, Dd(X). The extension to a scale-dependent framework allows level-set coverage statistics to be related to other quantities of interest. In addition to the pdf of point-spacings (in 1-D), it can be related to the scale-dependent surface-to-volume (perimeter-to-area in 2-D) ratio, as well as the distribution of distances to the level set. The application of this framework to the study of turbulent -jet mixing indicates that isoscalar geometric measures are both threshold and Reynolds-number dependent. As regards mixing, the analysis facilitated by the new tools, as well as by other criteria, indicates en- hanced mixing with increasing Reynolds number, at least for the range of Reynolds numbers investigated. This results in a progressively less-complex level-set geom- etry, at least in liquid-phase turbulent jets, with increasing Reynolds number.
    [Show full text]
  • Fractal Geometry and Applications in Forest Science
    ACKNOWLEDGMENTS Egolfs V. Bakuzis, Professor Emeritus at the University of Minnesota, College of Natural Resources, collected most of the information upon which this review is based. We express our sincere appreciation for his investment of time and energy in collecting these articles and books, in organizing the diverse material collected, and in sacrificing his personal research time to have weekly meetings with one of us (N.L.) to discuss the relevance and importance of each refer- enced paper and many not included here. Besides his interdisciplinary ap- proach to the scientific literature, his extensive knowledge of forest ecosystems and his early interest in nonlinear dynamics have helped us greatly. We express appreciation to Kevin Nimerfro for generating Diagrams 1, 3, 4, 5, and the cover using the programming package Mathematica. Craig Loehle and Boris Zeide provided review comments that significantly improved the paper. Funded by cooperative agreement #23-91-21, USDA Forest Service, North Central Forest Experiment Station, St. Paul, Minnesota. Yg._. t NAVE A THREE--PART QUE_.gTION,, F_-ACHPARToF:WHICH HA# "THREEPAP,T_.<.,EACFi PART" Of:: F_.AC.HPART oF wHIct4 HA.5 __ "1t4REE MORE PARTS... t_! c_4a EL o. EP-.ACTAL G EOPAgTI_YCoh_FERENCE I G;:_.4-A.-Ti_E AT THB Reprinted courtesy of Omni magazine, June 1994. VoL 16, No. 9. CONTENTS i_ Introduction ....................................................................................................... I 2° Description of Fractals ....................................................................................
    [Show full text]
  • Fractal-Based Methods As a Technique for Estimating the Intrinsic Dimensionality of High-Dimensional Data: a Survey
    INFORMATICA, 2016, Vol. 27, No. 2, 257–281 257 2016 Vilnius University DOI: http://dx.doi.org/10.15388/Informatica.2016.84 Fractal-Based Methods as a Technique for Estimating the Intrinsic Dimensionality of High-Dimensional Data: A Survey Rasa KARBAUSKAITE˙ ∗, Gintautas DZEMYDA Institute of Mathematics and Informatics, Vilnius University Akademijos 4, LT-08663, Vilnius, Lithuania e-mail: [email protected], [email protected] Received: December 2015; accepted: April 2016 Abstract. The estimation of intrinsic dimensionality of high-dimensional data still remains a chal- lenging issue. Various approaches to interpret and estimate the intrinsic dimensionality are deve- loped. Referring to the following two classifications of estimators of the intrinsic dimensionality – local/global estimators and projection techniques/geometric approaches – we focus on the fractal- based methods that are assigned to the global estimators and geometric approaches. The compu- tational aspects of estimating the intrinsic dimensionality of high-dimensional data are the core issue in this paper. The advantages and disadvantages of the fractal-based methods are disclosed and applications of these methods are presented briefly. Key words: high-dimensional data, intrinsic dimensionality, topological dimension, fractal dimension, fractal-based methods, box-counting dimension, information dimension, correlation dimension, packing dimension. 1. Introduction In real applications, we confront with data that are of a very high dimensionality. For ex- ample, in image analysis, each image is described by a large number of pixels of different colour. The analysis of DNA microarray data (Kriukien˙e et al., 2013) deals with a high dimensionality, too. The analysis of high-dimensional data is usually challenging.
    [Show full text]
  • Classical Math Fractals in Postscript Fractal Geometry I
    Kees van der Laan VOORJAAR 2013 49 Classical Math Fractals in PostScript Fractal Geometry I Abstract Classical mathematical fractals in BASIC are explained and converted into mean-and-lean EPSF defs, of which the .eps pictures are delivered in .pdf format and cropped to the prescribed BoundingBox when processed by Acrobat Pro, to be included easily in pdf(La)TEX, Word, … documents. The EPSF fractals are transcriptions of the Turtle Graphics BASIC codes or pro- grammed anew, recursively, based on the production rules of oriented objects. The Linden- mayer production rules are enriched by PostScript concepts. Experience gained in converting a TEX script into WYSIWYG Word is communicated. Keywords Acrobat Pro, Adobe, art, attractor, backtracking, BASIC, Cantor Dust, C curve, dragon curve, EPSF, FIFO, fractal, fractal dimension, fractal geometry, Game of Life, Hilbert curve, IDE (In- tegrated development Environment), IFS (Iterated Function System), infinity, kronkel (twist), Lauwerier, Lévy, LIFO, Lindenmayer, minimal encapsulated PostScript, minimal plain TeX, Minkowski, Monte Carlo, Photoshop, production rule, PSlib, self-similarity, Sierpiński (island, carpet), Star fractals, TACP,TEXworks, Turtle Graphics, (adaptable) user space, von Koch (island), Word Contents - Introduction - Lévy (Properties, PostScript program, Run the program, Turtle Graphics) Cantor - Lindenmayer enriched by PostScript concepts for the Lévy fractal 0 - von Koch (Properties, PostScript def, Turtle Graphics, von Koch island) Cantor1 - Lindenmayer enriched by PostScript concepts for the von Koch fractal Cantor2 - Kronkel Cantor - Minkowski 3 - Dragon figures - Stars - Game of Life - Annotated References - Conclusions (TEX mark up, Conversion into Word) - Acknowledgements (IDE) - Appendix: Fractal Dimension - Appendix: Cantor Dust Peano curves: order 1, 2, 3 - Appendix: Hilbert Curve - Appendix: Sierpiński islands Introduction My late professor Hans Lauwerier published nice, inspiring booklets about fractals with programs in BASIC.
    [Show full text]
  • Irena Ivancic Fraktalna Geometrija I Teorija Dimenzije
    SveuˇcilišteJ.J. Strossmayera u Osijeku Odjel za matematiku Sveuˇcilišninastavniˇckistudij matematike i informatike Irena Ivanˇci´c Fraktalna geometrija i teorija dimenzije Diplomski rad Osijek, 2019. SveuˇcilišteJ.J. Strossmayera u Osijeku Odjel za matematiku Sveuˇcilišninastavniˇckistudij matematike i informatike Irena Ivanˇci´c Fraktalna geometrija i teorija dimenzije Diplomski rad Mentor: izv. prof. dr. sc. Tomislav Maroševi´c Osijek, 2019. Sadržaj 1 Uvod 3 2 Povijest fraktala- pojava ˇcudovišnih funkcija 4 2.1 Krivulje koje popunjavaju ravninu . 5 2.1.1 Peanova krivulja . 5 2.1.2 Hilbertova krivulja . 5 2.1.3 Drugi primjeri krivulja koje popunjavaju prostor . 6 3 Karakterizacija 7 3.1 Fraktali su hrapavi . 7 3.2 Fraktali su sami sebi sliˇcnii beskonaˇcnokompleksni . 7 4 Podjela fraktala prema stupnju samosliˇcnosti 8 5 Podjela fraktala prema naˇcinukonstrukcije 9 5.1 Fraktali nastali iteracijom generatora . 9 5.1.1 Cantorov skup . 9 5.1.2 Trokut i tepih Sierpi´nskog. 10 5.1.3 Mengerova spužva . 11 5.1.4 Kochova pahulja . 11 5.2 Kochove plohe . 12 5.2.1 Pitagorino stablo . 12 5.3 Sustav iteriranih funkcija (IFS) . 13 5.3.1 Lindenmayer sustavi . 16 5.4 Fraktali nastali iteriranjem funkcije . 17 5.4.1 Mandelbrotov skup . 17 5.4.2 Julijevi skupovi . 20 5.4.3 Cudniˇ atraktori . 22 6 Fraktalna dimenzija 23 6.1 Zahtjevi za dobru definiciju dimenzije . 23 6.2 Dimenzija šestara . 24 6.3 Dimenzija samosliˇcnosti . 27 6.4 Box-counting dimenzija . 28 6.5 Hausdorffova dimenzija . 28 6.6 Veza izmedu¯ dimenzija . 30 7 Primjena fraktala i teorije dimenzije 31 7.1 Fraktalna priroda geografskih fenomena .
    [Show full text]
  • Exploring the Effect of Direction on Vector-Based Fractals
    Exploring the Effect of Direction on Vector-Based Fractals Magdy Ibrahim and Robert J. Krawczyk College of Architecture Illinois Institute of Technology 3360 S. State St. Chicago, IL, 60616, USA Email: [email protected], [email protected] Abstract This paper investigates an approach to begin the study of fractals in architectural design. Vector-based fractals are studied to determine if the modification of vector direction in either the generator or the initiator will develop alternate fractal forms. The Koch Snowflake is used as the demonstrating fractal. Introduction A fractal is an object or quantity that displays self-similarity on all scales. The object need not exhibit exactly the same structure at all scales, but the same “type” of structures must appear on all scales [7]. Fractals were first discussed by Mandelbrot in the 1970s [4], but the idea was identified as early as 1925. Fractals have been investigated for their visual qualities as art, their relationship to explain natural processes, music, medicine, and in mathematics [5]. Javier Barrallo classified fractals [2] into six main groups depending on their type: 1. Fractals derived from standard geometry by using iterative transformations on an initial common figure. 2. IFS (Iterated Function Systems), this is a type of fractal introduced by Michael Barnsley. 3. Strange attractors. 4. Plasma fractals. Created with techniques like fractional Brownian motion. 5. L-Systems, also called Lindenmayer systems, were not invented to create fractals but to model cellular growth and interactions. 6. Fractals created by the iteration of complex polynomials. From the mathematical point of view, we can classify fractals into three major categories.
    [Show full text]
  • Measuring Fractal Dimension
    MEASURING FRACTALFRACTAL DIMENSION:DIMENSION: MORPHOLOGICAL ESTIMATES AND ITERATIVE OPTIMIZATIONOPTIMIZATION Petros MaragosMaragos and FangFang-Kuo -Kuo Sun Division of Applied SciencesSciences The AnalyticAnalytic SciencesSciences Corp. Harvard UniversityUniversity 55 Walkers Brook Drive Cambridge, MAMA 0213802138 Reading, MAMA 0186701867 Abstract An important characteristiccharacteristic of fractal signals isis theirtheir fractal dimension. For arbitrary fractals, an efficient approachapproach to to evaluateevaluate theirtheir fractal dimension isis thethe covering method.method. In thisthis paperpaper wewe unifyunify many of thethe current implementations ofof covering methodsmethods by usingusing morphologicalmorphological operations operations withwith varyingvarying structuring elements. Further, in the casecase of parametric fractalsfractals dependingdepending on on a a parameterparameter thatthat is in oneone-to-one -to -one correspondence correspondence with with their their fractal fractal dimension,dimension, we we develop develop an an optimizationoptimization method,method, which starts fromfrom anan initialinitial estimateestimate andand by by iteratively iteratively minimizing minimizing aa distancedistance betweenbetween thethe originaloriginal functionfunction and the classclass of all suchsuch functions,functions, spanningspanning thethe quantizedquantized parameterparameter space,space, convergesconverges to to the the truetrue fractalfractal dimension. 1 Introduction Fractals are mathematical setssets withwith aa highhigh
    [Show full text]
  • Paul S. Addison
    Page 1 Chapter 1— Introduction 1.1— Introduction The twin subjects of fractal geometry and chaotic dynamics have been behind an enormous change in the way scientists and engineers perceive, and subsequently model, the world in which we live. Chemists, biologists, physicists, physiologists, geologists, economists, and engineers (mechanical, electrical, chemical, civil, aeronautical etc) have all used methods developed in both fractal geometry and chaotic dynamics to explain a multitude of diverse physical phenomena: from trees to turbulence, cities to cracks, music to moon craters, measles epidemics, and much more. Many of the ideas within fractal geometry and chaotic dynamics have been in existence for a long time, however, it took the arrival of the computer, with its capacity to accurately and quickly carry out large repetitive calculations, to provide the tool necessary for the in-depth exploration of these subject areas. In recent years, the explosion of interest in fractals and chaos has essentially ridden on the back of advances in computer development. The objective of this book is to provide an elementary introduction to both fractal geometry and chaotic dynamics. The book is split into approximately two halves: the first—chapters 2–4—deals with fractal geometry and its applications, while the second—chapters 5–7—deals with chaotic dynamics. Many of the methods developed in the first half of the book, where we cover fractal geometry, will be used in the characterization (and comprehension) of the chaotic dynamical systems encountered in the second half of the book. In the rest of this chapter brief introductions to fractal geometry and chaotic dynamics are given, providing an insight to the topics covered in subsequent chapters of the book.
    [Show full text]
  • Ontologia De Domínio Fractal
    MÉTODOS COMPUTACIONAIS PARA A CONSTRUÇÃO DA ONTOLOGIA DE DOMÍNIO FRACTAL Ivo Wolff Gersberg Dissertação de Mestrado apresentada ao Programa de Pós-graduação em Engenharia Civil, COPPE, da Universidade Federal do Rio de Janeiro, como parte dos requisitos necessários à obtenção do título de Mestre em Engenharia Civil. Orientadores: Nelson Francisco Favilla Ebecken Luiz Bevilacqua Rio de Janeiro Agosto de 2011 MÉTODOS COMPUTACIONAIS PARA CONSTRUÇÃO DA ONTOLOGIA DE DOMÍNIO FRACTAL Ivo Wolff Gersberg DISSERTAÇÃO SUBMETIDA AO CORPO DOCENTE DO INSTITUTO ALBERTO LUIZ COIMBRA DE PÓS-GRADUAÇÃO E PESQUISA DE ENGENHARIA (COPPE) DA UNIVERSIDADE FEDERAL DO RIO DE JANEIRO COMO PARTE DOS REQUISITOS NECESSÁRIOS PARA A OBTENÇÃO DO GRAU DE MESTRE EM CIÊNCIAS EM ENGENHARIA CIVIL. Examinada por: ________________________________________________ Prof. Nelson Francisco Favilla Ebecken, D.Sc. ________________________________________________ Prof. Luiz Bevilacqua, Ph.D. ________________________________________________ Prof. Marta Lima de Queirós Mattoso, D.Sc. ________________________________________________ Prof. Fernanda Araújo Baião, D.Sc. RIO DE JANEIRO, RJ - BRASIL AGOSTO DE 2011 Gersberg, Ivo Wolff Métodos computacionais para a construção da Ontologia de Domínio Fractal/ Ivo Wolff Gersberg. – Rio de Janeiro: UFRJ/COPPE, 2011. XIII, 144 p.: il.; 29,7 cm. Orientador: Nelson Francisco Favilla Ebecken Luiz Bevilacqua Dissertação (mestrado) – UFRJ/ COPPE/ Programa de Engenharia Civil, 2011. Referências Bibliográficas: p. 130-133. 1. Ontologias. 2. Mineração de Textos. 3. Fractal. 4. Metodologia para Construção de Ontologias de Domínio. I. Ebecken, Nelson Francisco Favilla et al . II. Universidade Federal do Rio de Janeiro, COPPE, Programa de Engenharia Civil. III. Titulo. iii À minha mãe e meu pai, Basia e Jayme Gersberg. iv AGRADECIMENTOS Agradeço aos meus orientadores, professores Nelson Ebecken e Luiz Bevilacqua, pelo incentivo e paciência.
    [Show full text]
  • Exploring the Effect of Direction on Vector-Based Fractals
    BRIDGES Mathematical Connections in Art, Music, and Science Exploring the Effect of Direction on Vector-Based Fractals Magdy Ibrahim and Robert J. Krawczyk College of Architecture Dlinois Institute of Technology 3360 S. State St. Chicago, lL, 60616, USA Email: [email protected], [email protected] Abstract This paper investigates an approach to begin the study of fractals in architectural design. Vector-based fractals are studied to determine if the modification of vector direction in either the generator or the initiator will develop alternate fractal forms. The Koch Snowflake is used as the demonstrating fractal. Introduction A fractal is an object or quantity that displays self-similarity on all scales. The object need not exhibit exactly the same structure at all scales, but the same "type" of structures must appear on all scales [7]. Fractals were first discussed by Mandelbrot in the 1970s [4], but the idea was identified as early as 1925. Fractals have been investigated for their visual qualities as art, their relationship to explain natural processes, music, medicine, and in mathematics [5]. Javier Barrallo classified fractals [2] into six main groups depending on their type: 1. Fractals derived from standard geometry by using iterative transformations on an initial common figure. 2. IFS (Iterated Function Systems), this is a type of fractal introduced by Michael Barnsley. 3. Strange attractors. 4. Plasma fractals. Created with techniques like fractional Brownian motion. 5. L-Systems, also called Lindenmayer systems, were not invented to create fractals but to model cellular growth and interactions. 6. Fractals created by the iteration of complex polynomials. From the mathematical point of view, we can classify fractals into three major categories.
    [Show full text]
  • Working with Fractals a Resource for Practitioners of Biophilic Design
    WORKING WITH FRACTALS A RESOURCE FOR PRACTITIONERS OF BIOPHILIC DESIGN A PROJECT OF THE EUROPEAN ‘COST RESTORE ACTION’ PREPARED BY RITA TROMBIN IN COLLABORATION WITH ACKNOWLEDGEMENTS This toolkit is the result of a joint effort between Terrapin Bright Green, Cost RESTORE Action (REthinking Sustainability TOwards a Regenerative Economy), EURAC Research, International Living Future Institute, Living Future Europe and many other partners, including industry professionals and academics. AUTHOR Rita Trombin SUPERVISOR & EDITOR Catherine O. Ryan CONTRIBUTORS Belal Abboushi, Pacific Northwest National Laboratory (PNNL) Luca Baraldo, COOKFOX Architects DCP Bethany Borel, COOKFOX Architects DCP Bill Browning, Terrapin Bright Green Judith Heerwagen, University of Washington Giammarco Nalin, Goethe Universität Kari Pei, Interface Nikos Salingaros, University of Texas at San Antonio Catherine Stolarski, Catherine Stolarski Design Richard Taylor, University of Oregon Dakota Walker, Terrapin Bright Green Emily Winer, International Well Building Institute CITATION Rita Trombin, ‘Working with fractals: a resource for practitioners of biophilic design’. Report, Terrapin Bright Green: New York, 31 December 2020. Revised January 2021 © 2020 Terrapin Bright Green LLC For inquiries: [email protected] or [email protected] COVER DESIGN: Catherine O. Ryan COVER IMAGES: Ice crystals (snow-603675) by Quartzla from Pixabay; fractal gasket snowflake by Catherine Stolarski Design. 2 Working with Fractals: A Toolkit © 2020 Terrapin Bright Green LLC OVERVIEW The unique trademark of nature to make complexity comprehensible is underpinned by fractal patterns – self-similar patterns over a range of magnification scales – that apply to virtually any domain of life. For the design of built environment, fractal patterns may present opportunities to positively impact human perception, health, cognitive performance, emotions and stress.
    [Show full text]