![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Two new methods are described for finding the vertices of the convex hull of a planar figure. Both were derived conceptually from Rosenfeld and Kak's technique but are much faster. One uses chain coding and the other a list of the vertices of a polygonal approximation of the edge of the figure. Both methods allow the concavities to be isolated easily and specified in the same format as the input data. The methods thus lend themselves admirably to the development of concavity trees as shape descriptors.