Abstract
An efficient skeletonizing algorithm is presented for the hexagonal grid. The skeleton has unit width, except at crossings and in regions of the shape having even width. Otherwise the skeleton has all the properties generally required for correct skeletons. It includes all local maxima, so complete recovery of the original shape is obtained by using the reverse distance transformation. The algorithm uses only local operations. Thus it can be performed both on sequential and parallel computers. In the sequential case described only three passes through the image are necessary, two to compute the distance transform and one for the identification of skeletal pixels. >
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.
