P. Prusinkiewicz and A. Lindenmayer, the Algorithmic Beauty of Plants
Total Page:16
File Type:pdf, Size:1020Kb
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. -
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. -
Image Encryption and Decryption Schemes Using Linear and Quadratic Fractal Algorithms and Their Systems
Image Encryption and Decryption Schemes Using Linear and Quadratic Fractal Algorithms and Their Systems Anatoliy Kovalchuk 1 [0000-0001-5910-4734], Ivan Izonin 1 [0000-0002-9761-0096] Christine Strauss 2 [0000-0003-0276-3610], Mariia Podavalkina 1 [0000-0001-6544-0654], Natalia Lotoshynska 1 [0000-0002-6618-0070] and Nataliya Kustra 1 [0000-0002-3562-2032] 1 Department of Publishing Information Technologies, Lviv Polytechnic National University, Lviv, Ukraine [email protected], [email protected], [email protected], [email protected], [email protected] 2 Department of Electronic Business, University of Vienna, Vienna, Austria [email protected] Abstract. Image protection and organizing the associated processes is based on the assumption that an image is a stochastic signal. This results in the transition of the classic encryption methods into the image perspective. However the image is some specific signal that, in addition to the typical informativeness (informative data), also involves visual informativeness. The visual informativeness implies additional and new challenges for the issue of protection. As it involves the highly sophisticated modern image processing techniques, this informativeness enables unauthorized access. In fact, the organization of the attack on an encrypted image is possible in two ways: through the traditional hacking of encryption methods or through the methods of visual image processing (filtering methods, contour separation, etc.). Although the methods mentioned above do not fully reproduce the encrypted image, they can provide an opportunity to obtain some information from the image. In this regard, the encryption methods, when used in images, have another task - the complete noise of the encrypted image. -
Project-Team Virtual Plants Modeling Plant Morphogenesis from Genes To
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Project-Team Virtual Plants Modeling plant morphogenesis from genes to phenotype Sophia Antipolis THEME BIO c t i v it y ep o r t 2005 Table of contents 1. Team 1 2. Overall Objectives 2 2.1. Overall Objectives 2 3. Scientific Foundations 2 3.1. Analysis of structures resulting from meristem activity 2 3.2. Meristem functioning and development 3 3.3. A software platform for plant modeling 4 4. New Results 4 4.1. Analysis of structures resulting from meristem activity 4 4.1.1. Analysis of longitudinal count data and underdispersion 4 4.1.2. Growth synchronism between Aerial and Root Systems 4 4.1.3. Changes in branching structures within the whole plants 5 4.1.4. Growth components in trees 5 4.1.5. Markov switching models 5 4.1.6. Diagnostic tools for hidden Markovian models 5 4.1.7. Hidden Markov tree models for investigating physiological age within plants 6 4.1.8. Branching processes for plant development analysis 6 4.1.9. Self-similarity in plants 6 4.1.10. Reconstruction of plant foliage density from photographs 6 4.1.11. Fractal analysis of plant geometry 6 4.1.12. Light interception by canopy 7 4.1.13. Heritability of architectural traits 7 4.2. Meristem functioning and development 8 4.2.1. 3D surface reconstruction and cell lineage detection in shoot meristems 8 4.2.2. Simulation of auxin fluxes in the mersitem 8 4.2.3. Dynamic model of phyllotaxy based on auxin fluxes 8 4.2.4. -
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. -
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. -
An Introduction Into Ecological Modelling for Students, Teachers & Scientists
Modelling Complex Ecological Dynamics . Fred Jopp l Hauke Reuter l Broder Breckling Editors Modelling Complex Ecological Dynamics An Introduction into Ecological Modelling for Students, Teachers & Scientists Title Drawings by Melanie Trexler Foreword by Sven Erik Jørgensen & Donald L. DeAngelis Editors Dr. Fred Jopp Dr. Hauke Reuter Department of Biology Department of Ecological Modelling University of Miami Leibniz Center for Tropical Marine Ecology P.O. Box 249118 GmbH (ZMT) Coral Gables, FL 33124 Fahrenheitstraße 6 USA 28359 Bremen [email protected] Germany [email protected] Dr. Broder Breckling General and Theoretical Ecology Center for Environmental Research and Sustainable Technology (UFT) University of Bremen Leobener St. 28359 Bremen Germany [email protected] ISBN 978-3-642-05028-2 e-ISBN 978-3-642-05029-9 DOI 10.1007/978-3-642-05029-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011921703 # Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protec- tive laws and regulations and therefore free for general use. -
Fractal Texture and Structure of Central Place Systems
Fractal Texture and Structure of Central Place Systems Yanguang Chen (Department of Geography, College of Urban and Environmental Sciences, Peking University, Beijing 100871, P.R. China. Email: [email protected]) Abstract: The boundaries of central place models proved to be fractal lines, which compose fractal texture of central place networks. A textural fractal can be employed to explain the scale-free property of regional boundaries such as border lines, but it cannot be directly applied to spatial structure of real human settlement systems. To solve this problem, this paper is devoted to deriving structural fractals of central place models from the textural fractals. The method is theoretical deduction based on the dimension rules of fractal sets. The textural fractals of central place models are reconstructed, the structural dimensions are derived from the textural dimensions, and the central place fractals are formulated by the k numbers and g numbers. Three structural fractal models are constructed for central place systems according to the corresponding fractal dimensions. A theoretical finding is that the classic central place models comprise Koch snowflake curve and Sierpinski space filling curve, and an inference is that the traffic principle plays a leading role in urban and rural evolution. The conclusion can be reached that the textural fractal dimensions can be converted into the structural fractal dimensions. The latter dimensions can be directly used to appraise urban and rural settlement distributions in the real world. Thus, the textural fractals can be indirectly utilized to explain the development of the systems of human settlements. Key words: Central place fractals; Systems of human settlement; Fractal dimension; Koch snowflake; Sierpinski space-filling curve; Gosper island 1. -
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]. -
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. -
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. -
Bachelorarbeit Im Studiengang Audiovisuelle Medien Die
Bachelorarbeit im Studiengang Audiovisuelle Medien Die Nutzbarkeit von Fraktalen in VFX Produktionen vorgelegt von Denise Hauck an der Hochschule der Medien Stuttgart am 29.03.2019 zur Erlangung des akademischen Grades eines Bachelor of Engineering Erst-Prüferin: Prof. Katja Schmid Zweit-Prüfer: Prof. Jan Adamczyk Eidesstattliche Erklärung Name: Vorname: Hauck Denise Matrikel-Nr.: 30394 Studiengang: Audiovisuelle Medien Hiermit versichere ich, Denise Hauck, ehrenwörtlich, dass ich die vorliegende Bachelorarbeit mit dem Titel: „Die Nutzbarkeit von Fraktalen in VFX Produktionen“ selbstständig und ohne fremde Hilfe verfasst und keine anderen als die angegebenen Hilfsmittel benutzt habe. Die Stellen der Arbeit, die dem Wortlaut oder dem Sinn nach anderen Werken entnommen wurden, sind in jedem Fall unter Angabe der Quelle kenntlich gemacht. Die Arbeit ist noch nicht veröffentlicht oder in anderer Form als Prüfungsleistung vorgelegt worden. Ich habe die Bedeutung der ehrenwörtlichen Versicherung und die prüfungsrechtlichen Folgen (§26 Abs. 2 Bachelor-SPO (6 Semester), § 24 Abs. 2 Bachelor-SPO (7 Semester), § 23 Abs. 2 Master-SPO (3 Semester) bzw. § 19 Abs. 2 Master-SPO (4 Semester und berufsbegleitend) der HdM) einer unrichtigen oder unvollständigen ehrenwörtlichen Versicherung zur Kenntnis genommen. Stuttgart, den 29.03.2019 2 Kurzfassung Das Ziel dieser Bachelorarbeit ist es, ein Verständnis für die Generierung und Verwendung von Fraktalen in VFX Produktionen, zu vermitteln. Dabei bildet der Einblick in die Arten und Entstehung der Fraktale