Abstract
This paper presents an algorithm with the purpose of improving upon the already successful constrained Delaunay triangulation (CDT) skeletonisation technique. Using such a triangulation to construct a skeleton has proven very effective, that can sometimes, however, produce triangles that do not represent the true nature of the underlying shape. The contour pixels chosen for triangulation are of significant importance, as they determine the triangle edges that define the skeleton. The algorithm described in this paper deals with this problem by inserting new triangulation points in strategic locations in end, normal and junction triangles. Results show that the skeletons produced by this algorithm are accurate, robust against noise and, above all, comply much better with a human's perception of the image than the original triangulation method.
Published Version
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.
