颜色跨越本地化查询
Color spanning Localized query
摘要:
设P是一个由n个点组成的集合,每个点用k种可能的颜色之一着色。我们提出了有效的算法来预处理P,使得对于给定的查询点q,我们可以快速识别包含q的所需类型的最小颜色跨越对象。在本文中,我们专注于(i)间隔,(ii)轴平行的正方形,(iii)轴平行的矩形,(iv)等边三角形的固定方向和(v)圆,作为我们想要的类型的对象。
英文摘要:
Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q, we can quickly identify the smallest color spanning object of the desired type containing q. In this paper, we focus on (i) intervals, (ii) axis-parallel square, (iii) axis-parallel rectangle, (iv) equilateral triangle of fixed orientation and (v) circle, as our desired type of objects.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。