Abstract
In this paper, an algorithm to construct the approximate medial axis of an object is proposed. The algorithm is based on the Delaunay triangulation of points on the object boundaries. Because the medial axis constructed by this algorithm consists of a set of discrete points, we call it the discrete medial axis. Based on the classification of these discrete points, the structure of the medial axis surfaces of a three-dimensional object are discussed in detail. The correctness of the algorithm is substantiated by a brief theoretical analysis.
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 callMore From: International Journal of Computational Geometry & Applications
Disclaimer: 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.
