Header menu link for other important links
X
Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle
S DAS, P P GOSWAMI, S C NANDY
Published in -
2005
Volume: 3480
   
Pages: 827 - 837
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(n3 log m) respectively. © Springer-Verlag Berlin Heidelberg 2005.
About the journal
JournalLecture Notes in Computer Science
Publisher-
ISSN0302-9743