Date: 26 Jun 2005

Smallest enclosing disks (balls and ellipsoids)

* Final gross prices may vary according to local VAT.

Get Access


A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementation are presented.

Work partially supported by the ESPRIT II Basic Research Action Program of the EC under contract no. 3075 (project ALCOM)