Abstract
AbstractFast and accurate scanning devices are nowadays widely used in many engineering and biomedical fields. The resulting discrete data is usually directly converted into polygonal surface meshes, using ‘brute‐force’ algorithms, often resulting in meshes that may contain several millions of polygons. Simplification is therefore required in order to make storage, computation and display possible if not efficient. In this paper, we present a general scheme for mesh simplification and optimization that allows to control the geometric approximation as well as the element shape and size quality (required for numerical simulations). Several examples ranging from academic to complex biomedical geometries (organs) are presented to illustrate the efficiency and the utility of the proposed approach. Copyright © 2004 John Wiley & Sons, Ltd.
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 callMore From: International Journal for Numerical Methods in Engineering
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.
