Recursive Deciduous Trees

trees_answer.scad

/* [Tree] */

// Base size for trunk
size = 25; //[10:500]

// Depth of recursion (more depth, more complexity)
depth = 8; //[1:9]

// ratio of bottom of branch to previous branch
widthBottom = 0.25; //[0.1:0.05:1.2]

// ratio of top of branch to previous branch
widthTop = 0.18; //[0.1:0.05:1.2]

/*

Based on "Procedurally Generated Trees" by steveweber314 on instructables
http://www.instructables.com/id/Procedurally-Generated-Trees/

*/

linear_extrude(10) {
  branch(size = size, depth = depth);
}

module trapezoid(h = 10, bottom = 10, top = 5) {
  points=[[-bottom/2, 0], [bottom/2, 0], [top/2, h], [-top/2, h]];
  polygon(points);
}

module branch(size, depth, rotation) {
  trapezoid(h = size, bottom = size*widthBottom, top = size*widthTop);
  if (depth > 0) {      
    mod = rands(0.9,1,1)[0];
    translate([0, size, 0]){
      rotate([0, 0, -25])
      branch(size*0.8*mod, depth-1);
      
      rotate([0, 0, 25])
      branch(size*0.8*mod, depth-1);
    }
  }
}

trees_challenge.scad

/* [Tree] */

// Base size for trunk
size = 25; //[10:500]

// Depth of recursion (more depth, more complexity)
depth = 8; //[1:9]

// ratio of bottom of branch to previous branch
widthBottom = 0.25; //[0.1:0.05:1.2]

// ratio of top of branch to previous branch
widthTop = 0.18; //[0.1:0.05:1.2]

/*

Based on "Procedurally Generated Trees" by steveweber314 on instructables
http://www.instructables.com/id/Procedurally-Generated-Trees/

*/

linear_extrude(10) {
  branch(size = size, depth = depth);
}

module trapezoid(h = 10, bottom = 10, top = 5) {
  points=[[-bottom/2, 0], [bottom/2, 0], [top/2, h], [-top/2, h]];
  polygon(points);
}

module branch(size, depth, rotation) {
    // Draw current branch segment
    // If we have more segments to draw...
    // Move cursor up to top of current segment
    // Rotate left, draw branch and subbranches
    // Rotate right, draw branch and subbraches
}