Abstract
We define the range 1 query (R1Q) problem as follows. Given a d-dimensional (d ≥ 1) input bit matrix A, preprocess A so that for any given region \(\mathcal{R}\) of A, one can efficiently answer queries asking if \(\mathcal{R}\) contains a 1 or not. We consider both orthogonal and non-orthogonal shapes for \(\mathcal{R}\) including rectangles, axis-parallel right-triangles, certain types of polygons, and spheres. We provide space-efficient deterministic and randomized algorithms with constant query times (in constant dimensions) for solving the problem in the word RAM model. The space usage in bits is sublinear, linear, or near linear in the size of A, depending on the algorithm.
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.
