The algorithm presented has been rigorously tested for various sets of data points obtained both from digital images and randomly. In all experiments conducted, without even a rare exception, it converged in exactly two iterations. The conjecture is that the algorithm has a linear time complexity.

Additional Metadata
Conference Proceedings - Twenty-Third Annual Allerton Conference on Communication, Control and Computing.
Citation
Oommen, J. (1985). POSSIBLY LINEAR MINIMUM SPANNING CIRCLE ALGORITHM. In Proceedings - Annual Allerton Conference on Communication, Control, and Computing (pp. 506–507).