A fast deterministic smallest enclosing disk approximation algorithm

Authors:
Frank Nielsen;Richard Nock
Affiliations:
Sony Computer Science Laboratories Inc., 3-14-13 Higashi Gotanda, Shinagawa-Ku, 141-0022 Tokyo, Japan;Université des Antilles-Guyane, Campus de Schoelcher, Departement Scientifique Interfacultaire, BP 7209, Schoelcher (Martinique) 97233, France
Venue:
Information Processing Letters
Year:
2005

Citing 2
Cited 0

An efficient bounding sphere

Graphics gems
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.91

Visualization

Abstract

We describe a simple and fast O(n log2 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.