A self-organizing neural-network model is proposed for computation of the c
onvex-hull of a given set of planar points. The network evolves in such a m
anner that it adapts itself to the hull-vertices of the convex-hull. The pr
oposed network consists of three layers of processors. The bottom layer com
putes some angles which are passed to the middle layer. The middle layer is
used for computation of the minimum angle (winner selection). These inform
ation are passed to the topmost layer as well as fed back to the bottom lay
er. The network in the topmost layer self-organizes by labeling the hull-pr
ocessors in an orderly fashion so that the final convex-bull is obtained fr
om the topmost layer. Time complexity of the proposed model is analyzed and
is compared with existing models of similar nature.