Color-spanning localized query

Authors

Ankush Acharyya, Academy of Sciences of the Czech Republic
Anil Maheshwari, Carleton University
Subhas C. Nandy, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Theoretical Computer Science

Abstract

Let P be a set of n points, where each point is colored with one of the k possible colors. We present efficient algorithms to preprocess 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.

First Page

85

Last Page

101

DOI

10.1016/j.tcs.2021.02.013

Publication Date

3-12-2021

Comments

Open Access, Green

Recommended Citation

Acharyya, Ankush; Maheshwari, Anil; and Nandy, Subhas C., "Color-spanning localized query" (2021). Journal Articles. 2033.
https://digitalcommons.isical.ac.in/journal-articles/2033