Indra's Pearl At this site, we will make available resources to enhance and illuminate the mathematics of the book Indra's Pearls, by David Mumford, Caroline Series and David Wright, published by Cambridge University Press.
Programing Kleinian Groups, but in Mapple
Drawing Limit Sets of Kleinian Groups Using Finite State Automata (1994) Greg McShane, John R. Parker, Ian Redfern.
"This paper, then, is to explain how finite-state automata can be used to draw pictures of limit sets of groups in the Maskit embedding for the punctured torus, and what factors influence the quality of the output. We have implemented these ideas in a C program, which we used to generate all the plots of limit sets shown here. Using the program on a desktop Sun IPC, a useful plot can be generated in a minute, and higher-quality plots in about an hour, corresponding to several million circle is being examined and several tens of thousand being plotted. On one of the University of Warwick's fast SparcServer 2000's, this time is reduced to a matter of minutes."