Abstract

Mesh adaptation plays a critical role in balancing computational efficiency and numerical accuracy. Three types of mesh adaptation techniques exist today, namely, mesh improvement, mesh refinement and mesh simplification, and, for each of these, several algorithms have been proposed. Current mesh adaptation algorithms yield acceptable geometric mesh quality, but provide limited control over topological quality.In this paper, we introduce a unified algorithm for all three types of mesh adaptation, specifically for quadrilateral meshes. The algorithm builds upon the Minimum Singularity Templates (MST) proposed by the authors for improving the topological quality of a quadrilateral mesh. The MST is extended here to define the concept of an αMST where a single parameter α controls mesh adaptation: α=1 for mesh improvement, α>1 for mesh refinement, and α<1 for mesh simplification. The proposed algorithm generates a mesh that is adapted to user requirements of high geometric and topological qualities. Further, it is non-hierarchical and stateless, and yet it provides an arbitrary level of mesh adaptation. Finally, since cyclic chords can play an important role in quadrilateral mesh adaptation, we provide a simple constructive algorithm to insert such chords using αMST.The proposed αMST templates can also be used to improve surface quadrilateral meshes using conformal mapping of surface charts. Furthermore, rotating the templates in the direction of cross-fields allows mesh edges to align along curvature lines. The proposed 3D generalization is fast, scalable, and inexpensive while improving alignment, shape, size, and sparsely placing the singularities. Several examples (both in 2D/3D) are presented that demonstrate the robustness, efficiency, and versatility of the proposed concept and algorithm.

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.