New Results and New Trends in Computer Science

Volume 555 of the series Lecture Notes in Computer Science pp 359-370


Smallest enclosing disks (balls and ellipsoids)

  • Emo WelzlAffiliated withInstitut für Informatik, Freie Universität Berlin

* 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.