Computing Publications

Publications Home » Efficient Pythagorean trees: Gree...

Efficient Pythagorean trees: Greed is good

Cameron Browne

Journal Article
Computers & Graphics
Volume 31
Issue 4
pp.610–616
December, 2007
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.

PDF of full publication (1.2 megabytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.