|Title:||Computational aspects of the refinement of 3D tetrahedral meshes||Authors:||Suarez, J. P.
Padron, M. A.
|UNESCO Clasification:||120601 Construcción de algoritmos||Issue Date:||2005||Journal:||Journal of Computational Methods in Sciences and Engineering||Abstract:||The refinement of tetrahedral meshes is a significant task in many numerical and discretizations methods. The computational aspects for implementing refinement of meshes with complex geometry need to be carefully considered in order to have real-time and optimal results. In this paper we study some computational aspects of a class of tetrahedral refinement algorithms. For local adaptive refinement we give numerical results of the computational propagation cost of a general class of longest edge based refinement and show the implications of the geometry in the global process. Moreover we study the conformity process based on the longest edge bisection and give an algorithm and data structure to efficiently handle tetrahedral refinement.||URI:||http://hdl.handle.net/10553/54654||ISSN:||1472-7978||Source:||Journal of Computational Methods in Sciences and Engineering [ISSN 1472-7978], v. 5 (4), p. 215-224|
|Appears in Collections:||Artículos|
checked on Dec 3, 2023
WEB OF SCIENCETM
checked on Oct 2, 2022
checked on Jul 29, 2023
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.