Carleton University
Technical Report TR-65
October 1984
An Extremely Fast Minimum Spanning Circle Algorithm
B.J. Oommen
Abstract
We consider the century old problem of finding the Minimum Spanning Circle (MSC) of N points in the plane. We propose a computational scheme which incorporates the ideas which motivate three of the best algorithms known. The technique converges in finite time and is extremely fast.