Back to Search
Start Over
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.
- Source :
- Computational Science & Its Applications - ICCSA 2005; 2005, p827-837, 11p
- Publication Year :
- 2005
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540258605
- Database :
- Supplemental Index
- Journal :
- Computational Science & Its Applications - ICCSA 2005
- Publication Type :
- Book
- Accession number :
- 32886612
- Full Text :
- https://doi.org/10.1007/11424758_85