Abstract
The Pythagorean tree is a fractal figure with a branching structure based upon the Pythagorean theorem. This paper describes the use of a greedy algorithm to encourage a homogenous spread of detail for asymmetrical trees and avoid localized regions of high detail. A model of prioritized branch growth based on this idea is used to optimize tree shape, allowing more visually interesting trees to be grown using significantly fewer segments. A comparison of the fractal dimension of the resulting shapes supports the general success of this approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
