Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by a combinatorial edge flip to be continuously deformed from one to the other while maintaining tangencies across all of their common edges. Starting from a canonical tangency circle packing with the desired number of circles a finite sequence of flip-and-flow operations may be applied to obtain a circle packing for any desired (proper) contact graph with the same number of circles.

In this talk, I will show how to extend the Connelly-Gortler method to allow circles to overlap by angles up to $\pi/2$. This results in a new proof of the general Koebe-Andre’ev-Thurston theorem for disk packings on $S^2$ with overlaps and a numerical algorithm for computing them. The development makes use of the correspondence between circles and disks on $S^2$ and hyperplanes and half-spaces in the 4-dimensional Minkowski spacetime $R^{(1,3)}$. Along the way I will generalize a notion of convexity of circle polyhedra that has recently been used to prove the global rigidity of certain circle packings and use this view to show that all convex circle polyhedra are infinitesimally rigid, generalizing a recent related result.