Original Post
I'm looking to generate some sort of procedural tree [that hopefully looks good]. The method that I'm thinking of would start with a base. Then, along a line, a cylinder would be created for some distance (the first distance could be predefined, or it could be random). Then, the tree will branch off. I'm kind of confused as to how one would implement this branching off. How would the polygons near the joint look for two branches? three branches? n branches? Are there any papers on this subject that explain how they implemented the polygonal part of such a system?













