15
5
What I would like to see is a fractal tree being drawn where the you can input an integer, and the output will be a fractal tree with the entered amount of branch steps.
Rules:
- The fractal should be a line fractal tree:
- the shape of the fractal should also be the same as this picture.
- Each branch should decrease by 25% in width for each time it splits
- The final layer of branches should be an 1px wide line
- Shortest code wins
Tip: this site might be useful.
Can this tree be made with leaves ? – None – 2015-09-19T15:59:07.860
@w4nteD The challenge of course does not specify any leaves, but I daresay they would be fairly easy to add to most of these programs. After the recursion decides to return, draw a leaf before returning. The current branch angle will be available for orientation. You could draw a leaf shape in the same direction, or maybe two at slight angles similar to the branching. – luser droog – 2015-09-19T17:30:21.357
2This question seems different enough from "Sorry, young man..." and I'm voting to reopen. For one, this doesn't require an L-system, and it is more precise in its description of the output. Answers to the other aren't necessarily the best answers here. – luser droog – 2014-01-18T22:09:53.893
If there's no new answers in the next day, I'll mark the shortest code as accepted. – joeytje50 – 2014-01-23T14:20:26.617