Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle

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.

[1]  Anil Maheshwari,et al.  Approximate Shortest Descent Path on a Terrain , 2007, CCCG.

[2]  Sandip Das,et al.  Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks , 2004, HiPC.

[3]  Sandip Das,et al.  Covering a Set of Points in a Plane Using Two Parallel Rectangles , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[4]  Rolf Klein,et al.  Smallest Color-Spanning Objects , 2001, ESA.

[5]  Bhargab B. Bhattacharya,et al.  Channel routing in Manhattan-diagonal model , 1996, Proceedings of 9th International Conference on VLSI Design.

[6]  Sandip Das,et al.  An Improved Algorithm for Point Set Pattern Matching under Rigid Motion , 2003, CIAC.

[7]  Franco P. Preparata,et al.  Widest-Corridor Problems , 1994, Nord. J. Comput..

[8]  Subhas C. Nandy,et al.  Largest Empty Rectangle among a Point Set , 1999, FSTTCS.

[9]  B.B. Bhattacharya,et al.  Routing of L-shaped channels, switchboxes and staircases in Manhattan-diagonal model , 1998, Proceedings Eleventh International Conference on VLSI Design.

[10]  Sandip Das,et al.  Smallest k point enclosing rectangle of arbitrary orientation , 2004, CCCG.

[11]  Sandip Das,et al.  Synthesis of symmetric functions for path-delay fault testability , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Sandip Das,et al.  Shortest monotone descent path problem in polyhedral terrain , 2005, Comput. Geom..

[13]  Sandip Das,et al.  A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface , 2004, ICCSA.

[14]  S. Sur-Kolay,et al.  Fast FPGA placement using space-filling curve , 2005, International Conference on Field Programmable Logic and Applications, 2005..

[15]  Sandip Das,et al.  Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone , 2005, ICDCIT.

[16]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..

[17]  Malay K. Sen,et al.  Chronological Orderings of Interval Digraph , 2003, Electron. Notes Discret. Math..

[18]  Boaz Ben-Moshe,et al.  Computing a planar widest empty -siphon in o(n 3 ) time , 2007 .

[19]  Sandip Das,et al.  An improved heuristic algorithm for over-the-cell channel routing , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[20]  Robert Benkoczi,et al.  Collection depot location problem in the plane , 2005, CCCG.

[21]  Sandip Das,et al.  Optimal algorithm for a special point-labeling problem , 2002, Inf. Process. Lett..

[22]  Sandip Das,et al.  Placing a Given Number of Base Stations to Cover a Convex Region , 2005, IWDC.

[23]  Sandip Das,et al.  Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment , 2007, CCCG.

[24]  Sandip Das,et al.  Variations of Base-Station Placement Problem on the Boundary of a Convex Region , 2008, Int. J. Found. Comput. Sci..

[25]  Sandip Das,et al.  Homogeneously Representable Interval Bigraphs , 2003, Electron. Notes Discret. Math..

[26]  Sandip Das,et al.  Via Minimization in channel Routing by Layout Modification , 1993, The Sixth International Conference on VLSI Design.

[27]  Sandip Das,et al.  Optimal Guard Placement Problem Under L-Visibility , 2006, ICCSA.

[28]  Sandip Das,et al.  Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D , 2002, SWAT.

[29]  Sandip Das,et al.  Homogeneous 2-Hops Broadcast in 2D , 2006, ICCSA.

[30]  Friedhelm Meyer auf der Heide,et al.  Algorithms — ESA 2001 , 2001, Lecture Notes in Computer Science.

[31]  Sandip Das,et al.  A Fast Algorithm for Point Labeling Problem , 2005, CCCG.

[32]  Sandip Das,et al.  High performance MCM routing: a new approach , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[33]  Subhas C. Nandy.  An Efficient k Nearest Neighbor Searching Algorithm for a Query Line , 2000, COCOON.