There has been a renewal of interest in data structures for range extremum queries. In such problems, the input comprises N points, which are either elements of a d-dimensional matrix, that is, their coordinates are specified by the 1D submatrices they lie in (row and column indices for d = 2), or they are points in ℝd. Furthermore, associated with each point is a priority that is independent of the point's coordinate. The objective is to pre-process the given points and priorities to answer the range maximum query (RMQ): given a d-dimensional rectangle, report the points with maximum priority. The objective is to minimze the space used by the data structure and the time taken to answer the above query. This talk surveys a number of recent developments in this area, focussing on the cases d = 1 and d = 2. © 2012 Springer-Verlag.
CITATION STYLE
Raman, R. (2012). Range extremum queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7643 LNCS, pp. 280–287). https://doi.org/10.1007/978-3-642-35926-2_30
Mendeley helps you to discover research relevant for your work.