|
This article is cited in 1 scientific paper (total in 1 paper)
Higher-order accurate meshing of nonsmooth implicitly defined surfaces and intersection curves
J. W. Stanford, T.-P. Fries Institute of Structural Analysis, Graz University of Technology Lessingstr. 25/II 8010 Graz, Austria
Abstract:
A higher-order accurate meshing algorithm for nonsmooth surfaces defined via Boolean set operations from smooth surfaces is presented. Input data are a set of level-set functions and a bounding box containing the domain of interest. This geometry definition allows the treatment of edges as intersection curves. Initially, the given bounding box is partitioned with an octree that is used to locate corners and points on the intersection curves. Once a point on an intersection curve is found, the edge is traced. Smooth surfaces are discretized using marching cubes and then merged together with the advancing-front method. The piecewise linear geometry is lifted by projecting the inner nodes of the Lagrangian elements onto the surface or intersection curve. To maintain an accurate mesh, special attention is paid to the accurate meshing of tangential intersection curves. Optimal convergence properties for approximation problems are confirmed in numerical studies.
Key words:
higher-order finite elements, meshing, higher-order, implicit surface, intersection problems.
Received: 26.06.2019 Revised: 26.06.2019 Accepted: 05.08.2019
Citation:
J. W. Stanford, T.-P. Fries, “Higher-order accurate meshing of nonsmooth implicitly defined surfaces and intersection curves”, Zh. Vychisl. Mat. Mat. Fiz., 59:12 (2019), 2131; Comput. Math. Math. Phys., 59:12 (2019), 2093–2107
Linking options:
https://www.mathnet.ru/eng/zvmmf11004 https://www.mathnet.ru/eng/zvmmf/v59/i12/p2131
|
Statistics & downloads: |
Abstract page: | 45 |
|