For points , ..., , the convex hull is then given by the expression Computing the convex hull is a problem in of Applied Physics, Electronics and Communication Engineering, Islamic University, Kushtia, Bangladesh. The convex hull problem is problem of finding all the vertices of convex polygon, P of: a set of points in a plane such that all the points are either on the vertices of P or: inside P. TH convex hull problem has several applications in geometrical problems, computer graphics and game development. Computing the convex hull of a set of points is a fundamental problem in computational geometry, and the Graham scan is a common algorithm to compute the convex hull of a set of 2-dimensional points. So you've see most of these things before. We can visualize what the convex hull looks like by a thought experiment. There is no obvious counterpart in three dimensions. Divide and Conquer steps are straightforward. We enclose all the pegs with a elastic band and then release it to take its shape. For example, the convex hull must be used to find the Delaunay mesh of some points which is significantly needed in 3D graphics. In these type of problems, the recursive relation between the states is as follows: dp i = min(b j *a i + dp j),where j ∈ [1,i-1] b i > b j,∀ i