Colored Range Searching
Colored Range Searching is a computational geometry problem in which a set of colored points is preprocessed into a data structure to efficiently report or count the distinct colors present within a specified query range.
6
Publications
136
Citations
15
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
6
Efficient Colored Orthogonal Range Counting
Haim Kaplan, Natan Rubin, Micha Sharir et al. · SIAM Journal on Computing · 2008 · 41 citations
Colored range queries and document retrieval
Travis Gagie, Juha Kärkkäinen, Gonzalo Navarro et al. · Theoretical Computer Science · 2012 · 33 citations · Full text
Searching for Frequent Colors in Rectangles
Marek Karpiński, Yakov Nekrich · ArXiv.org · 2008 · 16 citations · Full text
Robust object tracking using an adaptive color model
Gijeong Jang, In-So Kweon · 2002 · 13 citations
1–5 of 6
15
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
8
University of Chile
Santiago, Chile
1 h-index
1 publications
33 citations
University of Bonn
Bonn, Germany
1 h-index
2 publications
32 citations

City University of Hong Kong
Hong Kong, Hong Kong
1 h-index
3 publications
33 citations
Aalto University
Espoo, Finland
1 h-index
1 publications
33 citations
University of Kansas
Lawrence, United States
1 h-index
1 publications
22 citations

University of Helsinki
Helsinki, Finland
1 h-index
1 publications
33 citations
King's College London
London, United Kingdom
1 h-index
1 publications
33 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
1 h-index
2 publications
26 citations
1–8 of 8
TODS · 1 publications · 22 citations
1
h-index
Repository · 1 publications · 16 citations
1
h-index
1 publications · 33 citations
1
h-index
1 publications · 41 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5