max planck institut
informatik

# MPI-I-92-152

## 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.
Acknowledgement:
References to related material:

MPI-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: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-152
BibTeX
@TECHREPORT{Smid92,
AUTHOR = {Smid, Michiel},
TITLE = {Finding k points with a smallest enclosing square},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},