Minimum width color spanning annulus
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
Given a set P of n points in ℝ2, each assigned with one of the k distinct colors, we study the problem of finding the minimum width color spanning annulus of different shapes. Specifically, we consider the circular annulus (CSCA) and axis-parallel square annulus (CSSA). The time and space complexities of the proposed algorithms for both the problems are O(n4 log n) and O(n), respectively.
First Page
431
Last Page
442
DOI
10.1007/978-3-319-42634-1_35
Publication Date
1-1-2016
Recommended Citation
Acharyya, Ankush; Nandy, Subhas C.; and Roy, Sasanka, "Minimum width color spanning annulus" (2016). Conference Articles. 747.
https://digitalcommons.isical.ac.in/conf-articles/747
