Color spanning Localized query
Computational Geometry
2019-05-14 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1905.05066,
title = {Color spanning Localized query},
author = {Ankush Acharyya and Anil Maheshwari and Subhas C. Nandy},
journal= {arXiv preprint arXiv:1905.05066},
year = {2019}
}
Comments
A preliminary version of the paper appeared in the proceedings of 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019