A DYNAMIC NEURAL-NET TO COMPUTE CONVEX-HULL

Computing the convex hull of a planar point set is a well-known proble m and several conventional algorithms are available to solve it. We ha ve formulated this problem into a self-organizing neural net model. Se lf-organization is a learning phenomenon that works in the human visio n system. In this paper, an artificial self-organizing neural net mode l is suggested. The net is dynamic in the sense that it can automatica lly grow itself without supervision and hence no prior knowledge on th e number of processors is required. It has been established that such a net can compute the convex hull of a planar point set. Experimental results have been provided. Such a formulation helps parallelism and t he biological modeling of the problem.