A fast deterministic smallest enclosing disk approximation algorithm

@article{Nielsen2005AFD,
  title={A fast deterministic smallest enclosing disk approximation algorithm},
  author={Frank Nielsen and Richard Nock},
  journal={Inf. Process. Lett.},
  year={2005},
  volume={93},
  pages={263-268}
}
We describe a simple and fast O (n log2 1 ε )-time algorithm for finding a(1+ ε)-approximation of the smallest enclosing di of a planar set of n points or disks. Experimental results of a readily available implementation are presented.  2004 Elsevier B.V. All rights reserved.