Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle

Authors:
Sandip Das;Partha P. Goswami;Subhas C. Nandy
Affiliations:
Indian Statistical Institute, Calcutta, India;Calcutta University, Calcutta, India;Indian Statistical Institute, Calcutta, India
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Year:
2005

Citing 2
Cited 2

Widest-corridor problems

Nordic Journal of Computing
Smallest Color-Spanning Objects

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

Algorithms for interval structures with applications

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Algorithms for interval structures with applications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of n colored points with a total of m (≥ 3) colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithms for the problems (i) and (ii) run in time O(n2logn) and O(n3logm) respectively.