Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
