+61480015851
Graphic Designing - Turtle Graphics - Haskell - LOGO Programming Assessment Answer
Download Solution
Order New Solution
Internal Code: 6CIEA
Graphic Designing Assessment Answer
Assignment Task:Turtle Graphics Haskell
In this assignment, you will explore another way of thinking about graphics, inspired by the robotic “turtles” that some of you might associate with the LOGO programming language. You can think of the turtle as a machine with a pen, that sits on a sheet of paper. As it moves around the page, it drags the pen along the paper to draw pictures. You will be writing Haskell to generate instructions for a virtual turtle, and writing more Haskell to interpret these instructions into a CodeWorld Picture. Task 1: Define the following two functions in src/Turtle.hs: triangle :: Double -> [TurtleCommand] Returns a list of commands that will draw an equilateral triangle with side length equal to the argument. The turtle should finish with the same position and facing as when it started. polygon :: Int -> Double -> [TurtleCommand] polygon n s should return a list of commands that will draw a regular n-sided polygon, with side length equal to s. The turtle should finish with the same position and facing as when it started. If n < 3, raise an error. Task 2: Define a function runTurtle:: [TurtleCommand] -> Picture in src/Turtle.hs, which interprets the [TurtleCommand] according to the rules laid out in the “Turtles and the TurtleCommand” section above. Assume that the turtle starts at (0, 0), facing north (straight up), with the pen down (on the paper). Task 3A: Sierpinski’s Triangle - Direct Drawing (COMP1100 only) Sierpinski’s Triangle is a famous fractal (self-similar structure). We can generate approximations to Sierpinski’s Triangle using the following rules:- An approximation at depth 1 is a single equilateral triangle. 2. An approximation at depth n is made up of three approximations at depth n - 1, with their side length reduced by half. These approximations are arranged to cover the original triangle.
- An alphabet of symbols. 2. An initial string, consisting of symbols from that alphabet. 3. A production rule which we apply to every symbol, to derive the next generation. If our rule does not mention a symbol, we send that symbol to itself.
- Define machinery for describing and interpreting L-Systems in src/Turtle.hs:
- Use your L-System machinery to generate an approximation to Sierpinski’s Triangle, according to the rules given in the example above. In src/Turtle.hs, define:
- Use your L-System machinery to produce your own picture. Find (or invent) an L-System which can be interpreted to produce a picture that pleases you. Define:
This Graphic Designing Assessment has been solved by our Graphic Designing experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.