The Maximum Box Problem for moving points in the plane
- First Online:
- 81 Downloads
Given a set R of r red points and a set B of b blue points in the plane, the static version of the Maximum Box Problem is to find an isothetic box H such that H∩R=∅ and the cardinality of H∩B is maximized. In this paper, we consider a kinetic version of the problem where the points in R∪B move along bounded degree algebraic trajectories. We design a compact and local quadratic-space kinetic data structure (KDS) for maintaining the optimal solution in O(rlog r+rlog b+b) time per each event. We also give an algorithm for solving the more general static problem where the maximum box can be arbitrarily oriented. This is an open problem in Aronov and Har-Peled (SIAM J. Comput. 38:899–921, 2008). We show that our approach can be used to solve this problem in O((r+b)2(rlog r+rlog b+b)) time. Finally we propose an efficient data structure to maintain an approximated solution of the kinetic Maximum Box Problem.
KeywordsPattern recognition Maximum Box Problem Kinetic data structure
Unable to display preview. Download preview PDF.
- Bonnet P, Gehrke J, Seshadri P (2001) Towards sensor database systems. In: Proc of the second international conf on mobile data management, Hong Kong. Lecture notes comp sci, vol 1987, pp 3–14 Google Scholar
- Guibas LJ (1998) Kinetic data structures: a state of the art report. In: Robotics: the algorithmic perspective. AK Peters, Wellesley, pp 191–209 Google Scholar
- Liu Y, Nediak M (2003) Planar case of the Maximum Box and related problems. In: Proc Canad conf comp geom, Halifax, Nova Scotia, August 11–13 (2003) Google Scholar