Article ID Journal Published Year Pages File Type
10331421 Information Processing Letters 2005 6 Pages PDF
Abstract
We describe a simple and fast O(nlog21ɛ)-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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A fast deterministic smallest enclosing disk approximation algorithm
Authors
, ,