We describe a simple and fast O(n log2 1/e)-time algorithm for finding a (1 + e)-approximation of the smallest enclosing disk of a planar set of n points or disks. Experimental results of a readily available implementation are presented.
['Frank Nielsen', 'Richard Nock']
A fast deterministic smallest enclosing disk approximation algorithm