Abstract
Let S be a set of n points on the plane in general position such that its elements are colored red or blue. We study the following problem: Find a largest subset of S which can be enclosed by the union of two, not necessarily disjoint, axis-aligned rectangles R and B such that R ( resp. B ) contains only red ( resp. blue) points. We prove that this problem can be solved in O ( n 2 log n ) time and O ( n ) space. Our approach is based on solving some instances of Bentley's maximum-sum consecutive subsequence problem. We introduce the first known data structure to dynamically maintain the optimal solution of this problem. We show that our techniques can be used to efficiently solve a more general class of problems in data analysis.
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.
