Abstract
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.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Volume | 8486 |
Pages (from-to) | 110-119 |
Number of pages | 10 |
ISSN | 0302-9743 |
Publication status | Published - 2014 |
Keywords
- Computational geometry
- Data structures
- Color query problem
- Range searching
- Plane point location