Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Finding k points with a smallest enclosing square

Smid, Michiel

MPI-I-92-152. November 1992, 8 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
An algorithm is presented that, given a set of $n$ points in
the plane and an integer $k$, $2 \leq k \leq n$,
finds $k$ points with a smallest enclosing
axes-parallel square. The algorithm has a running time of
$O(n \log n + kn \log^{2} k)$ and uses $O(n)$ space.
The previously best known algorithm for this problem takes
$O(k^{2} n \log n)$ time and uses $O(kn)$ space.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-152.pdfMPI-I-92-152.pdf6669 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Smid, Michiel},
  TITLE = {Finding k points with a smallest enclosing square},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-152},
  MONTH = {November},
  YEAR = {1992},
  ISSN = {0946-011X},