Colored Range Searching in Linear Space

In colored range searching, we are given a set of n colored points in d ≥ 2 dimensions to store, and want to support orthogonal range queries taking colors into account. In the colored range counting problem, a query must report the number of distinct colors found in the query range, while an answer to the colored range reporting problem must report the distinct colors in the query range.

[1]  Kasper Green Larsen,et al.  Near-Optimal Range Reporting Structures for Categorical Data , 2013, SODA.

[2]  Arne Andersson.  General Balanced Trees , 1999, J. Algorithms.

[3]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[4]  Michiel H. M. Smid,et al.  Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1995, J. Algorithms.

[5]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[6]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[7]  Haim Kaplan,et al.  Counting colors in boxes , 2007, SODA '07.

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

[9]  Kasper Green Larsen,et al.  I/O-efficient data structures for colored range and prefix reporting , 2012, SODA.

[10]  Joseph JaJa,et al.  Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines , 2005 .

[11]  Mihai Patrascu.  Lower bounds for 2-dimensional range counting , 2007, STOC '07.

[12]  Panayiotis Bozanis,et al.  New Upper Bounds for Generalized Intersection Searching Problems , 1995, ICALP.

[13]  Michiel H. M. Smid,et al.  A Technique for Adding Range Restrictions to Generalized Searching Problems , 1997, Inf. Process. Lett..

[14]  Giuseppe F. Italiano,et al.  Algorithms – ESA 2013 , 2013, Lecture Notes in Computer Science.

[15]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[16]  Dan E. Willard.  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) , 1983, Inf. Process. Lett..

[17]  Jeffrey Scott Vitter,et al.  Optimal Color Range Reporting in One Dimension , 2013, ESA.

[18]  Yakov Nekrich.  Efficient range searching for categorical and plain data , 2014, TODS.

[19]  Yakov Nekrich.  Space-efficient range reporting for categorical data , 2012, PODS '12.

[20]  Rajeev Raman,et al.  Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.

[21]  Joseph JáJá,et al.  Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.

[22]  Yakov Nekrich.  Orthogonal range searching in linear and almost-linear space , 2009, Comput. Geom..

[23]  Gonzalo Navarro,et al.  Colored range queries and document retrieval , 2013, Theor. Comput. Sci..

[24]  Mario A. López,et al.  Generalized intersection searching problems , 1993, Int. J. Comput. Geom. Appl..

[25]  Pankaj K. Agarwal,et al.  Range Searching in Categorical Data: Colored Range Searching on Grid , 2002, ESA.

[26]  Kurt Mehlhorn,et al.  Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space , 1990, Information Processing Letters.