Enclosing k points in the smallest axis parallel rectangle

Information Processing Letters

Volumn 65, Issue 2, 1998, Pages 95-99

  Segal, Michael ^a   Kedem, Klara ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Algorithms; Axis parallel; Computational geometry; Optimization

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; DATA PROCESSING; OPTIMIZATION;

AXIS PARALLEL; AXIS PARALLEL RECTANGLES; CLUSTERING PROBLEMS; D-DIMENSIONAL SPACES; K POINTS; K-VALUES; RUNTIMES;

COMPUTATIONAL GEOMETRY;

EID: 0348194471     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00212-3     Document Type: Article

References (8)

1. M. Aigner, Combinatorial Search, Wiley-Teubner Series in CS, John Wiley and Sons, New York, 1988.
2. A. Aggarwal, H. Imai, N. Katoh, S. Sun, Finding k points with minimum diameter and related problems, J. Algorithms 12 (1991) 38-56.
3. A. Glozman, K. Kedem, G. Shpitalnik, On some geometric selection and optimization problems via sorted matrices, Lecture Notes in Computer Science, vol. 955, Springer, Berlin, 1995, pp. 26-35.
4. A. Datta, H.-P. Lenhof, C. Schwarz, M. Smid, Static and dynamic algorithms for k-point clustering problems, Lecture Notes in Computer Science, vol. 709, Springer, Berlin, 1993, pp. 265-276.
5. D. Eppstein, J. Erickson, Iterated nearest neighbors and finding minimal polytopes, Discrete Comput. Geom. 11 (1994) 321-350.
6. G. Frederickson, D. Johnson, Generalized selection and ranking: Sorted matrices, SIAM J. Comput. 13 (1984) 14-30.
7. J. Matoušek, On geometric optimization with few violated constraints, Discrete Comput Geom. 14 (1995) 365-384.
8. J.S. Salowe, L-infinity interdistance selection by parametric search, Inform. Process. Lett. 30 (1989) 9-14.