Abstract
We present a refinement algorithm for unstructured tetrahedral grids which generates possibly highly non-uniform but nevertheless consistent (closed) and stable triangulations. Therefore we first define somelocal regular and irregular refinement rules that are applied to single elements. Theglobal refinement algorithm then describes how these local rules can be combined and rearranged in order to ensure consistency as well as stability. It is given in a rather general form and includes also grid coarsening.
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.
