Abstract

The objective of this paper is to extract concave and convex feature regions via segmenting surface mesh of a mechanical part whose surface geometry exhibits drastic variations and concave-convex features are equally important when modeling. Referring to the original approach based on the minima rule (MR) in cognitive science, we have created a revised minima rule (RMR) and presented an improved approach based on RMR in the paper. Using the logarithmic function in terms of the minimum curvatures that are normalized by the expectation and the standard deviation on the vertices of the mesh, we determined the solution formulas for the feature vertices according to RMR. Because only a small range of the threshold parameters was selected from in the determined formulas, an iterative process was implemented to realize the automatic selection of thresholds. Finally according to the obtained feature vertices, the feature edges and facets were obtained by growing neighbors. The improved approach overcomes the inherent inadequacies of the original approach for our objective in the paper, realizes full automation without setting parameters, and obtains better results compared with the latest conventional approaches. We demonstrated the feasibility and superiority of our approach by performing certain experimental comparisons.

Highlights

  • IntroductionMesh segmentation for region extraction as applied to a triangular surface mesh is a key prerequisite for subsequent major procedures (such as texture mapping, remeshing and quadrangulation)[1], currently it has been a significant and popular research topic for decades in computer graphics

  • Mesh segmentation for region extraction as applied to a triangular surface mesh is a key prerequisite for subsequent major procedures[1], currently it has been a significant and popular research topic for decades in computer graphics

  • This paper presents an improved mesh segmentation approach based on an original approach used specially for natural surface mesh models in principle of cognitive science, to extract feature mesh regions that composed of concave and convex feature regions, from the surface mesh of mechanical parts

Read more

Summary

Introduction

Mesh segmentation for region extraction as applied to a triangular surface mesh is a key prerequisite for subsequent major procedures (such as texture mapping, remeshing and quadrangulation)[1], currently it has been a significant and popular research topic for decades in computer graphics. For reason that their surface geometry exhibits dramatic variations and their concave and convex features are important during modeling, the targeted approach of mesh segmentation for feature region extraction should differ from those. Previous ones used on natural surface mesh models whose surface geometry exhibits slight, gradual variations and concave features are relatively important compared to convex features in cognitive science. This paper presents an improved mesh segmentation approach based on an original approach used specially for natural surface mesh models in principle of cognitive science, to extract feature mesh regions that composed of concave and convex feature regions, from the surface mesh of mechanical parts. Extracting feature mesh regions in the paper is categorized as geometric segmentation in the sense that they have the same objective of obtaining regions with certain desired geometric property

Objectives
Findings
Discussion
Conclusion
Full Text
Paper version not known

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 call

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.