Circle packings are often used as a framework for drawing knot diagrams. In this thesis, the process of drawing knot diagrams is generalized to drawing theta curve diagrams. Planar diagram encodings of knots are described and generalized for theta curve diagrams. A generalized procedure for converting the PD-code of a theta curve diagram into the original diagram is described and implemented. The algorithm is divided into three key components. The first component involves parsing the PD-code and representing individual parts of the original diagram and their relations as an abstract graph. The second component involves representing parts of the diagram and their relations in the plane with circle packing. The third component involves drawing circular arcs within the packing, which together form the final diagram. The algorithm is implemented in Python and is used to draw planar diagrams of theta curves with up to seven crossings.
|
