论文信息 - Planar Maximum Box Problem

Planar Maximum Box Problem

Given two finite sets of points X+ and X− in ℝd, the maximum box problem asks to find an axis-parallel box B such that B∩X−=∅ and the total number of points from X+ covered is maximized. In this paper we consider the version of the problem for d = 2 (and find the smallest solution box). We present an O(n3 log4n) runtime algorithm, thus improving previously best known solution by almost quadratic factor.

Michael Segal

[1] Peter L. Hammer,et al. Pareto-optimal patterns in logical analysis of data , 2004, Discret. Appl. Math..

[2] Ying Liu,et al. The Maximum Box Problem and its Application to Data Analysis , 2002, Comput. Optim. Appl..

[3] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[4] Dimitrios Gunopulos,et al. Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning , 1996, J. Comput. Syst. Sci..

[5] Donald B. Johnson,et al. Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

[6] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[7] Herbert Edelsbrunner,et al. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.