Minimum width color spanning annulus

Authors

Ankush Acharyya, Indian Statistical Institute, Kolkata
Subhas C. Nandy, Indian Statistical Institute, Kolkata
Sasanka Roy, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Theoretical Computer Science

Abstract

Given a set P={p1,p2,…,pn} of n points in [Figure presented] and each assigned with one of the given k distinct colors, we study the problem of finding the minimum width color spanning annulus of different shapes. Specifically, we consider the color spanning circular annulus (CSCA), axis-parallel square annulus (CSSA), axis parallel rectangular annulus (CSRA), and equilateral triangular annulus of fixed orientation (CSETA). The time complexities of the proposed algorithms for the respective problems are (i) O(n3log⁡n) for CSCA, (ii) O(n3+n2klog⁡k) for CSSA, (iii) O(n4) for CSRA, and (iv) O(n2k) for CSETA.

First Page

16

Last Page

30

DOI

10.1016/j.tcs.2017.11.031

Publication Date

5-16-2018

Comments

All Open Access, Bronze

Recommended Citation

Acharyya, Ankush; Nandy, Subhas C.; and Roy, Sasanka, "Minimum width color spanning annulus" (2018). Journal Articles. 1386.
https://digitalcommons.isical.ac.in/journal-articles/1386