Abstract
AbstractComplex mesh models usually affect the performance of algorithms for CAD applications. Therefore, it is often desirable to use simplified models and at the same time preserves the general features of the shape. In this paper, we present an entropy based surface mesh simplification algorithm which can rapidly and efficiently produce high quality approximations of triangle mesh models. The algorithm uses iterative contraction of edges to simplify models. It first exploits the geometric feature of model surface by estimating vertex curvature entropy and then iteratively contracts edges with relatively lower simplification cost. The simplification cost is measured by a combination of vertex curvature and curvature entropy of the two vertices compositing the edge. The goal is to simplify regions that are relatively flat while preserving salient features of the shape. Experiments show promising results of the algorithm.
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.
