The circle packing theorem (Koebe–Andreev–Thurston theorem) claims for a planar graph, we can pack disjoint circles, such that: the circles correspond to vertices and the disks are tangent if the vertices are adjacent.
I would like to implement this algorithm in computer code (input: graph, output: circle packing). Where can I find a readable (not too complex) version of the procedure? I do not need the theory behind it. I know it has been implemented (e.g. in KnotTheory package in Mathematica), but I'm interested in the algorithm itself, not a software that does it.