Abstract
3D mesh segmentation has been widely used in fields such as computer vision. Existing algorithms have the problems of over- and under-merging when performing 3D mesh segmentation. In this paper, we propose a robust and efficient segmentation algorithm using a so-called two-stage merging strategy. We first define a flatness measure for mesh faces, and partition the given mesh model into different patches based on the flatness measure. In order to handle the over- and under-merging problems, we first perform a local merging operation and then a global merging operation. Experiments show that our algorithm is effective, and works well even for models without obvious part boundaries at their joints.
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.
