Abstract
A new 3D parallel thinning algorithm for medial surfaces is proposed. It works in cubic grids with the 6-connectivity. This algorithm is based on a precise definition of end points which are points belonging to surfaces or curves. We give a necessary and sufficient Boolean condition for characterizing points which are simple, non-ends and which are border points of a certain type (N, S, E, W, U, D). The algorithm consists precisely in removing all points satisfying the condition: it has a little computational cost and it is based on a clear thinning criterion.
Sign-in/Register to access full text options 
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.
