Back to Search
Start Over
Color spanning Localized query
- Publication Year :
- 2019
-
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.<br />Comment: A preliminary version of the paper appeared in the proceedings of 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019
- Subjects :
- Computer Science - Computational Geometry
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1905.05066
- Document Type :
- Working Paper