Abstract

How to keep local features of the mesh and adaptive simplification becomes the research hotspot. This paper proposes a mesh segmentation algorithm and an adaptive mesh simplification algorithm, based on quadric error metric of Garland, that can keep the triangle grid local features effectively. The algorithm introduces vertex slope as the weighted value of the basic quadric error metric. Experimental results indicate that the algorithm, not only inherits higher speed and quality of the quadric error metric algorithm, but also overcomes the shortcoming of uniform grid.

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.