Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
