Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik - Serie 11 - Skript - Aufgabe 123 a // Prog: GlinskiOlaf1.cpp // Autor: O.Glinski (Gruppe L) // Draw turtle graphics for the Lindenmayer system with // production F -> FF+F+F+F+F+F-F, initial word F+F+F+F and // rotation angle 90 degrees. #include #include // POST: the word w_i^F is drawn void f (const unsigned int i) { if (i == 0) ifm::forward(); // F else { f(i-1); // w_{i-1}^F f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::right(90); // - f(i-1); // w_{i-1}^F } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n^F+w_n^F+w_n^F+w_n^F f(n); // w_n^F ifm::left(90); // + f(n); // w_n^F ifm::left(90); // + f(n); // w_n^F ifm::left(90); // + f(n); // w_n^F return 0; }