This package implements several algorithms related to complex quadratic dynamics.
- The spider algorithm calculates the center of a hyperbolic component of the Mandelbrot set from one of its external angles. Read about the spider algorithm.
- The external angles of a hyperbolic component can be calculated from an angled internal address, describing the path to this component from zero. Read about internal addresses.
- A combinatorial description of a Hubbard trees can be generated from a kneading sequence, and when oriented in the plane can produce external angles. Read about Hubbard trees.
This package is a work in progress. To see what it can do, run treeplot(theta) where theta is a rational number with an odd denominator. The external ray of the Mandelbrot set with angle theta lands at a hyperbolic component, and this will plot the Hubbard tree corresponding to this hyperbolic component. Note that in Julia, rational numbers are declared with two slashes, as "3//5".
