lankagege / htree Goto Github PK
View Code? Open in Web Editor NEWThis project forked from jdluk87/htree
The H tree (so called because its repeating pattern resembles the letter "H") is a family of fractal sets whose Hausdorff dimension is equal to 2. They can be constructed by starting with a line segment of arbitrary length, drawing two shorter segments at right angles to the first through its endpoints, and continuing in the same vein, reducing (dividing) the length of the line segments drawn at each stage by √2.