Implementation of bottleneck non cross matching for a set of convex points using convex hull and development of an image search algorithim

The convex hull of a set X of points in the Euclidean plane is the smallest convex set that contains X. Let P be a set of 2n points in the plane which are in convex position. In this paper we propose to compute in O (n 3 ) time and O(n 2 ) space a bottleneck non-crossing matching of P. We compute the longest edge of bottleneck matching via dynamic programming. We extend our idea towards several applications of convex hull which includes Pattern matching and shape based image retrieval. The results shown in this paper illustrate the various applications of convex hull especially on shape based image retrieval and implements the bottleneck non cross matching on a set of convex points in O (n 3 ) time and O(n 2 ) space.