Stabbing Colors in One Dimension
2017 Data Compression Conference (DCC)(2017)
摘要
Given n horizontal segments, each associated with a color from [σ], the Categorical Segment Stabbing problem is to find the distinct K colors stabbed by a vertical line. When the end-points of the segments are distinct and lie in [1, 2n], we present an (2 + ε)n log σ + O(n)-bit index with O(K/ε) query time, where ε∈ (0, 1].When the end-points are arbitrary real numbers, a standard reduction to the above scenario improves the existing bounds of Janardan and Lopez. We also present results for few other variations: • reporting the top-k colors that are stabbed, where each color has a fixed priority. • handling these scenarios when the given segments form a tree range.
更多查看译文
关键词
categorical segment stabbing problem,query time,tree range,horizontal segments,colors stabbing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络