Thurston's algorithm and rational maps from quadratic polynomial matings (Q2305705)

The goal of this paper is to develop an iterative method for obtaining rational maps from postcritically finite quadratic matings using finite subdivision rules and the Thurston's algorithm. The author proves that the output of her iterative algorithm determines an approximation of the desired rational map, and highlights situations in which her algorithm extends a similar technique, called the Medusa algorithm. She provides a proof of the algorithm's efficiency, details on its implementation, the settings in which it is most successful, and examples.