Abstract
This paper is composed of two parts. In the first one, we present an analysis of existing discrete surface segmentation algorithms. We show that two classes of algorithms can actually be defined according to discrete surface and plane definitions. In the second part, we prove the link between the two classes presented. To do so, we propose a new labelling of the surface elements which leads to a segmentation algorithm of the first class that can be easily transformed into a segmentation algorithm of the second class.
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.
