form_script.workshop Turing proposed the idea that two or more re- In today s project we are building on the repel

Similar documents
B. Pattern Formation. Differentiation & Pattern Formation

Agents That Move. NetLogo Guide 2. Turtles - Breeds. John Hayward Church Growth Modelling

B. Pattern Formation 2/4/18 1

Complex Systems Made Simple

Modelers can give instructions to hundreds or thousands of independent "agents" all operating in parallel.

Morphogenesis. Simulation Results

Exercise 1.1 A First NetLogo Session Turtle commands and properties

CELLULAR AUTOMATA IN MATHEMATICAL MODELING JOSH KANTOR. 1. History

Introduction to Scratch Programming v1.4 (Second Ed) Lesson 6 Calculator

7. Traffic Simulation via Cellular Automata

CPIB SUMMER SCHOOL 2011: INTRODUCTION TO BIOLOGICAL MODELLING

NETLOGO 6.0 QUICK GUIDE

COMPUTER EXERCISE: POPULATION DYNAMICS IN SPACE September 3, 2013

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

A SIMPLE MODEL OF THE BELOUSOV-ZHABOTINSKY REACTION FROM FIRST PRINCIPLES

Procedures: Algorithms and Abstraction

Complex Dynamics in Life-like Rules Described with de Bruijn Diagrams: Complex and Chaotic Cellular Automata

Introduction to Voronoi Diagrams and Delaunay Triangulations

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Hot Sync. Materials Needed Today

The Repast Simulation/Modelling System for Geospatial Simulation. Andrew Crooks. CASA University College London 1-19 Torrington Place London

The following procedure implements the process described above:

Evolutionary design for the behaviour of cellular automaton-based complex systems

Volume Illumination and Segmentation

Algorithmic Sound Composition using Coupled Cellular Automata

A Cell-centered, Agent-based Method that utilizes a Delaunay and Voronoi Environment in 2- and 3-Dimensions

Pathfinding. Pathfinding Planned Movement

Self-formation, Development and Reproduction of the Artificial System

Lesson 13: Exploring Factored Form

Generalized Coordinates for Cellular Automata Grids

How Do Computers Solve Geometric Problems? Sorelle Friedler, University of Maryland - College Park

Understanding Geospatial Data Models

Simulating Spatial Partial Differential Equations with Cellular Automata

Geometry of Art and Nature

CSCE782 Project-Omor Sharif - page 1

CS 532: 3D Computer Vision 14 th Set of Notes

Linear Algebra and Gaming

Mark Important Points in Margin. Significant Figures. Determine which digits in a number are significant.

Grade 7/8 Math Circles November 3/4, M.C. Escher and Tessellations

Computational Maths for Dummies 1

A linked list grows as data is added to it. In a linked list each item is packaged into a node.

Unit 1, Lesson 1: Moving in the Plane

Convex Hulls in 3D. Definitions. Size of a Convex Hull in 3D. Collision detection: The smallest volume polyhedral that contains a set of points in 3D.

TECHNOLOGY TERM 2 OF 2016 STRUCTURES

Conway s Game of Life Wang An Aloysius & Koh Shang Hui

TSC 220. complex systems

Adaptive Tessellation for Trimmed NURBS Surface

On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course

NetLogo Tutorial Series: Langton's Ant. Nicholas Bennett Grass Roots Consulting

Map-colouring with Polydron

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :

The Death Map. Hollins University Visitors 25 October / 63

Weighted and Continuous Clustering

arxiv: v1 [cs.gr] 7 Feb 2018

Introduction to ANSYS FLUENT Meshing

Topic 0. Introduction: What Is Computer Graphics? CSC 418/2504: Computer Graphics EF432. Today s Topics. What is Computer Graphics?

Lecture 16: Voronoi Diagrams and Fortune s Algorithm

Grids Geometry Computational Geometry

Introductory Courses

Minnesota Comprehensive Assessments-Series III

My Target Level 1c. My areas for development:

IMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib

Grade 6 Math Circles February 19th/20th. Tessellations

Delaunay Triangulation

Grades 7 & 8, Math Circles 31 October/1/2 November, Graph Theory

Light: Geometric Optics

Lab Practical - Limit Equilibrium Analysis of Engineered Slopes

Two-dimensional Totalistic Code 52

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling

PROPERTIES OF NATURAL ELEMENT COORDINATES ON ANY POLYHEDRON

A General Introduction to Modeling in Research

Planning Workshop Day 2 SHELLEY MOORE

Grade 6 Math Circles February 19th/20th

Lesson 9. Three-Dimensional Geometry

CMSC/BIOL 361: Emergence Cellular Automata: Introduction to NetLogo

Path Planning. Marcello Restelli. Dipartimento di Elettronica e Informazione Politecnico di Milano tel:

UNSW School Mathematics Competition

The Sweet Bees-ness of Honeycomb

Lifting Transform, Voronoi, Delaunay, Convex Hulls

Notes in Computational Geometry Voronoi Diagrams

About Finish Line Mathematics 5

MPI Case Study. Fabio Affinito. April 24, 2012

P063 ADAPTIVE TRAVEL-TIME AND RAY- PARAMETER INVERSION OF DENSELY SAMPLED 2-D SEISMIC DATA

Unit 5: Part 1 Planning

Work Session 16a: Massaging data graphically

Day #1. Determining an exponential function from a table Ex #1: Write an exponential function to model the given data.

Selective Space Structures Manual

Jigsaw Image Mosaics (JIM)

Visual Physics - Introductory Lab Lab 0

Complexity, Induction, and Recurrence Relations. CSE 373 Help Session 4/7/2016

A KNOWLEDGE-BASED APPROACH TO RAPID AND RELIABLE TOOL DESIGN

GRADE 7 TECHNOLOGY TERM 2

Building Big Macs. Opening Explanation. Exploring. Student Hand-out

Computational Geometry. Definition, Application Areas, and Course Overview

Chapter 7. Polygons, Circles, Stars and Stuff

arxiv:cs/ v1 [cs.cg] 26 Feb 2002

Planning: Part 1 Classical Planning

Civil Engineering Computation

Making Your First Character

Transcription:

Alan Turing, 1952, The Chemical Basis of Morphogenesis, phil. Trans R Soc B, 237 37-72 (transactions of the royal society) Turing proposed the idea that two or more re- acting chemicals in a diffusion would reach a stable state and thus reveal a pattern. An- drew Adamatzky in his introduction to reac- tion-diffusion models uses the example of the grass fire to explain the general ideas about reaction diffusion. Initially the idea is that you have a system at rest, consisting of an excitable medium in this case burnable grass; after pertur- bation the system moves in some phase space along a fixed trajectory until it returns to the fixed point. setting on fire is a perturbation action a fire front is an excitation front a burnt zone is the part of the medium in a refractory state growth of grass is the recovery of the substrate The items in italics are technical terms derived from chemistry, which we need not go into here, but the point is that the process consists of waves (or fronts) of excita- tion which travel across the chemical and as they do so, where they meet they stop. So if you chuck some matches into an area of dried grass, where the matches land becomes the centre of a circle (if there is no wind!) of burnt grass. This will go on until there is no more grass to burn, or if the front of burning grass meets another front. The fact that once the grass is burnt it can t imme- diately be reignited is the fact behind the bushmen s trick of stopping a fire by starting another one ahead of the front. looked at last week. In today s project we are building on the repel procedure that we have already discussed, where a set of turtles do the following: 1 - find nearest turtle 2 - back off by repel-strength We have observed that once the turtles have quietened down they are all the same distance from each other, and as a consequence represent a triangular lattice. If you look at the distribution of the points you can see that 1 - they can all be seen to lie on this triangular grid 2 - they can all be seen to lie at the centre of a small region bounded by their immediate neighbour s regions The technical term for developing these regions is delaunay triangulation/ voronoi diagram, and there are many methods of constructing such things (we can show you a version written in VBA later on) which rely on complicated mathematical formulae and constructive geometry, but today we will look at how we can use these points to initiate a reaction diffusion mechanism so as to show these regions. We will look at how to do it the simplest possible way the way nature does it in the cracks in dried mud and the other material methods such as Frei Otto looks at (and we will next week in the soapfilm workshop). 20 react_diffuse This final project in our 3 lessons on netlogo The program works by using the patches (like 03 is a combination of the two we have looked in the magic sponge) to do the diffusion. At 13 agents at, the cellular automata (magic carpet/life the beginning the patches are all at zero game) and the turtles/agents/particles the we growing grass as it were. 06 CA

to leak without-interruption ;use patchcolour to set patches own variables ask patches if not boundary checkdiffuse if recording movie-grab-graphics without-interruption ;;use patches own to set patch colour ask patches ifelse boundary set pcolor white set s1 0 if s1 > 0 set pcolor s1 end to checkdiffuse if pcolor = 0 13 agents 06 CA How it works We need a way of initiating the reaction diffusion mechanism (dropping the match somewhere as it were), and we do this by getting the turtles to colour in the patch they are standing on. Using stamp will do this, but if we only do that the patches stamped on will all be the same colour. For ease of programming we need the initiators to be different colours so we add who (turtle s ID) to the stamp to get different colours for every turtle (because they all have different ids). Then we tell them to die because we don t need them any more - die. The algorithm ;this patch is currently blank The general idea is that any empty patch will change to the colour of any neighbouring patch that isn t zero. That will work to diffuse the initial coloured patch (where the set s1 sum values-from neighbors3d pcolor turtle stamped) but we don t have any way to set s2 count neighbors3d with pcolor > 0 stop it. We want to stop the diffusion when if s2 > 0 ; any coloured patches in the neighbourhood? one colour meets another different colour, and we will set this patch to be a boundary patch. In the checkdiffuse procedure below ifelse e ( int(s1 / s2) * s2 ) = s1 ;check all colours are the same? we set patches to be either the colour of the set s1 ( s1 / s2 ) ;then just turn the same colour general diffusion or if there are 2 or more set boundary true ;but if some are different be a boundary colours in the neighbourhood we set it to be a boundary. This works by the slightly devious method of checking how many neighbours are coloured at all (s1 =count neighbours with ) and also summing all the (possibly end different) colour values in the neighbourhood (s2 = sum values-from). If all the colours are the same then taking the whole number 20 react_diffuse 03 value of the division of howmany(s1) by the howmuch (s2) and comparing that with the real result we can infer whether all the colours are the same.

In the resulting pattern you will see that the white cells form lines between the original turtle points. The geometry is rather heavily influenced by the orthogonality of the patches grid, so we don t see good hexagons, but only 0, 45 and 90 degree lines. There is another version of this program which uses the diffuse command in netlogo, which results in slightly better tilings, but with gaps because the diffusion is difficult to control. mud crack pattern Tasks 1 - during today s workshop You should combine the two programmes: 1) circles from last week with repel and 2) this weeks reaction-diffusion, into one. After that you should use this program with your multiple strength repulse procedures so as to create large and small cells in your emergent voronoi. Don t forget to RECORD your results for Fridays DTP session. The leak procedure calls checkdiffuse and then colours them in appropriately, white for boundary cells and the diffusing colour for the others. 2 - assignment for next week 20 react_diffuse 13 agents 06 CA Images on the right show the effect of visualising different concentrations of chemical as solid. Collect images from the web of natural/ social examples of these reaction-diffusion processes and emergent patterns through forces. Come up with a program of your own that combines the last three workshops scripts handed-out and written by yourselves. Keep it simple and look for the graphic effect rather than heavy programming! 03

20 react_diffuse 03 13 agents 06 CA

20 react_diffuse 03 13 agents 06 CA

20 react_diffuse 03 13 agents 06 CA

20 react_diffuse 03 13 agents 06 CA