Searching for Frequent Colors in Rectangles

Simple item page
dc.creatorKarpinski, Marek
dc.creatorNekrich, Yakov
dc.date2008-05-09
dc.date.accessioned2026-07-07T09:38:02Z
dc.date.available2026-07-07T09:38:02Z
dc.descriptionWe study a new variant of colored orthogonal range searching problem: given a query rectangle $Q$ all colors $c$, such that at least a fraction $τ$ of all points in $Q$ are of color $c$, must be reported. We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.
dc.identifierhttps://arxiv.org/abs/0805.1348
dc.identifierhttp://arxiv.org/abs/0805.1348
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160667
dc.subjectData Structures and Algorithms
dc.subjectComputational Geometry
dc.titleSearching for Frequent Colors in Rectangles
dc.typetext

Files

Collections

arXiv