We consider how to preprocess n colored points in the plane such that later, given a multiset of colors, we can quickly find an axis-aligned rectangle containing a subset of the points with exactly those colors, if one exists. We first give an index that uses o(n4) space and o (n) query time when there are O(1) distinct colors. We then restrict our attention to the case in which there are only two distinct colors. We give an index that uses O(n) bits and O(1) query time to detect whether there exists a matching rectangle. Finally, we give a O(n)-space index that returns a matching rectangle, if one exists, in O(lg2n/lg lg n) time. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Durocher, S., Fraser, R., Gagie, T., Mondal, D., Skala, M., & Thankachan, S. V. (2014). Indexed geometric jumbled pattern matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8486 LNCS, pp. 110–119). Springer Verlag. https://doi.org/10.1007/978-3-319-07566-2_12
Mendeley helps you to discover research relevant for your work.