Abstract
AbstractIn this paper, we discuss a class of adaptive refinement algorithms for generating unstructured meshes in two and three dimensions. We focus on skeleton‐based refinement (SBR) algorithms as proposed by Plaza and Carey (Appl. Numer. Math. 2000; 32:195) and provide an extension that involves the introduction of the graph of the skeleton for meshes consisting of simplex cells. By the use of data structures derived from the graph of the skeleton, we reformulate the SBR scheme and devise a more natural and consistent approach for this class of adaptive refinement algorithms. As an illustrative case, we discuss in detail the graphs for 2D refinement of triangulations and for 3D we propose a corresponding new face‐based data structure for tetrahedra. Experiments using the 2D algorithm and exploring the properties of the associated graph are provided. Copyright © 2001 John Wiley & Sons, Ltd.
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: Communications in 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.
