Enclosing k points in the smallest axis parallel rectangle
References (8)
- et al.
Finding k points with minimum diameter and related problems
J. Algorithms
(1991) L-infinity interdistance selection by parametric search
Inform. Process. Lett.
(1989)Combinatorial Search
- et al.
On some geometric selection and optimization problems via sorted matrices
There are more references available in the full text version of this article.
Cited by (37)
Expected size of random Tukey layers and convex layers
2022, Computational Geometry: Theory and ApplicationsFinding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
2019, Computational Geometry: Theory and ApplicationsComputing a minimum-width square or rectangular annulus with outliers
2019, Computational Geometry: Theory and ApplicationsCovering points by disjoint boxes with outliers
2011, Computational Geometry: Theory and ApplicationsAlgorithms for optimal outlier removal
2009, Journal of Discrete AlgorithmsUncertainty-aware blob detection with an application to integrated-light stellar population recoveries
2023, Astronomy and Astrophysics
- 1
Work by Klara Kedem has been supported by a grant from the U.S.-Israeli Binational Science Foundation, and by a grant from the Israel Science Foundation founded by The Israel Academy of Sciences and Humanities.
Copyright © 1998 Published by Elsevier B.V.