Minimum Bounding Circle of 2D Convex Hull

In mathematical, minimum enclosing circle problem is a Geometrical issue of calculating the smallest circle that contains all of a finit set of points in the Euclidean plane. The problem of finding the minimum circuler container can ubiquitous in diverse set of applications such as collision avoidance, hidden object detection and in planning the location of placing ashared facility like a hospital, gas station, or sensor devices etc. moreover, The usefulness of minimum containers occurs in a variety of industrial applications like packing and optimum layout design. The algorithm can be applied to many other fields, ranging from a straightforward consideration of whether an object will fit into a predetermined of circuler container, or whether it can be made from standard sized stock. In this paper, we describes a method for determining the minimum bounding ball of a set of 2D convex polygon based on Chan's algorithm which consist of graham scan with Jarvis march methods. The suggested method involves of three steps. Firstly, generates any number of 2D points set using randomly function. Secondly, we compute the convex hull for points set depend on Chan's algorithm. the third step of proposed scheme includes finding the minimum enclosing circle of convex polygon. the experimental analysis and results of presented algorithm find that the computational time is significant for any number of vertices of 2D points set.