At the end of this page, I give some references to tree-related topics.
The number given is the angle between branches. I have been able to compute the perfect reduction factor to use in each case. A page on that calculation is in order.
I'd like to write a Java program that could have your browser draw the trees for you, or go through an animated sequence. Dave Cassard produced a first attempt at this while enrolled in a Java programming class.
These trees are drawn on concentric circles using two different radius-functions. I.E., a reduction factor (Rf) is not applied to the length of the branches, but there is a relation between successive radii.
Done for John K. Richards in 1973, using a CalComp plotter. Will write story behind it some day. Copyright registered in 1970's.
Notation n[i|o][+|-]c)
n is number of sides to begin with,
i|o is direction (inward or outward),
c is the +/- integral change in then as you go inward or outward.
Paths of particle reflections ("bouncing around ") inside regular concave polygons. Originally conceived in 3D to explore internal reflection dynamics of pyramid structures. When that proved difficult, I dropped to 2D to see if any interesting things happen. First program for Triangles by Corey Hirsh. Generalized polygon program by myself. Debugged by Greg Davis!
I recently discovered that others have done math research on this exact subject.
Sorry for the bright colors.. will change background or something ASAP.
The number given is the angle of the initial ray, beginning at the center of the polygon.
See also February 23, 1996 Science: Self-Assembling Dendrimers, p 1095; Molecular Trees: A New Branch of Chemistry, p 1077. Both articles contain bibliographies.
Back to John Miller's Home Page
Created By: miller@lclark.edu