de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Finding k points with a smallest enclosing square

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-93-116.pdf
(beliebiger Volltext), 72KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Smid, M.(1993). Finding k points with a smallest enclosing square (MPI-I-93-116). Saarbrücken: Max-Planck-Institut für Informatik.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B3F8-4
Zusammenfassung
Let $S$ be a set of $n$ points in $d$-space, let $R$ be an axes-parallel hyper-rectangle and let $1 \leq k \leq n$ be an integer. An algorithm is given that decides if $R$ can be translated such that it contains at least $k$ points of $S$. After a presorting step, this algorithm runs in $O(n)$ time, with a constant factor that is doubly-exponential in~$d$. Two applications are given. First, a translate of $R$ containing the maximal number of points can be computed in $O(n \log n)$ time. Second, a $k$-point subset of $S$ with minimal $L_{\infty}$-diameter can be computed, also in $O(n \log n)$ time. Using known dynamization techniques, the latter result gives improved dynamic data structures for maintaining such a $k$-point subset.