Synthetic Topiary. Premislaw Prunsinkiewicz (Prof. P) Mark James Radomír Měch.

Slides:



Advertisements
Similar presentations
1 Turing Machines and Equivalent Models Section 13.2 The Church-Turing Thesis.
Advertisements

Jason Stredwick, MSU 2004 L-Systems Lindenmayer Systems algorithmicbotany.org.
Decision Tree Approach in Data Mining
Control Systems in Plants
JYC: CSM17 BioinformaticsCSM17 Week 8: Simulations (part 2): plant morphology sea shells (marine molluscs) fractals virtual reality –Lindenmayer systems.
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
L-System Aristid Lindenmayer (1968), biologist. L-System A method of constructing a FRACTAL that is also a MODEL for plant growth. The Computational Beauty.
constructions A Straight Line constructions Task: Task: Construct a line XY of length 5.9 cm. X  Construct a line more than 5.9 cm long (about 8 cm).
SCRIPTING AND CONSTRUCTION THREE DIMENSIONAL TREE By Ryan Pierce and Marco Rathjen.
Comparison of pruning regimes for Stone pine (Pinus pinea L.) using a Functional- Structural Plant Model Peter Surovy.
Coordinated development of the architecture of the primary shoot in bush rose S. Demotes-Mainard*, G. Guéritaine*, R. Boumaza*, P. Favre*, V. Guérin*,
L systems (Aristid Lindenmayer)
L-systems Presented by Luv Kohli COMP258 October 30, 2002 Images copyright © 1992 D. Fowler, P. Prusinkiewicz, and J. Battjes.
3D Geometry for Computer Graphics. 2 The plan today Least squares approach  General / Polynomial fitting  Linear systems of equations  Local polynomial.
Modeling of Plants Josh Markwordt November 27, 2007.
Simulating Trees with Fractals and L-Systems Eric M. Upchurch CS 579.
The redistribution of auxin during gravitropism in maize roots.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Modeling Plant Form Is plant form an emergent property of simple module systems?
CS39N The Beauty and Joy of Computing Lecture #11 Recursion III It has been a challenge to power electronic components implanted within a body.
CS 563 Advanced Topics in Computer Graphics Rendering Plants by Cliff Lindsay.
Procedural Modelling of Cities Y.I.H. Parish & P. Müller Presentation by Ian Eborn and Anton Burger.
Understanding Plant Growth Regulators
Morphogenesis and Lindenmayer Systems (L-systems) Gabriela Ochoa
IlliDOL: A Framework for Exploration of L- Systems in Three Dimensions Vilas Dhar Math 198 Spring 2003.
Study of response uniformity of LHCb ECAL Mikhail Prokudin, ITEP.
Modelling of Ecosystems by Tools from Computer Science Summer School at Czech University of Life Sciences, Prague, September, 2013 Winfried Kurth.
Andrew Leeuwenberg.  Hypothesis & Aim  Methodology summary  Result  Discussion and Future work  Conclusion.
L-Systems and Procedural Plants CSE 3541 Matt Boggus.
College of Computer and Information Science, Northeastern UniversityOctober 13, CS U540 Computer Graphics Prof. Harriet Fell Spring 2007 Lecture.
The Artificial Life of Plants Przemyslaw Prusinkiewicz, Mark Hammel, Radom´ır Mˇech Department of Computer Science University of Calgary Calgary, Alberta,
Examining the World of Fractals. Myles Akeem Singleton Central Illinois Chapter National BDPA Technology Conference 2006 Los-Angeles, CA.
GATree: Genetically Evolved Decision Trees 전자전기컴퓨터공학과 데이터베이스 연구실 G 김태종.
Research Group of Plant & Vegetation Ecology Department of Biology, University of Antwerpen Some 20 people (16 scientists and 4 technical staff) Plant.
Computer-Generated Pen-and-Ink Illustration of Trees Oliver Deussen & Thomas Strothotte University of Magdeburg.
L-Systems Lindenmayer Systems Prusinkiewicz and Lindenmayer
Summer School „Modelling and Simulation with GroIMP“ / Tutorial for beginners University of Göttingen (Germany), September, 2010 Winfried Kurth Some.
Lindenmayer systems Martijn van den Heuvel May 26th, May 26th, 2011.
L-system and SVG 2D SVG Tree 2002/10/16.
Evolutionary Robotics Using A Formal Grammar To Evolve Robot Bodies and Brains Hornby, G.S., Pollack, J. (2001) Creating high-level components with a generative.
How to Draw a Tree L-Systems in Computer Graphics Steven Janke.
Breaks in Daily Climate Records Ralf Lindau University of Bonn Germany.
1 10/27/ :26 UML Simplicity in Complexity. 2 10/27/ :26 UML Rewriting Systems Classic Example: Koch 1905 Initiator Generator.
Modeling Morphogenesis in Multi-Cellular Systems (Complex Systems Project) Heather Koyuk Spring 2005 Other Team Members CS Student: Nick Armstrong Chemistry.
Procedural Modelling of Plant Scenes Presented by: Kim R 2 Supervisors:Shaun Bangay Adele Lobb A research project for Computer Science Honours 2004.
Tutorial and workshop „Modelling with GroIMP and XL“ / Tutorial for beginners University of Göttingen, 27 February, 2012 Winfried Kurth Introduction to.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Special Models.
LINDFERN Lindenmayer Systems in VPython Nick Langhammer.
Inductive Reasoning 1-2A What do you think are basic geometry figures?
Pruning Landscape Trees, Shrubs, and Palms
1 Simplification of Context-Free Grammars Some useful substitution rules. Removing useless productions. Removing -productions. Removing unit-productions.
2.5 Asexual reproduction in plants. Propagation  Asexual reproduction: Asexual reproduction is a mode of reproduction by which offspring arise from a.
Huffman’s Algorithm 11/02/ Weighted 2-tree A weighted 2-tree T is an extended binary tree with n external nodes and each of the external nodes is.
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
Integration of simulation tools in online virtual worlds Stéphane SIKORA AI Lab of Paris5 University 2nd conference on.
Graphplan: Fast Planning through Planning Graph Analysis Avrim Blum Merrick Furst Carnegie Mellon University.
Synthetic Division Find the remainder of f(x) when divided by x-a. ExFind the remainder of x 4 +2x 3 - 6x 2 +7x-13 when divided by x-2. Method 1Using.
1Electromagnetic Waves.  Administrative ◦ Quiz Today ◦ Review Exam Grades ◦ Review Exam  Begin Chapter 23 – Electromagnetic Waves  No 10:30 Office.
Functional-Structural Plant Modelling with GroIMP and XL Tutorial and Workshop at Agrocampus Ouest, Angers, 5-7 May, 2015 Winfried Kurth University of.
CHAPTER 35 PLANT STRUCTURE AND GROWTH Copyright © 2002 Pearson Education, Inc., publishing as Benjamin Cummings Section B1: The Process of Plant Growth.
Understanding Plant Life Cycles Reminder: student learning activities are at the end of this power point.
Animation of Plant Development Presented by Rich Honhart Paper by Prusinkiewicz, Hammel, and Mjolness.
5.5B – Synthetic Division. If I tell you that (x – 1) is a factor of the equation above, what does that tell you? x = 1 is a solution.
Chomsky Normal Form.
Genetic Programming Using Simulated Natural Selection to Automatically Write Programs.
Volumize3d Volumize3d Training Lesson 2 - Assembly.
Plant Hormones.
Grammars, L-Systems Jim Whitehead UC Santa Cruz School of Engineering courses.soe.ucsc.edu/courses/cmps265/Spring14/01 23 Apr 2014.
C4.5 - pruning decision trees
Image-based Tree Branch Recovery
Presentation transcript:

Synthetic Topiary

Premislaw Prunsinkiewicz (Prof. P) Mark James Radomír Měch

Synthetic Topiary Development in two directions: –structure-oriented models –space-oriented models

Synthetic Topiary Development in two directions: –structure-oriented models Endogenous : module inherits lineage at creation. Interactive : information flow.  Context-sensitive L-systems –space-oriented models

Synthetic Topiary Development in two directions: –structure-oriented models –space-oriented models exogenous : information transmitted from environment.

Synthetic Topiary Development in two directions: –structure-oriented models –space-oriented models Environmentally-sensitive L-systems address the dichotomy.

Lindenmayer systems Stochastic context-sensitive grammars. id : lc rc : cond  succ : prob –replace pred by succ with probability prob if pred has lc on the left and rc on the right and cond is true

Modules Each module controls a LOGO-style turtle. –F moves forward. –+-, &^, / \ are rotations around H, U, L. draws a sphere at current position. –% terminates a branch (e.g. pruning ) magnitude parameters are optional

Lindenmayer Systems Example: L-System 2 ω : A(1) B(3) A(5) p1: A(x)  A(x+1) : 0.4 p2: A(x)  B(x-1) : 0.6 p3: A(x) A(z) : y<4  B(x+z)[A(y)] A(1) B(3) A(5)

Lindenmayer Systems Example: L-System 2 ω : A(1) B(3) A(5) p1: A(x)  A(x+1) : 0.4 p2: A(x)  B(x-1) : 0.6 p3: A(x) A(z) : y<4  B(x+z)[A(y)] A(2) B(3) A(5)

Lindenmayer Systems Example: L-System 2 ω : A(1) B(3) A(5) p1: A(x)  A(x+1) : 0.4 p2: A(x)  B(x-1) : 0.6 p3: A(x) A(z) : y<4  B(x+z)[A(y)] B(7)[A(3)]

Lindenmayer Systems Example: L-System 2 ω : A(1) B(3) A(5) p1: A(x)  A(x+1) : 0.4 p2: A(x)  B(x-1) : 0.6 p3: A(x) A(z) : y<4  B(x+z)[A(y)] B(7)[B(2)]

Environmental Sensitivity Add a ‘query’ module to read the position. –?P(x,y) will assign the current position to x,y. –?H(h) will assign the H orientation to h. Allows parameter variation depending on external parameter. A?P(x,y) : (x²+y²)<10²  F(x²+y²) Example: L-System 3

Pruning Use ?P to find when to prune, % to do it. Example: L-system 4 –Dormant buds grow on the tree. –New branches grow if the ‘leading bud’ is cut. –Pruning function cut bud leaving a L*L cube.

A model of tree development Early works: A tree is a self-similar branching structure. –Led to unnatural exponential growth. Botanical model: A shoot is viable only if it receives enough light. –Leads to a more constrained branching ratio.

A model of tree development Hypotheses: –Start with a single non-branching shoot. –New shoots grow from buds near end of previous year’s segments. –There is a maximum branching ratio. –All branch segments have the same length. –Current year’s shoots grow leaves. –Leaves need light.

A model of tree development Consequences –Crown radius is Θ(age). –Available leaf area is Θ(age²). –Number of potential shoots is Θ(exp(age)) will get, in time, limited by available leaf area. Branching factor b age is thus b age = (2.age+1)/age² This produces L-system 5.

Putting all together : LS 6 ω: Axiom - start with a single apex, aged 1. P1: Growth - !pruned, branching. P2: Growth - !pruned, !branching, creates a bud. P3: Growth - pruned. P4: Creates growth signal S where P3 occured. P5,6: Propagate S to earlier buds. P7: S activate a new apex, with the right age. P8: Housekeeping - Age of the buds.

Conclusion Issues : –Defining the pruning volume equation. Use constructive geometry. Use ellipsoid skeletons. –Large number of primitives. Reuse via instantiation. –Characterizing plants and their reaction to pruning is non-trivial.

Conclusion It’s cool. Enough data to code the algorithm. –It’s all theory, maybe a fancy CS660 project ?