DOCSLIB.ORG

Escape-Time Visualization Method for Language-Restricted Iterated

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Escape-Time Visualization Method for Language-Restricted Iterated Escap e-time Visualization Metho d for Language-restricted Iterated Function Systems Przemyslaw Prusinkiewicz and Mark Hammel Department of Computer Science University of Calgary Calgary, Alb erta, Canada T2N 1N4 e-mail: [email protected] From Proceeding of Graphics Interface '92, pages 213{223, May 1992 Held in Vancouver, British Columbia, 11{15 May 1992 Escap e-time Visualization Metho d for Language-restricted Iterated Function Systems Przemyslaw Prusinkiewicz Mark S. Hammel Department of Computer Science University of Calgary Calgary, Alb erta, Canada T2N 1N4 Abstract tends it further to language-restricted iterated function systems, intro duced in [16 ]. They generalize the origi- The escap e-time metho d was intro duced to generate im- nal de nition of IFS's by providing means for restrict- ages of Julia and Mandelbrot sets, then applied to visu- ing the sequences of applicable transformations to a par- alize attractors of iterated function systems. This pap er ticular set. The resulting attractors form a larger class extends it further to language-restricted iterated function than those generated using ordinary IFS's. The de ni- systems (LRIFS's). They generalize the original de ni- tion of an LRIFS leaves op en the mechanism for sequenc- tion of IFS's byproviding means for restricting the se- ing transformations, thus LRIFS's incorp orate the ear- quences of applicable transformations. The resulting at- lier generalizations committed to a particular mechanism, tractors include sets that cannot b e generated using or- such as hierarchical IFS's [4 ], so c systems [1 ], recurrent dinary IFS's. The concepts of this pap er are expressed IFS's [3 ], Markov IFS's [21 ], mixed IFS's [5 ], controlled using the terminology of formal languages and nite au- IFS's [17 ], and mutually recursive function systems [7, 8]. tomata. Several other authors considered similar generalizations without giving them a name. Visualization of the attrac- tors of generalized IFS's has b een addressed by Hart [9], Keywords: fractal, iterated function system, escap e- referring to his earlier results with DeFanti [10 ]. time metho d, graphics algorithm, formal language, nite This pap er is organized as follows. Sections 2 and 3 sum- automaton. marize the background material related to formal lan- guages and iterated function systems. Section 4 presents the escap e-time metho d for IFS's in a way suitable 1. Intro duction for further extensions. Section 5 de nes the language- restricted iterated function systems. The escap e-time Although mathematicians have explored the prop erties metho d is extended to LRIFS's in Section 6. A sp ecial of fractals since the turn of century, they could not visu- case of regular languages is considered and illustrated alize the ob jects of their study without the aid of comput- using examples in Section 7. Section 8 summarizes the ers. Computer graphics made it p ossible to recognize the results. b eauty of fractals, and turned them into an art form [13 ]. Peitgen and Richter [14 ] p erfected and p opularized im- ages of Julia and Mandelbrot sets. Manyofthemwere created using the escap e-time metho d. In its original 2. Formal languages setting, it consisted of testing how fast p oints z outside the attractor divergedtoin nity while iterating function An alphabet V is as a nite nonemptysetof symbols or 2 z ! z + c in the complex plane. The resulting values letters. A string or word over alphab et V is a nite se- were interpreted as colors in a two-dimensional image, or quence of zero or more letters of V , whereby the same let- heightvalues in a \fractal landscap e" [15 , Section 2.7]. ter may o ccur several times. The total numb er of letters The escap e-time visualization metho d was extended from in a word w is called its length, and denoted length(w ). Julia sets to iterated function systems [12 ] by Barnsley [2 ] The word of zero length is called the empty word and and Prusinkiewicz and Sandness [18 ]. This pap er ex- denoted . The concatenation of words x = a a :::a 1 2 m In the literature, an IFS is usually de ned as the pair and y = b b :::b is the word formed by extending 1 2 n hX; Fi. We extend this de nition by sp ecifying the al- the sequence of symbols x with the sequence y , thus phab et V and the lab eling function h to facilitate the xy = a a :::a b b :::b . If xy = w then the word x 1 2 m 1 2 n intro duction of language-restricted IFS's in Section 5. is called the pre x of w , denoted x w . The remaining word y is called the sux.We assume that the relation The function h is extended to words and languages over is re exive, that is, w w . The n-fold concatenation of V using the equations: aword w with itself is called its n-th power, and denoted n 0 w . By de nition, w = for any w . If w = a a :::a , h(a a :::a ) = h(a ) h(a ) ::: h(a ); 1 2 n 1 2 n 1 2 n [ R then the word w = a :::a a is called the mirror im- n 2 1 h(L) = h(w ); R R R age of w . It can b e shown that (xy ) = y x for any w 2L words x and y . where the symbol denotes function comp osition, ? The set of all words over V is denoted by V , and the + set of nonemptywords by V . A formal language over x f f f = f ((f (f (x))) ): 1 2 n n 2 1 an alphab et V is a set L of words over V , hence L ? V . The concatenation and mirror image of words are The attractor of an IFS I is the smallest nonemptyset extended to languages as follows: AX , closed with resp ect to all transformations of F , and closed in the set-theoretic sense. Hutchinson showed L L = fxy : x 2 L & y 2 L g; 1 2 1 2 that the attractor of an arbitrary IFS always exists and R R L = fw : w 2 Lg: is unique [12 ]. Consequently, it can b e found by selecting a p oint P 2A, and applying to it all p ossible sequences A language L is pre x extensible if there exists a word + of transformations from F : v 2 V suchthat vL L. In other words, vw 2 L for every word w 2 L. The right derivative of a language ? A =cl(P h(V )); ? ? L V with resp ect to a word v 2 V is the language: where the symbol cl represents the set-theoretic closure of ? L==v = fw 2 V : vw 2 Lg: the argument set. There are several metho ds for nding the initial p oint P 2A. For example, the xed p ointof The set of all pre xes of a language L is called the pre x any transformation F 2F is known to b elong to A [12 ]. closure of L: A legible notation for sp ecifying transformations is ? P (L)=fx 2 V :(9w 2 L) x w g: needed while de ning particular IFS's. In this pap er we express transformations by comp osing op erations of translation, rotation, and scaling in an underlying Carte- 3. Iterated function systems sian co ordinate system. The following symb ols are used: Let hX; di b e a complete metric space with supp ort X t(a; b) is a translation byvector (a; b). and distance function d (in this pap er, we will only con- a( ) is a rotation by (oriented) angle with resp ect sider the plane with the Euclidean distance). A function to the origin of the co ordinate system. The angles F : X ! X is called a contraction in X if there is a are expressed in degrees. constant r<1 suchthat s(r ;r ) is a scaling with resp ect to the origin of x y d(F (P );F(Q)) rd(P; Q) 0 0 the co ordinate system: x = r x and y = r y . If x y for all P; Q 2 X . The parameter r is called the Lipschitz r = r = r ,we write s(r ) instead of s(r;r). x y constant of F . For example, Figure 1 shows the attractor of an IFS An iterated function system (IFS) in X is a quadruplet I = hX; F ;V;hi, where the set F consists of two trans- I = hX; F ;V;h;i, where: formations: ! p X is the underlying metric space, 2 F = s r (45); 1 F is a set of contractions in X , 2 ! p V is an alphab et of contraction lab els, 2 F = s r (135) t(0; 1): 2 2 h : V !F is a labeling function, taking the letters of alphab et V to the contractions from F . Z 2b Z1 ~ ~ h(b) Z2a h(a) Z2 C O R ||Z 3 || ||Z3b || ||Z3a || ~ h(a) Z The dragon curve Figure 1: ~ 3 h(b) Z3a Z3b 4. The escap e-time metho d res (Z ;a)= res(Z ;b) = 0, since Z 62 C , 1 1 1 ~ res (Z ;a) = 0, since Z h (a)= Z 2C, Consider an IFS I = hX; F ;V;hi, where all functions 2 2 2a ~ F 2F are invertible. Let h(a) denote the inverse of the res (Z ;a) > res(Z ;b), since kZ k < kZ k.
Load more

Recommended publications
  • Pictures of Julia and Mandelbrot Sets
    Pictures of Julia and Mandelbrot Sets Wikibooks.org January 12, 2014 On the 28th of April 2012 the contents of the English as well as German Wikibooks and Wikipedia projects were licensed under Cre- ative Commons Attribution-ShareAlike 3.0 Unported license. An URI to this license is given in the list of figures on page 143. If this document is a derived work from the contents of one of these projects and the content was still licensed by the project under this license at the time of derivation this document has to be licensed under the same, a similar or a compatible license, as stated in section 4b of the license. The list of contributors is included in chapter Contributors on page 141. The licenses GPL, LGPL and GFDL are included in chapter Licenses on page 151, since this book and/or parts of it may or may not be licensed under one or more of these licenses, and thus require inclusion of these licenses. The licenses of the figures are given in the list of figures on page 143. This PDF was generated by the LATEX typesetting software. The LATEX source code is included as an attachment (source.7z.txt) in this PDF file. To extract the source from the PDF file, we recommend the use of http://www.pdflabs.com/tools/pdftk-the-pdf-toolkit/ utility or clicking the paper clip attachment symbol on the lower left of your PDF Viewer, selecting Save Attachment. After ex- tracting it from the PDF file you have to rename it to source.7z.
    [Show full text]
  • 4.3 Discovering Fractal Geometry in CAAD
    4.3 Discovering Fractal Geometry in CAAD Francisco Garcia, Angel Fernandez*, Javier Barrallo* Facultad de Informatica. Universidad de Deusto Bilbao. SPAIN E.T.S. de Arquitectura. Universidad del Pais Vasco. San Sebastian. SPAIN * Fractal geometry provides a powerful tool to explore the world of non-integer dimensions. Very short programs, easily comprehensible, can generate an extensive range of shapes and colors that can help us to understand the world we are living. This shapes are specially interesting in the simulation of plants, mountains, clouds and any kind of landscape, from deserts to rain-forests. The environment design, aleatory or conditioned, is one of the most important contributions of fractal geometry to CAAD. On a small scale, the design of fractal textures makes possible the simulation, in a very concise way, of wood, vegetation, water, minerals and a long list of materials very useful in photorealistic modeling. Introduction Fractal Geometry constitutes today one of the most fertile areas of investigation nowadays. Practically all the branches of scientific knowledge, like biology, mathematics, geology, chemistry, engineering, medicine, etc. have applied fractals to simulate and explain behaviors difficult to understand through traditional methods. Also in the world of computer aided design, fractal sets have shown up with strength, with numerous software applications using design tools based on fractal techniques. These techniques basically allow the effective and realistic reproduction of any kind of forms and textures that appear in nature: trees and plants, rocks and minerals, clouds, water, etc. For modern computer graphics, the access to these techniques, combined with ray tracing allow to create incredible landscapes and effects.
    [Show full text]
  • Rendering Hypercomplex Fractals Anthony Atella [email protected]
    Rhode Island College Digital Commons @ RIC Honors Projects Overview Honors Projects 2018 Rendering Hypercomplex Fractals Anthony Atella [email protected] Follow this and additional works at: https://digitalcommons.ric.edu/honors_projects Part of the Computer Sciences Commons, and the Other Mathematics Commons Recommended Citation Atella, Anthony, "Rendering Hypercomplex Fractals" (2018). Honors Projects Overview. 136. https://digitalcommons.ric.edu/honors_projects/136 This Honors is brought to you for free and open access by the Honors Projects at Digital Commons @ RIC. It has been accepted for inclusion in Honors Projects Overview by an authorized administrator of Digital Commons @ RIC. For more information, please contact [email protected]. Rendering Hypercomplex Fractals by Anthony Atella An Honors Project Submitted in Partial Fulfillment of the Requirements for Honors in The Department of Mathematics and Computer Science The School of Arts and Sciences Rhode Island College 2018 Abstract Fractal mathematics and geometry are useful for applications in science, engineering, and art, but acquiring the tools to explore and graph fractals can be frustrating. Tools available online have limited fractals, rendering methods, and shaders. They often fail to abstract these concepts in a reusable way. This means that multiple programs and interfaces must be learned and used to fully explore the topic. Chaos is an abstract fractal geometry rendering program created to solve this problem. This application builds off previous work done by myself and others [1] to create an extensible, abstract solution to rendering fractals. This paper covers what fractals are, how they are rendered and colored, implementation, issues that were encountered, and finally planned future improvements.
    [Show full text]
  • Synthesis of the Advance in and Application of Fractal Characteristics of Traffic Flow
    Synthesis of the Advance in and Application of Fractal Characteristics of Traffic Flow Final Report Contract No. BDK80 977‐25 July 2013 Prepared by: Lehman Center for Transportation Research Florida International University Prepared for: Research Center Florida Department of Transportation Final Report Contract No. BDK80 977-25 Synthesis of the Advance in and Application of Fractal Characteristics of Traffic Flow Prepared by: Kirolos Haleem, Ph.D., P.E., Research Associate Priyanka Alluri, Ph.D., Research Associate Albert Gan, Ph.D., Professor Lehman Center for Transportation Research Department of Civil and Environmental Engineering Florida International University 10555 West Flagler Street, EC 3680 Miami, FL 33174 Phone: (305) 348-3116 Fax: (305) 348-2802 and Hongtai Li, Graduate Research Assistant Tao Li, Ph.D., Associate Professor School of Computer Science Florida International University 11200 SW 8th Street Miami, FL 33199 Phone: (305) 348-6036 Fax: (305) 348-3549 Prepared for: Research Center State of Florida Department of Transportation 605 Suwannee Street, M.S. 30 Tallahassee, FL 32399-0450 July 2013 DISCLAIMER The opinions, findings, and conclusions expressed in this publication are those of the authors and not necessarily those of the State of Florida Department of Transportation. iii METRIC CONVERSION CHART SYMBOL WHEN YOU KNOW MULTIPLY BY TO FIND SYMBOL LENGTH in inches 25.4 millimeters mm ft feet 0.305 meters m yd yards 0.914 meters m mi miles 1.61 kilometers km mm millimeters 0.039 inches in m meters 3.28 feet ft m meters
    [Show full text]
  • 오늘의 천체사진(APOD) 번역집 2013-4 Bigcrunch 소개글
    오늘의 천체사진(APOD) 번역집 2013-4 BigCrunch 소개글 NASA에서 운영하는 오늘의 천체사진(Astronomy Picture of the Day, 이하 APOD)사이트는 1995년 6월 16일 첫번째 천체사진을 발표한 이래, 지금까지 하루도 빠짐없이 천체관련 사진 또는 동영상을 발표하고 있습니다. 본 블로그 북은 2013년 APOD를 통해 발표된 천체사진의 번역 모음집 두번째 편으로서 2013년 11월 1일부터 12월 31일까지 총 51개의 APOD 번역내역이 담겨 있습니다. 참고 : 2013년 발표 천체사진 중 과거에 이미 발표된 내용이 반복 게재된 경우, 그리고 동영상이 게재되어 본 블로그북 형식으로 담아낼 수 없는 경우는 제외되었으니 이점 참고하여 주십시오. 목차 1 목성의 삼중 일식 6 2 하이브리드 일식 9 3 뉴욕 상공의 일식 13 4 노르웨이 상공의 오로라 16 5 1만 3천미터 상공의 일식 20 6 우간다 상공의 일식 23 7 러브조이 혜성과 M44 26 8 불꽃놀이와 번개 사이의 혜성 30 9 개기일식 동안 촬영된 왕성한 활동력의 태양 33 10 토성의 그림자 속에서 바라본 토성 36 11 NGC 1097 39 12 태양의 스펙트럼 42 13 아이손 혜성 45 14 맥너트 혜성의 웅장한 꼬리 48 15 아이슬란드 상공의 오로라와 멋진 구름 51 16 4U1630-47 의 블랙홀 제트 54 17 미노타우르스 미사일의 궤적 57 18 캘리포니아 성운과 플레아데스 성단 60 19 스테레오 위성이 포착한 아이손 혜성 63 20 인디안 코브 상공의 헤일-밥 혜성 66 21 NGC 4921 69 22 시에라 네바다 산맥 위의 모자 구름 72 23 NGC 1999 75 24 태양 주위를 통과하기 전과 후의 아이손 혜성 79 25 은하 중심을 향해 발사되고 있는 레이저 82 26 M63 앞을 지나는 러브조이 혜성 86 27 로 오피유키(Rho Ophiuchi)의 찬란한 구름들 89 28 러브조이 혜성(C/2013 R1) 92 29 Abell 7 95 30 감마선을 내뿜는 지구와 하늘 98 31 구제프 크레이터 전경 - 에베레스트 파노라마(the Everest panorama) 102 32 풍차 위의 러브조이 혜성 105 33 세이퍼트의 6중 은하(Seyfert's Sextet) 108 34 지구에서 가장 추운 곳 111 35 알니탁, 알니렘, 민타카 114 36 다샨바오 습지 상공의 쌍동이 자리 유성우 118 37 NGC 7635 121 38 유로파 124 39 달에 내려선 탐사로봇 위투(Yutu) 127 40 테이드 화산 위의 유성우 130 41 핀란드에서 촬영된 빛기둥 133 42 다채로운 색깔의 달 136 43 호수의 세계 타이탄 140 44 태양활동관측위성이 다파장으로 바라본 태양 144 45 칠레에서 촬영된 쌍동이자리 유성우 148 46 Sharpless 2-308 151 47 M33의 수소구름 154 48 하트 성운 중심의 Melotte 15 159 49 알라스카의 오로라 162 50 환상적인 프렉탈의 풍경 165 51 말머리 성운 169 01 목성의 삼중 일식 목성의 삼중 일식 2013.11.16 22:02 세계표준시 10월 12일 새벽 5시 28분에 벨기에에서 촬영된 이 사진은 천체망원경에 웹카메라를 이용하여 촬영한 것으로서 목성의 달이 목성 상공을 지나면서 그 그림자를 목성 대기에 드리우고 있는 모습을 보여주고 있다.
    [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]
  • Fractal Texture: a Survey
    Advances in Computational Research ISSN: 0975-3273 & E-ISSN: 0975-9085, Volume 5, Issue 1, 2013, pp.-149-152. Available online at http://www.bioinfopublication.org/jouarchive.php?opt=&jouid=BPJ0000187 FRACTAL TEXTURE: A SURVEY RANI M.1 AND AGGARWAL S.2* 1Department of Mathematics, Statistics & Computer Science, Central University of Rajasthan, Ajmer- 305 801, Rajasthan, India. 2Department of MCA, Krishna Engineering College, Mohan Nagar, Ghaziabad- 201 007, UP, India. *Corresponding Author: Email- [email protected] Received: August 07, 2013; Accepted: September 02, 2013 Abstract- The places where you can find fractals include almost every part of the universe, from bacteria cultures to galaxies to your body. Many natural surfaces have a statistical quality of roughness and self-similarity at different scales. Mandelbrot proposed fractal geometry and is the first one to notice its existence in the natural world. Fractals have become popular recently in computer graphics for generating realistic looking textured images. This paper presents a brief introduction to fractals along with its main features and generation techniques. The con- centration is on the fractal texture and the measures to express the texture of fractals. Keywords- fractal dimension, fractal texture, lacunarity, succolarity Citation: Rani M. and Aggarwal S. (2013) Fractal Texture: A Survey. Advances in Computational Research, ISSN: 0975-3273 & E-ISSN: 0975- 9085, Volume 5, Issue 1, pp.-149-152. Copyright: Copyright©2013 Rani M. and Aggarwal S. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided the original author and source are credited.
    [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]
  • Application of Iteration Function System for Ceramic Tile Design
    2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom) Application of Iteration Function System for Ceramic Tile Design Zhiming Chen Department of Visual Communication School of Art, Xi’an Fanyi University Xi’an, China [email protected] Abstract—The fractal art pattern is the product of the implement an IFS system that can change parameters to gen- fusion of computer science and art. This pattern expression erate different fractal graphics; this application can choose is based on many traditional aesthetics, and it breaks the different fractal forms, and can set different parameters for standard of conventional aesthetics in a unique way of display. Although it has extremely irregular characteristics, it has the fractal, so as to reach the user desired results. After that, a special aesthetic perspective. To ensure people a unique we can use the creative fractal graphics to design and apply aesthetic sensory experience, the design and application of them to the design of ceramic tiles. fractal patterns on different carriers according to different The rest of this paper is organized as follows. Section II constitutional ways of fractal patterns not only have practical overviews the basic working principle of Iteration Function value, but also have artistic aesthetic value. This paper investi- gates the design of ceramic tiles by Iteration Function System System for generating fractal graphics. In Section III, we (IFS). First, the working principle of IFS is briefly illustrated. concentrate the production of random fractal landscape with Further, a random fractal landscape is generated via IFS codes IFS.
    [Show full text]
  • Fractal Landscapes Without Creases and with Rivers
    Appendix A Fractal landscapes without creases and with rivers Benoit B.Mandelbrot This text tackles three related but somewhat independent issues. The most ba­ sic defect of past fractal forgeries of landscape is that every one of them fails to include river networks. This is one reason why these forgeries look best when viewed from a low angle above the horizon, and are worst when examined from the zenith. This is also why achieving afully random combined model of rivers and of mountains will be a major advance for computer graphics (and also per­ haps for the science of geomorphology). The main goal of this text is to sketch two partly random solutions that I have developed very recently and Ken Mus­ grave has rendered. A second very different irritating defect is specific to the method of land­ scapes design (called midpoint displacement or recursive subdivision) which is described in [40]. It has gained wide exposure in "Star Trek II," and is fast, compact, and easy to implement. Its main shortcoming is that it generates "fea­ tures" that catch the eye and, by their length and straightness, make the rendered scene look "unnatural." This defect, which has come to be called "the creasing problem," is illustrated in the body of the present book. It was first pointed out in [69], and its causes are deep, so that it cannot be eliminated by cosmetic treat­ ment. This text sketches several methods that avoid creasing from the outset. (We were not aware of the fact that [76] had addressed this problem before us.
    [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]
  • Fractal Surfaces of Synthetical DEM Generated by GRASS GIS Module R.Surf.Fractal from ETOPO1 Raster Grid Polina Lemenkova
    Fractal surfaces of synthetical DEM generated by GRASS GIS module r.surf.fractal from ETOPO1 raster grid Polina Lemenkova To cite this version: Polina Lemenkova. Fractal surfaces of synthetical DEM generated by GRASS GIS module r.surf.fractal from ETOPO1 raster grid. Journal of Geodesy and Geoinformation, UCTEA Chamber of Surveying and Cadastre Engineers, Turkey, 2020, 7 (2), pp.86-102. 10.9733/JGG.2020R0006.E. hal-02956736 HAL Id: hal-02956736 https://hal.archives-ouvertes.fr/hal-02956736 Submitted on 3 Oct 2020 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. Araştırma Makalesi / Research Article Cilt / Volume: 7 Sayı / Issue: 2 Sayfa / Page: 86-102 ISSN : 2147-1339 Dergi No / Journal No: 112 e-ISSN: 2667-8519 Doi: 10.9733/JGG.2020R0006.E Fractal surfaces of synthetical DEM generated by GRASS GIS module r.surf.fractal from ETOPO1 raster grid Polina Lemenkova1* 1Ocean University of China, College of Marine Geo-sciences, Qingdao, Shandong, China. Abstract: The research problem is about to generate artificial fractal landscape surfaces from the Digital Elevation Model (DEM) using a stochastic algorithm by Geographic Resources Analysis Support System Geographic Information System (GRASS GIS) software.
    [Show full text]