Smallest enclosing disks (balls and ellipsoids)

  • Emo Welzl
Conference paper

DOI: 10.1007/BFb0038202

Part of the Lecture Notes in Computer Science book series (LNCS, volume 555)
Cite this paper as:
Welzl E. (1991) Smallest enclosing disks (balls and ellipsoids). In: Maurer H. (eds) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol 555. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Emo Welzl
    • 1
  1. 1.Institut für InformatikFreie Universität BerlinBerlin 33Germany

Personalised recommendations