A fast deterministic smallest enclosing disk approximation algorithm

Frank Nielsen, Richard Nock

Abstract: We describe a simple and fast O ( n log 2 1 ɛ ) -time algorithm for finding a ( 1 + ɛ ) -approximation of the smallest enclosing disk of a planar set of n points or disks. Experimental results of a readily available implementation are presented.